On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 2177-2187

  Xu, Jun ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

congestion free; distributed hash table; Fundamental tradeoff; network diameter; peer to peer routing; routing table size

Indexed keywords

CONGESTION-FREE; DISTRIBUTED HASH TABLE; FUNDAMENTAL TRADEOFF; NETWORK DIAMETER; PEER-TO-PEER ROUTING; ROUTING TABLE;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS;

PEER TO PEER NETWORKS;

EID: 0042975014     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2003.1209238     Document Type: Conference Paper

References (11)

1. B. Y. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Tech. Rep., U.C. Berkeley Tech. Report UCB/CSD-01-1141, 2001.
2. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. of ACM Symposium on Parallel Algorithms and Architectures, 1997.
3. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov. 2001, pp. 329-350. (Pubitemid 33362020)
4. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. of ACMSIGCOMM'01, San Diego, CA, 2001, pp. 149-160. (Pubitemid 32981961)
5. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. of ACM SIGCOMM'01, San Diego, CA, 2001.
6. D. Peleg and E. Upfal, "A trade-off between space and efficiency for routing tables," Journal of the ACM, vol. 36, no. 3, pp. 510-530, July 1989.
7. S. Ratnasamy, S. Shenker, and I. Stoica, "Routing algorithms for dhts: Some open questions," in Proc. of 1st Workshop on Peer-to-Peer Systems (IPTPS'01), 2001.
8. Dahlia Malkhi, Moni Naor, and David Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. of the 21st ACM PODC, 2002.
9. L. Kleinrock, Queueing Systems, vol. I and II, J. Wiley and Sons, 1975.
10. Richard Karp, "A Counter Example," Private correspondence, Sept. 2002.
11. A. Kumar, J. Xu, and X. Yu, "Ulysses: A low diameter peer-to-peer network," Tech. Rep., Collge of Computing, Georgia Inst. of Tech., Nov. 2002.