Using local search for traffic engineering in switched Ethernet networks

Large switched Ethernet networks are deployed in campus networks, data centers and metropolitan area networks to support various types of services. Congestion is usually handled by deploying more switches and installing higher bandwidth link bundles, although a better use of the existing infrastructure would allow to deal with congestion at lower cost. In this paper, we use constrained-based local search and the COMET language to develop an efficient traffic engineering technique that improves the use of the infrastructure by the spanning tree protocol. We evaluate the performance of our scheme by considering several types of network topologies and traffic matrices. We also compare the performance of our technique with the performance that a routing-based deployment supported by an IP traffic engineering technique would obtain.

[1]  Pascal Van Hentenryck,et al.  LS(graph & tree): a local search framework for constraint optimization on graphs and trees , 2009, SAC '09.

[2]  Albert G. Greenberg,et al.  The nature of data center traffic: measurements & analysis , 2009, IMC '09.

[3]  Xiaoming He,et al.  Traffic Engineering for Metro Ethernet Based on Multiple Spanning Trees , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[4]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[5]  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).

[6]  Konstantina Papagiannaki,et al.  Design, Measurement and Management of Large-Scale IP Networks - Bridging the Gap between Theory and Practice , 2008 .

[7]  Lieguang Zeng,et al.  Design of Multiple Spanning Trees for Traffic Engineering in Metro Ethernet , 2006, 2006 International Conference on Communication Technology.

[8]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[9]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[10]  Ian P. Gent,et al.  Symmetry Breaking in Constraint Programming , 2000, ECAI.

[11]  Yves Deville,et al.  Implementation of a traffic engineering technique that preserves IP Fast Reroute inCOMET , 2009 .

[12]  Radia J. Perlman,et al.  Rbridges: transparent routing , 2004, IEEE INFOCOM 2004.

[13]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  G. Chiruvolu,et al.  Metro Ethernet traffic engineering based on optimal multiple spanning trees , 2005, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005..

[15]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .

[16]  Radia Perlman,et al.  Rbridges: Base Protocol Specification , 2006 .

[17]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[18]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[19]  Ieee Standards Board.  Information technology : telecommunications and information exchange between systems : local area networks : Media access control (MAC) bridges , 1993 .

[20]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[21]  Michal Pióro,et al.  Traffic Engineering of Multiple Spanning Tree Routing Networks: the Load Balancing Case , 2009, 2009 Next Generation Internet Networks.