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.
Sprout REF enhances the routing tables of a Chord DHT with additional trusted social links of online friends, to improve query results and reduce delays.
SPROUT: P2P routing with social networks
EDBT Workshops
Computer Science