Policy-compliant path diversity and bisection bandwidth

How many links can be cut before a network is bisected? What is the maximal bandwidth that can be pushed between two nodes of a network? These questions are closely related to network resilience, path choice for multipath routing or bisection bandwidth estimations in data centers. The answer is quantified using metrics such as the number of edge-disjoint paths between two network nodes and the cumulative bandwidth that can flow over these paths. In practice though, such calculations are far from simple due to the restrictive effect of network policies on path selection. Policies are set by network administrators to conform to service level agreements, protect valuable resources or optimize network performance. In this work, we introduce a general methodology for estimating lower and upper bounds for the policy-compliant path diversity and bisection bandwidth between two nodes of a network, effectively quantifying the effect of policies on these metrics. Exact values can be obtained if certain conditions hold. The approach is based on regular languages and can be applied in a variety of use cases.

[1]  James P. G. Sterbenz,et al.  Path geo-diversification: Design and analysis , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[2]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[3]  Pai.  There is more to it. , 1995, Current opinion in structural biology.

[4]  Anne Brüggemann-Klein,et al.  Regular Expressions into Finite Automata , 1992, Theor. Comput. Sci..

[5]  Virgil D. Gligor,et al.  The Crossfire Attack , 2013, 2013 IEEE Symposium on Security and Privacy.

[6]  René Peeters,et al.  The maximum edge biclique problem is NP-complete , 2003, Discret. Appl. Math..

[7]  Thomas Erlebach,et al.  Cuts and Disjoint Paths in the Valley-Free Path Model , 2004, Internet Math..

[8]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[9]  Kimberly C. Claffy,et al.  Using peeringDB to understand the peering ecosystem , 2014, CCRV.

[10]  Frank Harary,et al.  Graph Theory and Geography: An Interactive View (Ebook) , 2002 .

[11]  Enver Kayaaslan.  On Enumerating All Maximal Bicliques of Bipartite Graphs , 2010, CTW.

[12]  Bin Liu,et al.  Evaluating Potential Routing Diversity for Internet Failure Recovery , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Frits C. R. Spieksma,et al.  Connectivity Measures for Internet Topologies on the Level of Autonomous Systems , 2009, Oper. Res..

[14]  Anja Feldmann,et al.  There is more to IXPs than meets the eye , 2013, CCRV.

[15]  Anja Feldmann,et al.  Anatomy of a large european IXP , 2012, SIGCOMM '12.

[16]  João L. Sobrinho,et al.  A Theory for the Connectivity Discovered by Routing Protocols , 2012, IEEE/ACM Transactions on Networking.

[17]  Lixin Gao,et al.  Stable Internet routing without global coordination , 2000, SIGMETRICS '00.

[18]  2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015 , 2015, IEEE Conference on Computer Communications.

[19]  Henning Fernau,et al.  Exact exponential-time algorithms for finding bicliques , 2010, Inf. Process. Lett..

[20]  Stefan Schmid,et al.  Control Exchange Points: Providing QoS-enabled End-to-End Services via SDN-based Inter-domain Routing Orchestration , 2014, ONS.

[21]  Emin Gün Sirer,et al.  Managing the network with Merlin , 2013, HotNets.

[22]  James P. G. Sterbenz,et al.  Multilevel resilience analysis of transportation and communication networks , 2015, Telecommun. Syst..

[23]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM.

[24]  Mark Handley,et al.  TCP Extensions for Multipath Operation with Multiple Addresses , 2020, RFC.

[25]  Jennifer Rexford,et al.  BGP routing policies in ISP networks , 2005, IEEE Network.

[26]  Renata Teixeira,et al.  General Terms Measurement , 2022 .