Scalable segment routing-a new paradigm for efficient service provider networking using carrier ethernet advances

Segment routing has recently been proposed in the IETF toward making IP/MPLS networks service oriented while simplifying network operations. Segment routing computes paths at the source node using node identifiers and adjacency identifiers conjoined together to create a source-routed path. We propose a scalable transport paradigm as an enabler toward implementing segment routing in provider networks. We propose omnipresent Ethernet, our modification of carrier Ethernet (which is based on source-routed, binary-routed labels embedded in an Ethernet frame), to implement segment routing. We identify some of the scalability issues of the segment routing proposal in the context of source-routing overhead. To absolve scalability issues of segment routing, two routing schemes that implement multidomain source-routing techniques are proposed. The hierarchical segment-routing (H-SR) scheme is proposed, which deploys a limited number of special nodes called swap nodes that are capable of label swapping to implement routing. The swap-node placement problem is formulated as an integer linear program to minimize the total routing distance within a network. Three heuristic techniques for swap-node selection based on centrality paradigms are presented. The H-SR scheme is further improved by a proposed multisegment-routing (M-SR) scheme that assumes all nodes in the network to be capable of label swapping. The H-SR and M-SR schemes are shown to significantly enhance the scalability of segment routing. A test-bed is built using carrier Ethernet hardware to support segment routing that validates the implementation of the proposed schemes. A simulation model to evaluate the schemes from a scalability perspective and their associated trade-offs is presented.

[1]  Mihaela Enachescu,et al.  Reducing Maximum Stretch in Compact Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[2]  Wei Chen,et al.  Compact Routing in Power-Law Graphs , 2009, DISC.

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

[4]  Ashwin Gumaste,et al.  Evolution of packet-optical integration in backbone and metropolitan high-speed networks: a standards perspective , 2013, IEEE Communications Magazine.

[5]  Lenore Cowen,et al.  Compact routing with minimum stretch , 1999, SODA '99.

[6]  A. Gumaste,et al.  Omnipresent Ethernet—Technology Choices for Future End-to-End Networking , 2010, Journal of Lightwave Technology.

[7]  Ashwin Gumaste,et al.  On the Backbone VLAN Identifier (BVID) Allocation in 802.1Qay Provider Backbone Bridged — Traffic Engineered Networks , 2014, IEEE Transactions on Network and Service Management.

[8]  Shiri Chechik,et al.  Compact Routing Schemes , 2016, Encyclopedia of Algorithms.

[9]  Stewart Bryant,et al.  A Framework for MPLS in Transport Networks , 2010, RFC.

[10]  Luyuan Fang,et al.  The evolution of carrier ethernet services-requirements and deployment case studies [next-generation carrier ethernet] , 2008, IEEE Communications Magazine.

[11]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[12]  Brighten Godfrey,et al.  Pathlet routing , 2009, SIGCOMM '09.

[13]  Ashwin Gumaste,et al.  On the Design, Implementation, Analysis, and Prototyping of a 1- μs, Energy-Efficient, Carrier-Class Optical-Ethernet Switch Router , 2014, Journal of Lightwave Technology.

[14]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

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

[16]  Hans Kellerer,et al.  The Subset Sum Problem , 2004 .

[17]  Ashwin Gumaste.  Design of a sub-microsecond carrier class router: The omnipresent ethernet approach , 2011, 2011 13th International Conference on Transparent Optical Networks.

[18]  Colin Perkins,et al.  Compact routing on the Internet AS-graph , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[19]  Ashwin Gumaste,et al.  DWDM Network Designs and Engineering Solutions , 2002 .

[20]  Ashwin Gumaste,et al.  A scalable framework for segment routing in service provider networks: The Omnipresent Ethernet approach , 2014, 2014 IEEE 15th International Conference on High Performance Switching and Routing (HPSR).

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

[22]  Mingdong Tang,et al.  Space-stretch tradeoff optimization for routing in Internet-like graphs , 2012, Journal of Communications and Networks.

[23]  Ankit Singla,et al.  Scalable routing on flat names , 2010, CoNEXT.

[24]  Laxmi N. Bhuyan,et al.  EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup , 2005, IEEE Transactions on Computers.