Traffic Engineering of Multiple Spanning Tree Routing Networks: the Load Balancing Case

This paper deals with optimal load balancing in telecommunication networks based on multiple spanning tree routing. This is the case in switched Ethernet networks where the operator configures different routing spanning trees and assigns each demand VLAN to one of the spanning trees. We consider modeling and solving three load balancing objectives: (i) minimization of the average link load with a guaranteed optimal worst case link load, (ii) minimization of the worst case link load with a guaranteed optimal average link load and (iii) the min-max optimization of link loads. We also propose heuristic techniques to compute both feasible solutions and lower bounds for the addressed optimization problems. Finally, we assess both the efficiency and the efficacy of the different solution techniques and compare the quality of each problem solution taking into account the optimization criteria of the other problems.

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

[2]  Amaro de Sousa,et al.  Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing , 2008, FITraMEn.

[3]  Amaro F. de Sousa,et al.  IMPROVING LOAD BALANCE AND MINIMIZING SERVICE DISRUPTION ON ETHERNET NETWORKS WITH IEEE 802 . 1 S MSTP , 2007 .

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

[5]  Wlodzimierz Ogryczak,et al.  On solving linear programs with the ordered weighted averaging objective , 2003, Eur. J. Oper. Res..

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

[7]  Michal Pioro,et al.  Application of max-min fairness rule to bandwidth allocation in telecommunication networks - implementation issues , 2004 .

[8]  P. Nilsson,et al.  Applications of the max-min fairness principle in telecommunication network design , 2005, Next Generation Internet Networks, 2005.

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

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

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

[12]  Michal Pioro,et al.  Telecommunications network design and max-min optimization problem , 2004 .

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

[14]  M. Milewski Fair and Efficient Bandwidth Allocation with the Reference Point Methodology , 2022 .

[15]  Gianpaolo Oriolo,et al.  Local Restoration for Trees and Arborescences , 2008, FITraMEn.

[16]  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..