Stanford InfoLab Publication Server

SPROUT: P2P Routing with Social Networks

Marti, Sergio and Ganesan, Prasanna and Garcia-Molina, Hector (2004) SPROUT: P2P Routing with Social Networks. In: First International Workshop on Peer-to-Peer Computing and Databases (P2P&DB 2004).

BibTeXDublinCoreEndNoteHTML

This is the latest version of this item.

[img]
Preview
PDF
137Kb

Abstract

In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that, by using social links, significantly increases the number of query results and reduces query delays. We discuss further optimization and design choices for both the model and the routing algorithm. Finally, we evaluate our model versus regular DHT routing and Gnutella-like flooding.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:peer-to-peer, trust, social networks
Subjects:Computer Science > Databases and the Web
Computer Science > Distributed Systems
Miscellaneous
Projects:Peers
Related URLs:Project Homepagehttp://infolab.stanford.edu/peers/
ID Code:763
Deposited By:Import Account
Deposited On:29 Feb 2004 16:00
Last Modified:23 Dec 2008 09:31

Available Versions of this Item

Download statistics

Repository Staff Only: item control page