Semi-Oblivious Segment Routing with Bounded Traffic Fluctuations

Segment Routing (SR) is a recently proposed protocol by IETF to realize scalability and flexibility properties for internet traffic engineering. This protocol is an integration of source routing and tunneling paradigms. The paths are defined in terms of segments and each segment is specified by a label. In this paper we consider the problem of offline segment routing when traffic matrix is not fully known. Because of wide variation in traffic matrix over time, it is difficult to estimate traffic matrix accurately. So, we have developed a semi-oblivious segment routing algorithm that takes bounded traffic fluctuations based on an initial estimated traffic matrix. This makes it robust to traffic fluctuations and yet substantially improves the routing performance compared to oblivious routing techniques.

[1]  Ming Zhang,et al.  MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.

[2]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[3]  Piero Castoldi,et al.  Efficient label encoding in segment-routing enabled optical networks , 2015, 2015 International Conference on Optical Network Design and Modeling (ONDM).

[4]  E. Oki,et al.  Performance comparisons of optimal routing by pipe, hose, and intermediate models , 2009, 2009 IEEE Sarnoff Symposium.

[5]  Jang-Ping Sheu,et al.  An efficient routing algorithm based on segment routing in software-defined networking , 2016, Comput. Networks.

[6]  Ian F. Akyildiz,et al.  A roadmap for traffic engineering in SDN-OpenFlow networks , 2014, Comput. Networks.

[7]  Eiji Oki,et al.  Optimal Routing Strategy by Hose Model with Link-Traffic Bounds , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

[9]  Clarence Filsfils,et al.  Segment Routing Architecture , 2018, RFC.

[10]  Marija AntiAleksandra.  Oblivious Routing Scheme Using Load Balancing Over Shortest Paths , 2008 .

[11]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[12]  Hari Balakrishnan,et al.  Traffic-aware techniques to reduce 3G/LTE wireless energy consumption , 2012, CoNEXT '12.

[13]  Edith Cohen,et al.  Making routing robust to changing traffic demands: algorithms and evaluation , 2006, TNET.

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

[15]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[16]  Filippo Cugini,et al.  Traffic engineering in segment routing networks , 2017, Comput. Networks.

[17]  Murali S. Kodialam,et al.  Oblivious routing of highly variable traffic in service overlays and IP backbones , 2009, IEEE/ACM Trans. Netw..

[18]  Murali S. Kodialam,et al.  Traffic-Oblivious Routing in the Hose Model , 2011, IEEE/ACM Transactions on Networking.

[19]  Clarence Filsfils,et al.  The Segment Routing Architecture , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[20]  Hong Xu,et al.  On Traffic Engineering with Segment Routing in SDN based WANs , 2017, ArXiv.

[21]  István Szabó,et al.  On bandwidth efficiency of the hose resource management model in virtual private networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).