Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience

IEEE/ACM Transactions on Networking

Volumn 13, Issue 5, 2005, Pages 1107-1120

  Loguinov, Dmitri ^a   Casas, Juan ^b   Wang, Xiaoming ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

De Bruijn graphs; Diameter degree tradeoff; Peer to peer networks

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; ROUTERS; THEOREM PROVING;

DE BRUIJIN GRAPHS; DIAMETER DEGREE TRADEOFF; FAULT RESILIENCE; PEER-TO-PEER NETWORKS; ROUTING DISTANCE;

TELECOMMUNICATION NETWORKS;

EID: 28044461525     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.857072     Document Type: Article

References (47)

1. J. Aspnes, Z. Diamadi, and G. Shah, "Fault-tolerant routing in peer-to-peer systems," in Proc. ACM PODC, Jul. 2002, pp. 223-232.
2. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced allocations," SIAM J. Comput., vol. 29, no. 1, pp. 180 200, Feb. 2000.
3. M. C. Azizaglu and O. Egecioglu, "The isoperimetric number and the bisection width of generalized cylinders," in Proc. 9th Quadrennial Int. Conf. Graph Theory, Combinatorics, Algorithms, and Applications, Special Issue on Electronic Notes in Discrete Mathematics, 2002.
4. A.-L. Barabasi, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: The topology of the world wide web," Physica A, vol. 281, pp. 69-77, 2000.
5. T. Bu and D. Towsley, "On distinguishing between internet power law topology generators," Proc. IEEE INFOCOM, pp. 638-647, 2002.
6. C. Baransel, W. Doboseiwicz, and P. Gburzynski, "Routing in multi-hop packet switching networks: Gbps challenge," IEEE Netw. Mag., vol. 9, no. 3, pp. 38-61, 1995.
7. W. G. Bridges and S. Toueg, "On the impossibility of directed moore graphs," J. Combinator Theory, ser. B29, no. 3, pp. 339-341, 1980.
8. F. Chung, "Diameters of communication networks," AMS Proc. Symp. Applied Mathematics, Mathematics of Information Processing., pp. 1-18, 1984.
9. J. Considine and T. A. Florio, "Scalable peer-to-peer indexing with constant state," Boston Univ., Boston, MA, Tech. Rep. 2002-026, Aug. 2002.
10. D.-Z. Du, D. F. Hsu, H. Q. Ngo, and G. W. Peck, "On connectivity of consecutive-d digraphs," Discrete Mathematics, vol. 257, no. 2-3, pp. 371-384, 2002.
11. R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke, "A better upper bound on the bisection width of de bruijn networks," in Proc. Symp. Theoretic. Aspects Comput. Sci. (STACS), 1997, pp. 511-522.
12. A. Fiat and J. Saia, "Censorship resistant peer-to-peer content addressable networks," in Proc. Symp. Discrete Algorithms, 2002, pp.94-103.
13. P. Fraigniaud and P. Gauron, "An overview of the content-addressable network D2B," in Proc. ACM PODC, Jul. 2003, p. 151.
14. M. J. Freedman and R. Vingralek, "Efficient peer-to-peer lookup based on a distributed trie," Proc. IPTPS, pp. 66-75, Mar. 2002.
15. P. Ganesan, Q. Sun, and H. Garcia-Molina, "YAPPERS: A peer-to-peer lookup service over arbitrary topology," Proc. IEEE INFOCOM, pp. 1250-1260, 2003.
16. K. P. Gummadi, R. Gummadi, S. D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The impact of DHT routing geometry on resilience and proximity," in Proc. ACM SIGCOMM, Aug. 2003, pp. 381-394.
17. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 48, no. 2, pp. 388-404, Mar. 2000.
18. M. G. Hluchyj and M. J. Karol, "Shufflenet: An application of generalized perfect shuffles to multihop lightwave networks," Proc. IEEE INFOCOM, pp. 379-390, 1988.
19. M. Imase and M. Itoh, "Design to minimize diameter on building-block network," IEEE Trans. Computers, vol. C-30, no. 6, pp. 439-442, 1981.
20. F. Kaashoek and D. R. Karger, "Koorde: A simple degree-optimal hash table," Proc. IPTPS, pp. 98-107, Feb. 2003.
21. A. Kumar, S. Merugu, J. Xu, and X. Yu, "Ulysses: A robust, low-diameter, low-latency peer-to-peer network," Proc. IEEE ICNP, pp. 258-267, 2003.
22. C. Law and K.-Y. Siu, "Distributed construction of random expander graphs," Proc. IEEE INFOCOM, pp. 2133-2143, 2003.
23. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. New York: Academic/Morgan Kaufmann, 1991.
24. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the evolution of peer-to-peer networks," in Proc. ACM PODC, Jul. 2002, pp. 233-242.
25. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience," in Proc. ACM SIGCOMM, Aug. 2003, pp. 395-406.
26. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. ACM PODC, Jul. 2002, pp. 183-192.
27. G. S. Manku, "Routing networks for distributed hash tables," in Proc. ACM PODC, Jul. 2003, pp. 133-142.
28. G. S. Manku, M. Bawa, and P. Raghavan, "Symphony: Distributed hashing in a small world" Proc. USENIX Symp. Internet Technologies and Systems (USITS), 2003.
29. G. S. Manku, M. Naor, and U. Weider, "Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks," in Proc. ACM STOC, Jun. 2004, pp. 54-63.
30. M. Naor and U. Wieder, "Novel architectures for P2P applications: The continuous-discrete approach," in Proc. ACM SPAA, Jun. 2003, pp. 50-59.
31. G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter P2P networks," in Proc. IEEE FOCS, 2001, pp. 492-499.
32. C. G. Plaxton, R. Rajaraman, and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in Proc. ACM SPAA, Jun. 1997, pp. 311-320.
33. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, Aug. 2001, pp. 161-172.
34. S. Ratnasamy, S. Shenker, and I. Stoica, "Routing algorithms for DHTs: Some open questions," Proc. IPTPS, pp. 45-52, 2002.
35. S. M. Reddy, J. G. Kuhl, S. H. Hosseini, and H. Lee, "On digraph with minimum diameter and maximum connectivity," in Proc. Allerton Conf. Communications, Control and Computers, 1982, pp. 1018-1026.
36. J. Rolim, P. Tvrdik, J. Trdlicka, and I. Vrto, "Bisecting de Bruijn and Kautz graphs," Discrete Appl. Math., vol. 85, no. 1, pp. 87-97, Jun. 1998.
37. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems," in Proc. IFIP/ACM Int. Conf. Distributed Systems Platforms, 2001, pp. 329-350.
38. J. Saia, A. Fiat, S. Gribble, A. R. Karlin, and S. Saroiu, "Dynamically fault-tolerant content addressable networks," Proc. IPTPS, Mar. 2002.
39. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, "HyperCuP - Hypercubes, ontologies, and efficient search on P2P networks," in Proc. Workshop on Agents and P2P Computing, 2002.
40. K. N. Sivarajan and R. Ramaswami, "Lightwave networks based on de Bruijn graphs," IEEE/ACM Trans. Netw., vol. 2, no. 1, pp. 70-79, Jan. 1994.
41. M. A. Sridhar and C. S. Raghavendra, "Fault-tolerant networks based on the de Bruijn graph," IEEE Trans. Computers, vol. 40, no. 10, pp. 1167-1174, Oct. 1991.
42. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. ACM SIGCOMM, Aug. 2001, pp. 149-160.
43. D. W. Stroock, Probability Theory, an Analytic View. Cambridge, U.K.: Cambridge Univ. Press, 2000.
44. D. A. Tran, K. A. Hua, and T. T. Do, "ZIGZAG: An efficient peer-to-peer scheme for media streaming," Proc. IEEE INFOCOM, pp. 1283-1292, 2003.
45. X. Wang, Y. Zhang, X. Li, and D. Loguinov, "On zone-balancing of peer-to-peer networks: Analysis of random node join," in Proc. ACM SIGMETRICS, Jun. 2004, pp. 211-222.
46. J. Xu, A. Kumar, and X. Yu, "On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks," IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 151-163, Jan. 2004.
47. B. Y. Zhao, J. D. Kubiatowicz, and A. Joseph, "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,", Univ Calfornia Berkeley Tech. Rep., Apr. 2001.