Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IEEE Standard 802.1s, Virtual Bridged Local Area Networks - Amendment 3: Multiple Spanning Trees (2002)
MEF Technical Specification 6.1, Ethernet Services Definitions -Phase 2. Metro Ethernet Forum (2008)
de Sousa, A.F., Soares, G.: Improving Load Balance and Minimizing Service Disruption on Ethernet Networks using IEEE 802.1S MSTP. In: EuroFGI Workshop on IP QoS and Traffic Control, pp. 25–35. IST Press (2007)
Padmaraj, M., Nair, S., Marchetti, M., Chiruvolu, G., Ali, M.: Traffic Engineering in Enterprise Ethernet with Multiple Spanning Tree Regions. In: Proc. of System Communications (ICW 2005), Montreal, Canada, pp. 261–266 (2005)
de Sousa, A.F., Soares, G.: Improving Load Balance of Ethernet Carrier Networks using IEEE 802.1S MSTP with Multiple Regions. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds.) NETWORKING 2006. LNCS, vol. 3976, pp. 1252–1260. Springer, Heidelberg (2006)
Kern, A., Moldovan, I., Cinkler, T.: Scalable Tree Optimization for QoS Ethernet. In: IEEE Symp. on Computers and Communications (ISCC 2006), pp. 578–584 (2006)
Ali, M., Chiruvolu, G., Ge, A.: Traffic Engineering in Metro Ethernet. IEEE Network 19(2), 10–17 (2005)
Kolarov, A., Sengupta, B., Iwata, A.: Design of Multiple Reverse Spanning Trees in Next Generation of Ethernet-VPNs. In: IEEE GLOBECOM 2004, vol. 3, pp. 1390–1395 (2004)
Sharma, S., Gopalan, K., Nanda, S., Chiueh, T.: Viking: A Multi-Spanning-Tree Ethernet Architecture for Metropolitan Area and Cluster Networks. In: IEEE INFOCOM 2004, vol. 4, pp. 2283–2294 (2004)
Ishizu, K., Kuroda, M., Kamura, K.: SSTP: an 802.1s Extention to Support Scalable Spanning Tree for Mobile Metropolitan Area Network. In: IEEE GLOBECOM 2004, vol. 3, pp. 1500–1504 (2004)
Lim, Y., Yu, H., Das, S., Lee, S.-S., Gerla, M.: QoS-aware multiple spanning tree mechanism over a bridged LAN environment. In: IEEE GLOBECOM 2003, vol. 6, pp. 3068–3072 (2003)
de Sousa, A.F.: Improving Load Balance and Resilience of Ethernet Carrier Networks with IEEE 802.1S Multiple Spanning Tree Protocol. In: Int. Conference on Networking (ICN), pp. 95–102. IEEE Xplore (2006)
Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8, 101–111 (1960)
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Operations Research 46, 316–329 (1998)
Vanderbeck, F.: On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48(1), 111–128 (2000)
Alvelos, F.: Branch-and-price and multicommodity flows. PhD Thesis, Universidade do Minho (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santos, D., de Sousa, A., Alvelos, F. (2009). Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing. In: Valadas, R., Salvador, P. (eds) Traffic Management and Traffic Engineering for the Future Internet. FITraMEn 2008. Lecture Notes in Computer Science, vol 5464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04576-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-04576-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04575-2
Online ISBN: 978-3-642-04576-9
eBook Packages: Computer ScienceComputer Science (R0)