Internet resiliency to attacks and failures under BGP policy routing

Computer Networks

Volumn 50, Issue 16, 2006, Pages 3183-3196

  Dolev, Danny ^a   Jamin, Sugih ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Ossi)   (Israel)

Author keywords

AS relationships; Directed graph; Valley free routing

Indexed keywords

AUTONOMOUS AGENTS; COMPUTER CRIME; CONSTRAINT THEORY; FAILURE ANALYSIS; GRAPH THEORY; REAL TIME SYSTEMS; ROUTERS;

AUTONOMOUS SYSTEM (AS); DIRECTED GRAPH; REAL CONSTRAINT ANALYSIS; ROUTING; TOPOLOGY GRAPH;

INTERNET;

EID: 33747890476     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.11.010     Document Type: Article

References (34)

1. C. Labovitz, G.R.Melan, F. Jahanian, Internet routing instability, in: ACM SIGCOMM 1997, 1997.
2. T. Griffin, G.T. Wilfong, An analysis of BGP convergence properties, in: ACM SIGCOMM 1999, 1999, pp. 277-288.
3. Albert R., Jeong H., and Barabási A.-L. Attack and error tolerance of complex networks. Nature 406 (2000) 378
4. Cohen R., Erez K., ben Avraham D., and Havlin S. Breakdown of the internet under intentional attack. Physical Review Letters 86 (2001) 3682
5. Cohen R., Erez K., ben Avraham D., and Havlin S. Resilience of the internet to random breakdowns. Physical Review Letters 4626 (2000) 85-89
6. "WorldCom's IP Outages: Whodunnit?" April 25th, 2002; "WorldCom Outage Only the Start" October 14, 2002 ; "The Internet Has Broken" January 25, 2003. Available from: .
7. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in: ACM SIGCOMM 1999, Boston, MA, USA, 1999.
8. R. Govindan, H. Tangmunarunki, Heuristics for internet map discovery, in: IEEE Infocom 2000, Tel-Aviv, Israel, 2000, pp. 1371-1380.
9. Medina A., Matta I., and Byers J. On the origin of power laws in internet topologies. ACM Computer Communications Review 30 2 (2000) 18-28
10. W. Cheswick, J. Nonnenmacher, C. Sahinalp, R. Sinha, K. Varadhan, Modeling internet topology, Tech. Rep. Technical Memorandum 113410-991116-18TM, Lucent Technologies, 1999.
11. T. Bu, D. Towsley, On distinguishing between internet power law topology generators, in: IEEE Infocom 2002, New York, NY, USA, 2002.
12. S. Park, A. Khrabrov, D. Pennock, S. Lawrence, C.L. Giles, L.H. Ungar, Static and dynamic analysis of the internet's susceptibility to faults and attacks, in: IEEE Infocom 2003, San-Francisco, CA, USA, 2003.
13. Stewart III J.W. BGP4 Inter-Domain Routing in the Internet. first ed. vol. 1 (1999), Addison-Wesley
14. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, The origin of power-laws in internet topologies revisited, in: IEEE Infocom 2002, New York, NY, USA, 2002.
15. University of oregon route views project. Available from: .
16. Routing information service. Available from: .
17. L. Gao, On inferring autonomous system relationships in the internet, in: IEEE Global Internet, 2000.
18. L. Subramanian, S. Agarwal, J. Rexford, R. Katz, Characterizing the internet hierarchy from multiple vantage points, in: IEEE Infocom 2002, New York, NY, USA, 2002.
19. G. Battista, M. Patrignani, M. Pizzonia, Computing the types of relationships between autonomous systems, in: IEEE Infocom 2003, San-Francisco, CA, USA, 2003.
20. Burch H., and Cheswick B. Mapping the internet. IEEE Computer 32 4 (1999) 97-98
21. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
22. Albert R., and Barabási A.-L. Topology of evolving networks: local events and universality. Physical Review Letters 85 24 (2000) 5234-5237
23. C. Jin, Q. chen, S. Jamin, Inet: Internet topology generator, in: Technical Report CSE-TR-433-00, University of Michigan, EECS Department. Available from: , 2000.
24. Medina A., Lakhina A., Matta I., and Byers J. Brite: an approach to universal topology generation. In Proceedings of MASCOTS 2001 (2001), IEEE Computer Society
25. D. Dolev, O. Mokryn, Y. Shavitt, On multicast trees: structure and size estimation, in: IEEE Infocom 2003, San-Francisco, CA, USA, 2003.
26. P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, D. Estrin, On characterizing network topologies and analyzing their impact on protocol design, Technical Report 00-731, Department of CS, University of Southern California, 2000.
27. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree based vs. structural, in: Proc. of ACM SIGCOMM 2002, Pittsburg, PA, USA, 2002.
28. M. Mihail, A. Saberi, E. Zegura, Graph theoretic enhancements of internet topology generators, in: DIMACS Workshop on Internet and WWW Measurement, Mapping and Modeling, Piscataway, NJ, USA, 2002.
29. K. Kamath, H. Bassali, R. Hosamani, L.Gao, Policy-aware algorithms for proxy placement in the internet, in: ITCOM 2001, Denver, CO, USA, 2001.
30. Hyun Y., Broido A., and Claffy K. Traceroute and bgp as path incongruities. Cooperative Association for Internet Data Analysis-CAIDA (2003), San Diego Supercomputer Center, University of California, San Diego, USA
31. Karp R.M. Reducibility among combinatorial problems. In: Miller R., and Thatcher J. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
32. Boppana R., and Halldórsson M.M. Approximating maximum independent sets by excluding subgraphs. BIT 32 (1992) 180-196
33. G. Huston, The changing structure of the internet, in: APECTEL23, 2001.
34. Shavitt E., and Shir Y. Dimes: let the internet measure itself. ACM Computer Communication Review 35 4 (2005)