Static and dynamic analysis of the Internet's susceptibility to faults and attacks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2003, Pages 2144-2154

  Park, Seung Taek ^a   Khrabrov, Alexy ^b   Pennock, David M ^b   Lawrence, Steve ^b   Giles, C Lee ^a,b,c   Ungar, Lyle H ^d  

^a The Pennsylvania State University   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE ANALYSIS; AVERAGE DIAMETER; DYNAMIC CHARACTERISTICS; FUTURE INTERNET; INTERNET DATA; MALICIOUS ATTACK; NETWORK MODELS; OPTIMAL PERFORMANCE; RANDOM FAILURES; RANDOM FAULTS; SIMULATED DATA; STATIC AND DYNAMIC ANALYSIS;

COMPUTER SIMULATION; DYNAMIC ANALYSIS; FAULT TOLERANCE; INTERNET; INTERNET PROTOCOLS; NETWORK PROTOCOLS; RESEARCH;

COMPUTER AIDED NETWORK ANALYSIS;

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

References (49)

1. A. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
2. F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Aberg, "The web of human sexual contacts," Nature, vol. 411, pp. 907-908, 2001.
3. B. Bollobás, Random Graphs, Cambridge Mathematical Library. Cambridge University Press, 2001.
4. S.N. Dorogovtsev and J.F.F. Mendes, "Evolution of networks," arXiv:cond-mat/0106144, 2001, submitted to Adv. Phys.
5. R. Albert, H. Jeong, and A. Barabási, "Error and attack tolerance of complex networks," Nature, vol. 406, pp. 378-382, 2000. (Pubitemid 30625551)
6. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-law Relationships of the Internet Topology," in SIGCOMM, 1999, pp. 251-262. (Pubitemid 32081870)
7. B. Lowekamp, D. R. O'Hallaron, and Thomas Gross, "Topology discovery for large Ethernet networks," in SIGCOMM, 2001.
8. D. S. Alexander, M. Shaw, S. Nettles, and J. M. Smith, "Active Bridging," in SIGCOMM, 1997, pp. 101-111. (Pubitemid 127568354)
9. M. Allman and V. Paxson, "On Estimating End-to-End Network Path Properties," in SIGCOMM, 1999, pp. 263-274. (Pubitemid 32081871)
10. E. Cohen, B. Krishnamurthy, and J. Rexford, "Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters," in SIGCOMM, 1998, pp. 241-253. (Pubitemid 128566462)
11. A. Veres, Z. Kenesi, S. Molnár, and G. Vattay, "The Propagation of Long-Range Dependence in the Internet," in SIGCOMM, 2000.
12. K. Lai and M. Baker, "Measuring link bandwidths using a deterministic model of packet delay," in SIGCOMM, 2000, pp. 283-294.
13. A. B. Downey, "Using Pathchar to Estimate Internet Link Characteristics," in SIGCOMM, 1999, pp. 222-223.
14. A. Medina, I. Matta, and J. Byers, "On the Origin of Power Laws in Internet Topologies," ACM Computer Communication Review, vol. 30, no. 2, 18-28 2000.
15. V. N. Padmanabhan and L. Qui, "The content and access dynamics of a busy web site: findings and implications," in SIGCOMM, 2000, pp. 111-123.
16. B. Krishnamurthy and J. Wang, "On network-aware clustering of web clients," in SIGCOMM, 2000, pp. 97-110.
17. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital Fountain Approach to Reliable Distribution of Bulk Data," in SIGCOMM, 1998, pp. 56-67. (Pubitemid 128566447)
18. S. Cheshire and M. Baker, "Internet Mobility 4×4," in SIGCOMM, 1996.
19. S. B. Fredj, T. Bonald, A. Proutiere, G. Régnié, and J.W. Roberts, "Statistical bandwidth sharing: a study of congestion at flow level," in SIGCOMM, 2001.
20. L. Breslau and S. Shenker, "Best-Effort versus Reservations: A Simple Comparative Analysis," in SIGCOMM, 1998, pp. 3-16.
21. E. Amir, S. McCanne, and R. H. Katz, "An Active Service Framework and Its Application to Real-Time Multimedia Transcoding," in SIGCOMM, 1998, pp. 178-189. (Pubitemid 128566457)
22. A. Oram, Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O'Reilly, 2001.
23. A. Khrabrov, S. Sobti, and P. N. Yianilos, "Synchronizable Databases for the Web," Tech. Rep., NEC Research Institute, 4 Independence Way, Princeton, NJ, December 2000.
24. Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos, "A Prototype Implementation of Archival Intermemory," in Proceedings of the fourth ACM Conference on Digital libraries (DL '99), 1999.
25. A. V. Goldberg and P. N. Yianilos, "Towards an Archival Intermemory," in Proc. IEEE International Forum on Research and Technology Advances in Digital Libraries (ADL'98). April 1998, pp. 147-156, IEEE Computer Society.
26. A. Reddy, R. Govindan, and D. Estrin, "Fault isolation in multicast trees," in SIGCOMM, 2000, pp. 29-40.
27. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, "Breakdown of the Internet under intentional attack," Physical Review Letters, vol. 86, 2001, arXiv:cond-mat/0010251.
28. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, "Resilience of the Internet to random breakdowns," Physical Review Letters, vol. 85, 2000, arXiv:cond-mat/0007048.
29. S. Dorogovtsev, J. Mendes, and A. Samukhin, "Structure of growing networks with preferential linking," Physical Review Letters, vol. 85, no. 21, 2000.
30. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, "Giant strongly connected component of directed networks," arXiv:cond-mat/0103629, 2001, Phys. Rev. E 64, 025101 (R) (2001).
31. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, "Network Robustness and Fragility: Percolation on Random Graphs," Physical Review Letters, vol. 85, no. 25, pp. 5468-5471, December 2000. (Pubitemid 32089658)
32. M. E. J. Newman, C. Moore, and D. J. Watts, "Mean-Field Solution of the Small-World Network Model," Physical Review Letters, vol. 84, no. 14, pp. 3201-3204, April 2000.
33. C. Labovitz, A. Ahuja, R. Wattenhofer, and V. Srinivasan, "The Impact of Internet Policy and Topology on Delayed Routing convergence," in INFOCOM, 2001, pp. 537-546. (Pubitemid 32474269)
34. C. R. Palmer and J. G. Steffan, "Generating network topologies that obey power laws," in Proceedings of GLOBECOM '2000, November 2000.
35. B. M. Waxman, "Routing of Multipoint Connections," IEEE Journal of Selected Areas in Communication, vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
36. K. L. Calvert, M. B. Doar, and E. W. Zegura, "Modeling internet topology," IEEE Communications Magazine, vol. 35, no. 6, pp. 160-163, June 1997. (Pubitemid 127648441)
37. M. Doar, "A Better Model for Generating Test Networks," in Globecom, 1996.
38. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "etwork topology generators: Degree-based vs. structural," in SIGCOMM, 2002.
39. C. Jin, Q. Chen, and S. Jamin, "Inet: Internet Topology Generator," 2000.
40. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs," in Proceedings of the 32rd Annual ACM Symposium on Theroy of Computing, 2000, pp. 171-180.
41. R. Albert and A. Barabási, "Topology of evolving networks: local events and universality," Tech. Rep., LANL ArXiv, 2000.
42. T. Bu and D. Towsley, "On Distinguishing between Internet Power Law Topology Generators," in Proceedings of INFOCOM, 2002.
43. R. Pastor-Satorras, A. Vazquez, and A. Vespignani, "Dynamical and correlation properties of the Internet," Physics Review Letter, vol. 87, 2001.
44. D. M. Pennock, G. W. Flake, S. Lawrence, E. J. Glover, and C. L. Giles, "Winners don't take all: Characterizing the competition for links on the web.," Proceedings of the National Academy of Sciences (PNAS), vol. 99, no. 8, pp. 5207-5211, 2002. (Pubitemid 34411526)
45. K. Mehlhorn and S. Näher, LEDA: A Platform for combinatorial and geometric computing, Cambridge University Press, 1999.
46. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph Structure in the Web," in Proceedings of WWW9 Conference, 2000.
47. Oregon RouteViews, "http://moat.nlanr.net/routing/rawdata/," 2002.
48. M. Crovella, "Personal communication," 2002.
49. Topology Project, "http://topology.eecs.umich.edu/data.html," 2002.