Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing

This paper focuses on traffic engineering of telecommunication networks, which arises in the context of switched Ethernet networks. It addresses the minimization of the maximum network link load. With the IEEE 802.1s Multiple Spanning Tree Protocol, it is possible to define multiple routing spanning trees to provide multiple alternatives to route VLAN traffic demands. Two compact mixed integer linear programming models defining the optimization problem and several models based on the Dantzig-Wolfe decomposition principle, which are solved by branch-and-price, are proposed and compared. The different decompositions result from defining as subproblems either the supporting spanning trees and/or the demand routing paths, which can be solved by well known efficient algorithms.

[1]  Filipe Pereira e Alvelos,et al.  Branch-and-price and multicommodity flows , 2005 .

[2]  Mario Gerla,et al.  QoS-aware multiple spanning tree mechanism over a bridged LAN environment , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[3]  Masahiro Kuroda,et al.  SSTP: an 802.1s extension to support scalable spanning tree for mobile metropolitan area network , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[4]  Atsushi Iwata,et al.  Design of multiple reverse spanning trees in next generation of Ethernet-VPNs , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[5]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[6]  Tzi-cker Chiueh,et al.  Viking: a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks , 2004, IEEE INFOCOM 2004.

[7]  Amaro de Sousa,et al.  Improving Load Balance of Ethernet Carrier Networks Using IEEE 802.1S MSTP with Multiple Regions , 2006, Networking.

[8]  Maher Ali,et al.  Traffic engineering in metro Ethernet , 2005, IEEE Network.

[9]  Suku Nair,et al.  Traffic engineering in enterprise ethernet with multiple spanning tree regions , 2005, 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05).

[10]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[11]  Amaro F. de Sousa.  Improving Load Balance and Resilience of Ethernet Carrier Networks with IEEE 802.1S Multiple Spanning Tree Protocol , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[12]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[13]  Tibor Cinkler,et al.  Scalable Tree Optimization for QoS Ethernet , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).