Robustness in large-scale random networks

Proceedings - IEEE INFOCOM

Volumn 4, Issue , 2004, Pages 2364-2373

  Kim, Minkyu ^a   Mèdard, Muriel ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorics; Graph theory; Network robust ness; Random graph

Indexed keywords

COMBINATORICS; NETWORK ROBUSTNESS; POWER-LAW DEGREE DISTRIBUTIONS; RANDOM GRAPH;

ALGORITHMS; BANDWIDTH; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RELIABILITY; TOPOLOGY;

GRAPH THEORY;

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

References (20)

1. W. Aiello, F. Chung and L. Lu, "A random graph model for massive graphs," Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171-180, 2000.
2. A.-L. Barabási, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
3. B. Bollobás, Random Graphs, 2nd edition, Academic Press, 2001.
4. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker and W. Willinger, "The origin of power laws in Internet topologies revisited," Proceedings of IEEE INFOCOM, pp. 608-617, 2002.
5. P. Christie and D. Stroobandt, "The interpretation and application of Rent's rule," IEEE Transactions on Very Large Scale Integraion (VLSI) Systems, vol. 8, pp. 639-648, 2000.
6. M. Faloutsos, P. Faloutsos and C. Faloutsos, "On power-law relationships of the Internet topology," Proceedings of ACM SIGCOMM, pp. 251-262, 1999.
7. H. Garmo, "The asymptotic distribution of long cycles in random regular graphs," Random Structures and Algorithms, vol. 15, pp. 43-92, 1999.
8. W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed proconfiguration: Ring-like speed with mesh-like capacity for self-planning network reconfiguration," Proceedings of the IEEE International Conference on Communications, vol. 1, pp. 537-543, 1998.
9. S. Janson, T. Luszak and A. Ruciński, Random Graphs, John Wiley & Sons, 2000.
10. M. Kim, Robustness in large-scale random networks, S.M. Thesis, Massachusetts Institute of Technology, 2003.
11. S. S. Lumetta and M. Médard, 'Towards a deeper understanding of link restoration algorithms for mesh networks," Proceedings of IEEE INFOCOM, vol. 1, pp. 367-375, 2001.
12. M. Molloy and B. Reed, "A critical point for random graphs with a given degree sequence," Random Structures and Algorithms, vol. 6, pp. 161-180, 1995.
13. M. E. J. Newman, "The structure and function of networks," SIAM Reviw, vol. 45, pp. 167-256, 2003.
14. M. E. J. Newman, S. H. Strogatz and D. J. Watts. "Random graphs with arbitrary degree distributions and their applications." Physical Review E. vol. 64, 026118, 2001.
15. S. Ramamurthy and B. Mukherjee, "Survivable WDM mesh networks, part I - Protection," Proceedings of IEEE INFOCOM, pp. 744-751, 1999.
16. S. Ramamurthy and B. Mukherjee. "Survivable WDM mesh networks, part II - Restoration," Proceedings of the IEEE International Conference on Communications, vol. 3, pp. 2023-2030, 1999.
17. M. Stoer, Design of Survivable Networks. New York: Springer-Verlag, 1992.
18. S. H. Strogatz, "Exploring complex networks." Nature, vol. 410, pp. 268-276, 2001.
19. N. C. Wormald, "The asymptotic connectivity of labelled regular graphs," Journal of Combinatorial Theory, Series B. vol. 31, pp. 156-167, 1981.
20. N. C. Wormald, "Models of random regular graphs." Surveys in Combinatorics, 1999. J.D. Lamb and D.A. Preece, eds. London Mathematical Society Lecture Note Series, vol. 276, pp. 239-298, Cambridge University Press, 1999.