Abstract
In the valley-free path model, a path in a given directed graph is valid if it consists of a sequence of forward edges followed by a sequence of backward edges. This model is motivated by BGP routing policies of autonomous systems in the Internet. Robustness considerations lead to the problem of computing a maximum number of disjoint paths between two nodes, and the minimum size of a cut that separates them. We study these problems in the valley-free path model. For the problem of computing a maximum number of edge- or vertex-disjoint valid paths between two given vertices s and t, we give a 2-approximation algorithm and show that no better approximation ratio is possible unless P = NP. For the problem of computing a minimum vertex cut that separates s and t with respect to all valid paths, we give a 2-approximation algorithm and prove that the problem is APX-hard. The corresponding problem for edge cuts is shown to be polynomial-time solvable. We present additional results for acyclic graphs.
Research partially supported by the European Commission in the 5th Framework Programme under contract IST-2001-32007 (APPOL II) and in the 6th Framework Programme under contract 001907 (DELIS), with funding for the Swiss participants provided by the Swiss Federal Office for Education and Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, A., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)
Baake, P., Wichmann, T.: On the economics of Internet peering. Netnomics 1(1) (1999)
Barrett, C.L., Jacob, R., Marathe, M.: Formal language constrained path problems. SIAM J. Comput. 30(3), 809–837 (2000)
Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiway cuts. SIAM J. Comput. 4(23), 864–894 (1994)
Di Battista, G., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between autonomous systems. In: Proceedings of INFOCOM 2003 (2003)
Erlebach, T., Hall, A., Panconesi, A., Vukadinović, D.: 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
Erlebach, T., Hall, A., Schank, T.: Classifying customer-provider relationships in the Internet. In: Proceedings of the IASTED International Conference on Communications and Computer Networks, pp. 538–545 (2002)
Fortune, S., Hopcroft, J., Willie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10(2), 111–121 (1980)
Gao, L.: On inferring Autonomous System relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)
Garg, N., Vazirani, V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487–498. Springer, Heidelberg (1994)
Huston, G.: Interconnection, peering and settlements—Part I. Internet Protocol Journal (March 1999)
Huston, G.: Interconnection, peering and settlements—Part II. Internet Protocol Journal (June 1999)
Labovitz, C., Ahuja, A., Wattenhofer, R., Venkatachary, S.: The impact of Internet policy and topology on delayed routing convergence. In: Proceedings of INFOCOM 2001 (2001)
Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Interenet hierarchy from multiple vantage points. In: Proceedings of INFOCOM 2002 (2002)
Tangmunarunkit, H., Govindan, R., Shenker, S.: Internet path inflation due to policy routing. In: Proceedings of SPIE ITCom 2001 (2001)
Tangmunarunkit, H., Govindan, R., Shenker, S., Estrin, D.: The impact of routing policy on Internet paths. In: Proceedings of INFOCOM 2001 (2001)
Wanke, E.: The complexity of finding oriented paths in mixed graphs. Technical report, Institut für Informatik, Heinrich-Heine-Universität, Düsseldorf (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Hall, A., Panconesi, A., Vukadinović, D. (2005). Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_6
Download citation
DOI: https://doi.org/10.1007/11527954_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)