Abstract
Most existing P2P networks route requests in O( kN 1/k), O(log N), O(log N/log k) hops, where N is the number of participating nodes and k is an adjustable parameter. Although some can achieve O(d)-hop routing for a constant d by tuning the parameter k, the neighbor locations however become a function of N, causing considerable maintenance overhead if the user base is highly dynamic as witnessed by the deployed systems. This paper explores the design space using the simple uniformly-random neighbor selection strategy, and proposes a random peer-to-peer network that is the first of its kind to resolve requests in d hops with a chosen probability of 1 - c, where c is a constant. The number of neighbors per node is within a constant factor from the optimal complexity O(N 1/d) for any network whose routing paths are bounded by d hops.
This research was Supported by the National Natural Science Foundation of China under Grant No. 60573142, The Shanghai Leading Academic Discipline Project under Grant No. T0502.
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
Gnutella: Gnutella, http://gnutella.wego.com
KaZaA: KaZaA, http://www.kazaa.com
Ritter, J.: Why Gnutella can’t Scale. No, Really, http://www.tch.org/gnutella.html
Ripeanu, M., Iamnitchi, A., Foster, I.: Mapping the Gnutella Network. IEEE Internet Computing Journal, Special Issue on Peer-to-Peer Networking 6(1) (2002)
Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic across Large Networks. In: ACM SIGCOMM Internet Measurement Workshop (August 2002)
Saroiu, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An Analysis of Internet Content Delivery Systems. In: Proc. of the 5th Symposium on Operating Systems Design and Implementation (OSDI) (December 2002)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)
Xu, J.: On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. In: Xu, J. (ed.) Proc. of IEEE INFOCOM 2003 (April 2003)
Plaxton, C., Rajaraman, R., Richa, A.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: Proc. of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (June 1997)
Druschel, P., Rowstron, A.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Proc. of 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001) (November 2001)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing, Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proc. of ACM SIGCOMM 2001 (August 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM 2001 (August 2001)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In: Proc. of ACM PODC 2002 (July 2002)
Kaashoek, F., Karger, D.R.: Koorde: A Simple Degree-Optimal Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Manku, G.S.: Routing Networks for Distributed Hash Tables. In: Proc. of 22nd ACM Symposium on Principles of Distributed Computing (PODC) (June 2003)
Risson, J., Moorsa, T.: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. Journal of Computer Networks 55 (2006)
Joung, Y.-J., Yang, L.-W., Fang, C.-T.: Keyword search in DHT-based peer-to-peer networks. IEEE Journal on Selected Areas in Communications 25 (2007)
Li, Z., Xie, G.: A Distributed Load Balancing Algorithm for Structured P2P Systems. In: Proc. of the 11th IEEE Symposium on Computers and Communications (June 2006)
Ferreira, R.A., Jagannathan, S., Grama, A.: Locality in structured peer-to-peer networks. Journal of Parallel and Distributed Computing 66 (2006)
Navabpour, S., Nejad, N.F., Abbaspour, M., Behzadi, A.: Secure Routing in Structured Peer to Peer File-Sharing Networks. In: Proc. of International Conference on Communications and Networking in China (ChinaCom 2006) (October 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, S., Li, Y., Rao, K., Zhao, L., Li, T., Chen, S. (2008). Building a Scalable P2P Network with Small Routing Delay. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds) Progress in WWW Research and Development. APWeb 2008. Lecture Notes in Computer Science, vol 4976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78849-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-78849-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78848-5
Online ISBN: 978-3-540-78849-2
eBook Packages: Computer ScienceComputer Science (R0)