Robustness of the internet at the topology and routing level

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4028 LNCS, Issue , 2006, Pages 260-274

  Erlebach, Thomas ^a   Hall, Alexander ^b   Moonen, Linda ^c   Panconesi, Alessandro ^d   Spieksma, Frits ^c   Vukadinoviè, Danica ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF LEUVEN   (Belgium)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; NETWORK ROUTING; PROBLEM SOLVING;

AUTONOMOUS SYSTEMS (AS); DISJOINT PATHS; VALLEY-FREE PATHS;

INTERNET;

EID: 38549118361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11808107_12     Document Type: Conference Paper

References (30)

1. S. Agarwal, L. Subramanian, J. Rexford, and R.H. Katz. Characterizing the Internet hierarchy from multiple vantage points, project web-page, 2002-2003. http://www.cs.berkeley.edu/~sagarwal/research/BGP-hierarchy/.
2. A. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, N.J., 1993.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin, 1999.
4. P. Baake and T. Wichmann. On the economics of Internet peering. Netnomics, 1(1), 1999.
5. C Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance. Branchand-price: Column generation for solving huge integer programs. Operations Research, 46(3):316-329, 1998.
6. C. L. Barrett, R. Jacob, and M. Marathe. Formal language constrained path problems. SIAM J. Comput, 30(3):809-837, 2000.
7. G. Di Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between Autonomous Systems, project web-page. http://www.dia.uniroma3.it/~compunet/relationships/.
8. G. Di Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between autonomous systems. In Proceedings of INFOCOM'03, 2003.
9. T. Erlebach, A. Hall, and T. Schank. Classifying customer-provider relationships in the Internet. In Proceedings of the IASTED International Conference on Communications and Computer Networks, pages 538-545, 2002.
10. T. Erlebach, A. Hall, A. Panconesi, and D. Vukadinovié. Cuts and disjoint paths in the valley-free path model. TIK-Report 180, Computer Engineering and Networks Laboratory (TIK), ETH Zürich, 2003. Available electronically at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report180.pdf.
11. T. Erlebach, A. Hall, A. Panconesi, and D. Vukadinović. Cuts and disjoint paths in the valley-free path model of Internet BGP routing. In Proceedings of the First Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'04), LNCS 3405, pages 49-62, Springer-Verlag, 2005.
12. T. Erlebach, L.S. Moonen, F.CR. Spieksma, and D. Vukadinović. Connectivity measures for Internet topologies. DTEW Research Report 0550, Katholieke Universiteit Leuven, Leuven, Belgium, 2005.
13. D.R. Figueiredo, Z. Ge, and S. Jaiswal. Logical relationship inference program (implementation of algorithms from [14]). http://www-net.cs.umass. edu/~ratton/AS/.
14. L. Gao. On inferring Autonomous System relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6):733-745, 2001.
15. L. Gao and F. Wang. The extent of AS path inflation by routing policies. In Proceedings of IEEE Global Internet Symposium 2002, 2002.
16. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer-Berlin, 1988.
17. G. Huston. Interconnection, peering and settlements - Part I. Internet Protocol Journal, 2(1):2-16, March 1999.
18. G. Huston. Interconnection, peering and settlements - Part II. Internet Protocol Journal, 2(2):2-23, June 1999.
19. ILOG CPLEX Optimizer, version 9.0. http://www.ilog.com/products/cplex/.
20. C Labovitz, A. Ahuja, R. Wattenhofer, and S. Venkatachary. The impact of Internet policy and topology on delayed routing convergence. In Proceedings of INFOCOM'01, 2001.
21. Library of efficient data types and algorithms (LEDA). http://www.algorithmicsolutions.com/enleda.htm.
22. M. Rimondini, M. Pizzonia, G. Di Battista, and M. Patrignani. Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation. In Proceedings of IPS 2004, International Workshop on Inter-domain Performance and Simulation, 2004.
23. Route Views project web-site, University of Oregon, http://www. routeviews.org.
24. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Interenet hierarchy from multiple vantage points. In Proceedings of INFOCOM'02, 2002.
25. H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet path inflation due to policy routing. In Proceedings of SPIE ITCom'01, 2001.
26. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In Proceedings of INFOCOM'01, 2001.
27. R. Teixeira, K. Marzullo, S. Savage, and G. Voelker. Characterizing and measuring path diversity of Internet topologies. In Proceedings of ACM SIGMETRICS 2003, 2003.
28. F. Vanderbeck and L.A. Wolsey. An exact algorithm for IP column generation. Operations Research Letters, 19:151-159, 1996.
29. E. Wanke and R. Kötier. Oriented paths in mixed graphs. In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC04), LNCS 3341, pages 629-643, Springer-Verlag, 2004.
30. J. Xia and L. Gao. On the Evaluation of AS Relationship Inferences. In Proceedings of IEEE Global Communications Conference (GLOBECOM 2004), 2004.