Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience

Computer Communication Review

Volumn 33, Issue 4, 2003, Pages 395-406

  Loguinov, Dmitri ^a   Kumar, Anuj ^a   Rai, Vivek ^a   Ganesh, Sai ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

de Bruijn; DHT; Graph Theory; Modeling; Peer to peer

Indexed keywords

CONTENT-ADDRESSABLE NETWORK (CAN); DE BRUIJN; DISTRIBUTED HASH TABLES (DHT); MODELING; OPTIMAL-DIAMETER GRAPHS; PEER-TO-PEER STRUCTURES;

ASYMPTOTIC STABILITY; COMPUTER ARCHITECTURE; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HAMILTONIANS; HEURISTIC METHODS; INTERNET; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; ROUTERS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 1242310022     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. J. Aspnes, Z. Diamadi, and G. Shah, "Fault-Tolerant Routing in Peer-to-Peer Systems," ACM PODC, July 2002.
2. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced Allocations," SIAM J. on Computing, vol. 29, no. 1, 1999.
3. A.-L. Barabasi, R. Albert, and H. Jeong, "Scale-free Characteristics of Random Networks: The Topology of the World Wide Web," Physica A 281, 2000.
4. T. Bu and D. Towsley, "On Distinguishing between Internet Power Law Topology Generators," IEEE INFOCOM, 2002.
5. C. Baransel, W. Doboseiwicz, and P. Gburzynski, "Routing in Multi-hop Packet Switching Networks: Gbps Challenge," IEEE Network Magazine, 1995.
6. W.G. Bridges and S. Toueg, "On the Impossibility of Directed Moore Graphs," Journal of Combinatorial Theory, series B29, no. 3, 1980.
7. F. Chung, "Diameters of Communication Networks," Mathematics of Information Processing, 1984.
8. J. Considine and T.A. Florio, "Scalable Peer-to-Peer Indexing with Constant State," Boston U. Technical Report 2002-026, August 2002.
9. 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, 2002.
10. R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke, "A Better Upper Bound on the Bisection Width of de Bruijn Networks," Symposium on Theoretical Aspects of Computer Science (STACS), 1997.
11. A. Fiat and J. Saia, "Censorship Resistant Peer-to-Peer Content Addressable Networks," Symposium on Discrete Algorithms, 2002.
12. P. Fraigniaud and P. Gauron, "An Overview of the Content-Addressable Network D2B," ACM PODC, 2003.
13. M.J. Freedman and R. Vingralek, "Efficient Peer-To-Peer Lookup Based on a Distributed Trie," IPTPS, March 2002.
14. P. Ganesan, Q. Sun, and H. Garcia-Molina, "YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology," IEEE INFOCOM, March 2003.
15. 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," ACM SIGCOMM, August 2003.
16. P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. on Information Theory, March 2000.
17. K. Hildrum, J. Kubiatowicz, S. Rao, and B.Y. Zhao, "Distributed Object Location in a Dynamic Network," ACM SPAA, August 2002.
18. M.G. Hluchyj and M.J. Karol, "Shufflenet: An Application of Generalized Perfect Shuffles to Multihop Lightwave Networks," IEEE INFOCOM, 1988.
19. M. Imase and M. Itoh, "Design to Minimize Diameter on Building-Block Network," IEEE Trans. on Computers, vol. 30, 1981.
20. F. Kaashoek and D.R. Karger, "Koorde: A Simple Degree-optimal Hash Table," IPTPS, February 2003.
21. C. Law and K.-Y. Siu, "Distributed Construction of Random Expander Graphs," IEEE INFOCOM, 2003.
22. F.T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes," Academic Press / Morgan Kaufmann, 1991.
23. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of Peer-to-Peer Networks," ACM PODC, 2002.
24. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience," Texas A&M Technical Report, 2003.
25. D. Malkhi, M. Naor, D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly," ACM PODC, 2002.
26. G.S. Manku, M. Bawa, and P. Raghavan, "Symphony: Distributed Hashing in a Small World," USITS, 2003.
27. M. Naor and U. Wieder, "Novel Architectures for P2P Applications: the Continuous-Discrete Approach," ACM SPAA, June 2003.
28. G. Pandurangan, P. Raghavan, and E. Upfal, "Building Low-Diameter P2P Networks," IEEE Symposium on Foundations in Comp. Sci., 2001.
29. C.G. Plaxton, R. Rajaraman, A.W. Richa, "Accessing Nearby Copies of Replicated Objects in a Distributed Environment," ACM SPAA, 1997.
30. M. Raab and A. Steger, "Balls into Bins - A Simple and Tight Analysis," RANDOM, 1998.
31. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," ACM SIGCOMM, August 2001.
32. S. Ratnasamy, S. Shenker, I. Stoica, "Routing Algorithms for DHTs: Some Open Questions," IPTPS, 2002.
33. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, and H. Lee, "On Digraph with Minimum Diameter and Maximum Connectivity," Proceedings of Allerton Conf. on Communications, Control and Computers, 1982.
34. J. Rolim, P. Tvrdik, J. Trdlicka, and I. Vrto, "Bisecting de Bruijn and Kautz Graphs," Discrete Applied Math, vol. 85, no. 1, June 1998.
35. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," IFIP/ ACM International Conference on Distributed Systems Platforms, November 2001.
36. J. Saia, A. Fiat, S. Gribble, A.R. Karlin, and S. Saroiu, "Dynamically Fault-Tolerant Content Addressable Networks," IPTPS, March 2002.
37. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, "Hyper-CuP - Hypercubes, Ontologies and Efficient Search on P2P Networks," Workshop on Agents and P2P Computing, 2002.
38. K.N. Sivarajan and R. Ramaswami, "Lightwave Networks Based on de Bruijn Graphs," IEEE/ACM Trans. on Networking, vol. 2, no. 1, 1994.
39. M.A. Sridhar and C.S. Raghavendra, "Fault-tolerant Networks Based on the de Bruijn Graph," IEEE Trans. on Computers, vol. 40, 1991.
40. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," ACM SIGCOMM, August 2001.
41. D.A. Tran, K.A. Hua, and T.T. Do, "ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming," IEEE INFOCOM, 2003.
42. J. Xu, A. Kumar, and X. Yu, "On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks," To Appear in IEEE JSAC, Nov. 2003.
43. B.Y. Zhao, J.D. Kubiatowicz, and A. Joseph, "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing," UC Berkeley Technical Report, April 2001.
44. S.Q. Zhuang, B.Y. Zhao, and A.D. Joseph, "Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination," ACM NOSSDAV, June 2001.