Cuts and disjoint paths in the valley-free path model of Internet BGP routing

Lecture Notes in Computer Science

Volumn 3405, Issue , 2005, Pages 49-62

  Erlebach, Thomas ^a   Hall, Alexander ^b   Panconesi, Alessandro ^c   Vukadinović, Danica ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b ETH ZURICH   (Switzerland)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; POLYNOMIALS;

APPROXIMATION RATIO; AUTONOMOUS SYSTEMS; BGP ROUTING POLICIES; VALLEY-FREE PATH MODEL;

INTERNET;

EID: 24344502333     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527954_6     Document Type: Conference Paper

References (18)

1. A. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, N.J., 1993.
2. 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.
3. P. Baake and T. Wichmann. On the economics of Internet peering. Netnomics, 1(1), 1999.
4. C. L. Barrett, R. Jacob, and M. Marathe. Formal language constrained path problems. SIAM J. Comput., 30(3):809-837, 2000.
5. E. Dahlhaus, D. Johnson, C. Papadimitriou, P. Seymour, and M. Yannakakis. The complexity of multiway cuts. SIAM J. Comput., 4(23):864-894, 1994.
6. G. Di Battista, M. Patrignani, and M. Pizzonia. Computing the types of the relationships between autonomous systems. In Proceedings of INFOCOM'03, 2003.
7. 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.
8. 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.
9. S. Fortune, J. Hopcroft, and J. Willie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111-121, 1980.
10. L. Gao. On inferring Autonomous System relationships in the Internet. IEEE/ACM Transactions on Networking, 9(6):733-745, 2001.
11. N. Garg, V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proceedings of ICALP'94, LNCS 820, pages 487-498, 1994.
12. G. Huston. Interconnection, peering and settlements - Part I. Internet Protocol Journal, March 1999.
13. G. Huston. Interconnection, peering and settlements - Part II. Internet Protocol Journal, June 1999.
14. 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.
15. L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Interenet hierarchy from multiple vantage points. In Proceedings of INFOCOM'03, 2002.
16. H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet path inflation due to policy routing. In Proceedings of SPIE ITCom'01, 2001.
17. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In Proceedings of INFOCOM'01, 2001.
18. E. Wanke. The complexity of finding oriented paths in mixed graphs. Technical report, Institut für Informatik, Heinrich-Heine-Universität, Düsseldorf, 2003.