Improving Network Robustness

Proceedings - International Conference on Autonomic Computing

Volumn , Issue , 2004, Pages 322-323

  Beygelzimer, Alina ^a   Grinstein, Geoffrey ^a   Linsker, Ralph ^a   Rish, Irina ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HUBS; NETWORK ROBUSTNESS; PATH LENGTH;

ALGORITHMS; GRAPH THEORY; INTERPOLATION; ROBUSTNESS (CONTROL SYSTEMS); STATISTICAL METHODS; TOPOLOGY;

COMPUTER NETWORKS;

EID: 4544245519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAC.2004.1301397     Document Type: Conference Paper

References (8)

1. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks. Nature, 406:378-382, 2000.
2. J. M. Carlson and J. Doyle. Highly optimized tolerance. Phys. Rev. E, 60:1412-1427, 1999.
3. P. Erdös and A. Rényi. On the evolution of random graphs. Bull. Inst. Internat. Statist., 38:343-347, 1961.
4. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Infocom, 2004.
5. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In IEEE Infocom, 2003.
6. M. Newman. The structure and function of complex networks. SIAM Review, 45(2): 167-256, 2003.
7. B. Shargel, H. Sayama, I. Epstein, and Y. Bar-Yam. Optimization of robustness and connectivity in complex networks: Phys. Rev. Letters, 90(6):068701, 2003.
8. J. Winick and S. Jamin. Inet-3.0: Internet topology generator. Tech. Report CSE-TR-456-02, Univ. of Michigan, 2002.