Centrality-based Middlepoint Selection for Traffic Engineering with Segment Routing

Segment routing is an emerging technology to simplify traffic engineering implementation in WANs. It expresses an end-to-end logical path as a sequence of segments through a set of middlepoints. Traffic along each segment is routed along shortest paths. In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs. We consider two common types of TE, and show that the TE problem can be solved in weakly polynomial time when the number of middlepoints is fixed and not part of the input. However, the corresponding linear program is of large scale and computationally expensive. For this reason, existing methods that work by taking each node as a candidate middlepoint are inefficient. Motivated by this, we propose to select just a few important nodes as middlepoints for all traffic. We use node centrality concepts from graph theory, notably group shortest path centrality, for middlepoint selection. Our performance evaluation using realistic topologies and traffic traces shows that a small percentage of the most central nodes can achieve good results with orders of magnitude lower runtime.

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[2]  Mung Chiang,et al.  Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing , 2007, IEEE Journal on Selected Areas in Communications.

[3]  Carlos M. Pignataro,et al.  The Segment Routing Architecture , 2014, GLOBECOM 2014.

[4]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[5]  J. Rexford,et al.  Scalable Multi-Class Traffic Management in Data Center Backbone Networks , 2013, IEEE Journal on Selected Areas in Communications.

[6]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[7]  Rami Puzis,et al.  Collaborative attack on Internet users' anonymity , 2009, Internet Res..

[8]  Rami Puzis,et al.  Incremental deployment of network monitors based on Group Betweenness Centrality , 2009, Inf. Process. Lett..

[9]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Wim Henderickx,et al.  Segment Routing Use Cases , 2013 .

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[12]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[14]  T. V. Lakshman,et al.  Optimized network traffic engineering using segment routing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[15]  Stephen P. Boyd,et al.  ECOS: An SOCP solver for embedded systems , 2013, 2013 European Control Conference (ECC).

[16]  Joseph Naor,et al.  On the effect of forwarding table size on SDN network utilization , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[17]  Clarence Filsfils,et al.  Segment Routing with the MPLS Data Plane , 2019, RFC.

[18]  Matthew Roughan,et al.  Simplifying the synthesis of internet traffic matrices , 2005, CCRV.

[19]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[20]  Yin Zhang,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM 2006.

[21]  Tamás Lukovszki,et al.  It's a Match!: Near-Optimal and Incremental Middlebox Deployment , 2016, CCRV.

[22]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[23]  Yves Deville,et al.  SCMon: Leveraging segment routing to improve network monitoring , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[24]  Tamás Lukovszki,et al.  Online Admission Control and Embedding of Service Chains , 2015, SIROCCO.

[25]  Maciej Kuźniar,et al.  What You Need to Know About SDN Flow Tables , 2015, PAM.

[26]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[27]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[28]  Srikanth Kandula,et al.  Traffic engineering with forward fault correction , 2015, SIGCOMM 2015.

[29]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[30]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.

[31]  Olivier Bonaventure,et al.  Solving Segment Routing Problems with Hybrid Constraint Programming Techniques , 2015, CP.

[32]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[33]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

[34]  Anja Feldmann,et al.  Panopticon: Reaping the Benefits of Incremental SDN Deployment in Enterprise Networks , 2014, USENIX Annual Technical Conference.

[35]  Piero Castoldi,et al.  Path Encoding in Segment Routing , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[36]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[37]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.