Advertisement
Published in:
2009 | OriginalPaper | Chapter
Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing
Authors : Dorabella Santos, Amaro de Sousa, Filipe Alvelos
Published in: Traffic Management and Traffic Engineering for the Future Internet
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.