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

IEEE Journal on Selected Areas in Communications

Volumn 22, Issue 1, 2004, Pages 151-163

  Xu, Jun ^a   Kumar, Abhishek ^a   Yu, Xingxing ^b  

^a Georgia Institute of Technology ^*  (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication system routing; Modeling; Routing; System analysis and design

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; OPTIMIZATION; SYSTEMS ANALYSIS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

DISTRIBUTED HASH TABLE; PEER-TO-PEER NETWORKS; ROUTING;

CONGESTION CONTROL (COMMUNICATION);

EID: 0742303980     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.818805     Document Type: Article

References (15)

1. B. Y. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Univ. California, Berkeley, CA, Tech. Rep. UCB/CSB-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. ACM Symp. Parallel Algorithms and Architectures, Newport, RI, June 1997, pp. 311-320.
3. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware), Heidelberg, Germany, Nov. 2001, pp. 329-350.
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. ACM SIGCOMM'01, San Diego, CA, 2001, pp. 149-160.
5. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM'01, San Diego, CA, 2001, pp. 161-172.
6. D. Peleg and E. Upfal, "A trade-off between space and efficiency for routing tables," J. 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. 1st Workshop Peer-to-Peer Systems (IPTPS'01), Cambridge, MA, 2001, pp. 45-52.
8. R. Karp, A counter example, Private correspondence, Sept. 2002.
9. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. 21st ACM PODC, 2002, pp. 183-192.
10. L. Kleinrock, Queueing Systems. New York: Wiley, 1975, vol. I and II.
11. A. Kumar, S. Merugu, J. Xu, E. W. Zegura, and X. Yu, "Ulysses: A robust, low-diameter, low-latency, peer-to-peer network," College of Comput., Georgia Inst. Tech., Atlanta, CA, Tech. Rep., May 2003.
12. P. Francis, "Yoid: Extending the Internet multicast architecture,", Apr. 2000. Unrefereed Rep., 38 pages.
13. K. C. Knowlton, "A fast storage allocator," Commun. ACM, vol. 8, no. 10, pp. 623-625, Oct. 1965.
14. D. E. Knuth, The Art of Computer Programming, 3rd ed. Reading, MA: Addison-Wesley, 1997, vol. 1.
15. P. W. Purdom Jr. and S. M. Stigler, "Statistical properties of the buddy system," J. ACM, vol. 17, no. 4, pp. 683-697, Oct. 1970.