Abstract
The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social networks can benefit P2P 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 significantly increases the probability of successful routing by using social links. Finally, we discuss further optimization and design choices for both the model and the routing algorithm.
This research is supported in part by NSF Grant (IIS-9817799).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castro, M., Drushel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: OSDI 2002 (2002)
D’Angelo, A.: BuddyZoo, http://www.buddyzoo.com
Friedman, E., Resnick, P.: The social cost of cheap pseudonyms. Journal of Economics and Management Strategy 10(2), 173–199 (1998)
Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proc. ACM SIGCOMM (2003)
Marti, S., Ganesan, P., Garcia-Molina, H.: SPROUT: P2P Routing with Social Networks. Tech. rep, dbpubs.stanford.edu/pub/2004-5 (2004)
Marti, S., Garcia-Molina, H.: Identity crisis: Anonymity vs. reputation in p2p systems. In: IEEE 3rd International Conference on Peer-to-Peer Computing, P2P 2003 (2003)
Puniyani, A.R., Lukose, R.M., Huberman, B.A.: Intentional Walks on Scale Free Small Worlds. ArXiv Condensed Matter e-prints (July 2001), http://aps.arxiv.org/abs/cond-mat/0107212
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Tech. Rep. TR-00-010, Berkeley, CA (2000)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329–350 (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marti, S., Ganesan, P., Garcia-Molina, H. (2005). DHT Routing Using Social Links. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)