CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2004-10
Previous version2004-5
Submitted on 1st of March 2004
Author Marti, Sergio; Ganesan, Prasanna; Garcia-Molina, Hector
Title SPROUT: P2P Routing with Social Networks
Date of publication March 2004
Published in First International Workshop on Peer-to-Peer Computing and Databases (P2P&DB 2004)
Citation Marti, Sergio; Ganesan, Prasanna; Garcia-Molina, Hector. SPROUT: P2P Routing with Social Networks, First International Workshop on Peer-to-Peer Computing and Databases (P2P&DB 2004)
Number of pages 12
Language English
Project Peers
Type Conference or Journal Paper
Subject group Databases and the Web; Distributed Systems; Miscellaneous
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.
Keywords peer-to-peer, trust, social networks
Contact address smarti@cs.stanford.edu
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Management of the document bysiroker@db.stanford.edu


    Stanford InfoLab Publication Server