On static and dynamic partitioning behavior of large-scale networks

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2005, Issue , 2005, Pages 345-357

  Leonard, Derek ^a   Yao, Zhongmei ^a   Wang, Xiaoming ^a   Loguinov, Dmitri ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ISOLATED NODES; P2P NETWORK; RANDOM FAILURE; RANDOM GRAPH;

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; LARGE SCALE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

TELECOMMUNICATION NETWORKS;

EID: 33750948601     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2005.27     Document Type: Conference Paper

References (41)

1. M. Abadi and A. Galves, "Inequalities for the occurrence times of rare events in mixing processes. The State of the Art," Markov Proc. Relat. Fields, vol. 7, no. 1, 2001.
2. D. Aldous and M. Brown, "Inequalities for Rare Events in Time-Reversible Markov Chains I," Stochastic Inequalities, vol. 22, 1992.
3. D.J. Aldous and M. Brown, "Inequalities for Rare Events in Time-Reversible Markov Chains II," Stochastic Processes and their Applications, vol. 44, 1993.
4. R. Arratia, L. Goldstein, and L. Gordon, "Two Moments Suffice for Poisson Approximations: The Chen-Stein Method, The Annals of Probability, vol. 17, no. 1, Janurary 1989.
5. R. Bhagwan, S. Savage, and G.M. Voelker, "Understanding Availability," IPTPS, February 2003.
6. R Boesch, D. Gross, C. Suffel, "A Coherent Model for Reliability of Multiprocessor Networks," IEEE Trans. on Reliability, vol. 45, no. 4, December 1996.
7. B. Bollobás, "The Evolution of the Cube," Combinatorial Mathematics, 1983.
8. B. Bollobás, Random Graphs. Cambridge Univ. Press, 2001.
9. Yu.D. Burtin, "Connection Probability of a Random Subgraph of an n-Dimensional Cube, Probl. Pered. Inf., vol. 13, no. 2, April-June 1977.
10. F.E. Bustemante and Y. Qiao, "Friendships that Last: Peer Lifespan and its Role in P2P Protocols," International Workshop on Web Caching and Distribution, September 2003.
11. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella Like P2P Systems Scalable," ACM SIGCOMM, August 2003.
12. J. Chen, I. A. Kanj, and G. Wang, "Hypercube Network Fault Tolerance: A Probabilistic Approach," ICPP, August 2002.
13. B. Chun, B. Zhao, and J. Kubiatowicz, "Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks," IPTPS, February 2005.
14. P. Erdös, and A. Rényi, "On the Evolution of Random Graphs", Publications of the Math. Inst. of the Hungarian Academy of Sc., 1960.
15. A. H. Esfahanian, "Generalized Measures of Fault Tolerance with Application to n-cube Networks," IEEE Transactions on Computers, vol. 38, 1989.
16. H. Frank, "Maximally Reliable Node Weighted Graphs," 3rd Ann. Conf. Information Sciences and Systems, March 1969.
17. A. Ganesh and L. Massoulie, "Failure Resilience in Balanced Overlay Networks," Allerton Conference on Communication, Control and Computing, October 2003.
18. Q.-P. Gu and S. Peng, "Unicast in Hypercubes with a Large Number of Faulty Nodes," IEEE Transactions on Parallel and Distributed Systems, vol. 10, 1999.
19. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," ACM SIGCOMM, August 2003.
20. M.F. Kaashoek and D. Karger, "Koorde: A Simple Degree-optimal Distributed Hash Table," IPTPS, February 2003.
21. A.K. Kel'mans, "Connectivity of Probabilistic Networks," Auto. Remote Contr., vol. 3, 1967.
22. M. Kijima. Markov Processes for Stochastic Modeling. Chapman & Hall, 1997.
23. S. Krishnamurthy, S. El-Ansarh, E. Aurell, and S. Haridi, "A Statistical Theory of Chord under Churn," IPTPS, February 2005.
24. S. Latifi, "Combinatorial Analysis of the Fault Diameter of the n-cube," IEEE Transactions on Computers, vol. 42, 1993.
25. R.B. Lenin and P.R. Parthasarathy, "Transient Analysis in Discrete Time of Markovian Queues with Quadratic Rates," Southwest J. Pure and Appl. Math., July 2000.
26. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of the Peer-to-Peer Systems," ACM PODC, 2002.
27. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, "Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience," ACM SIGCOMM, August 2003.
28. G.S. Manku, M. Naor, and U. Weider, "Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks," ACM STOC, June 2004.
29. L. Massoulié, A.-M. Kermarrec, and A. Ganesh, "Network Awareness and Failure Resilience in Self-Organising Overlay Networks," IEEE Symposium on Reliable Distributed Systems, October 2003.
30. W. Najjar and J.-L. Gaudiot, "Network Resilience: A Measure of Network Fault Tolerance, IEEE Trans. on Computers, vol. 39, no. 2, 1990.
31. K. Palm, "Intensitätsschwankungen in Fernsprecherverkehr," Ericsson Technics, 44, 1943.
32. G. Pandurangan, P. Raghavan, E. Upfal, "Building Low-Diameter Peer-to-Peer Networks," IEEE JSAC, vol. 21, no. 6, August 2003.
33. M.D. Penrose, "On k-connectivity for a Geometric Random Graph," Random Structures & Algorithms, vol. 15, no. 2, 1999.
34. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," ACM SIGCOMM, August 2001.
35. S. Resnick. Adventures in Stochastic Processes. Birkhäuser, Boston, 2002.
36. A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized, Object Location and Routing for Large-Scale Peer-to-Peer Systems," IFIP/ACM Middleware, November 2001.
37. S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement study of Peer-to-Peer File Sharing Systems," MMCN, 2002.
38. 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.
39. K. Sutner, A. Satyanarayana, and C. Suffel, "The Complexity of the Residual Node Connectedness Reliability Problem," SIAM J. Computing, vol. 20, 1991.
40. X. Wang, Y. Zhang, X. Li, and D. Loguinov, "On Zone-Balancing of Peer-to-Peer Networks: Analysis of Random Node Join," ACM SIGMETRICS, June 2004.
41. 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.