Abstract
The Multiple Spanning Tree Protocol (MSTP), used in Ethernet networks, maintains a set of spanning trees that are used for routing the demands in the network. Each spanning tree is allocated to a pre-defined set of demands. In this paper we present two mixed integer programming models for the Traffic Engineering problem of optimally designing a network implementing MSTP, such that link utilization is minimized. This is the first approach that focuses on using exact methods to solve this problem. We present tests in order to compare the two formulations, in terms of formulation strength and computing time.
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
Similar content being viewed by others
References
IEEE Computer Society: Ieee standard for information technology- telecommunications and information exchange between systems- local and metropolitan area networks- common specifications part 3: Media access control (mac) bridges. ANSI/IEEE Std 802.1D, 1998 Edition, i-355 (1998)
IEEE Computer Society: Ieee standard for local and metropolitan area networks virtual bridged local area networks. IEEE Std 802.1Q-2005 (Incorporates IEEE Std 802.1Q1998, IEEE Std 802.1u-2001, IEEE Std 802.1v-2001, and IEEE Std 802.1s-2002), 0_1–285 (2006)
IEEE Computer Society: Ieee standards for local and metropolitan area networks– virtual bridged local area networks– amendment 3: Multiple spanning trees. IEEE Std 802.1s-2002 (Amendment to IEEE Std 802.1Q, 1998 Edition), 0_1-211 (2002)
Ho, T.: Traffic engineering techniques for data center networks. Ph.D. thesis, Ecole polytechnique de Louvain, Université catholique de Louvain (2012)
He, X., Zhu, M., Chu, Q.: Traffic engineering for metro ethernet based on multiple spanning trees. In: International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL’06), pp. 97–97. IEEE (2006)
Lim, Y., Yu, H., Das, S., Lee, S.S., Gerla, M.: QoS-aware multiple spanning tree mechanism over a bridged LAN environment. In: IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489), GLOBECOM ’03, vol. 6, pp. 3068–3072. IEEE (2003)
Meddeb, A.: Multiple spanning tree generation and mapping algorithms for carrier class ethernets. In: IEEE Globecom 2006, pp. 1–5. IEEE (2006)
de Sousa, A., Soares, G.: Improving load balance and minimizing service disruption on ethernet networks with IEEE 802.1S MSTP. In: Workshop on IP QoS and Traffic Control, pp. 25–35 (2007)
Santos, D., de Sousa, A., Alvelos, F., Dzida, M., Pióro, M., Zagozdzon, M.: Traffic engineering of multiple spanning tree routing networks: the load balancing case. In: Next Generation Internet Networks, NGI ’09, pp. 1–8 (2009)
Santos, D., de Sousa, A., Alvelos, F., Dzida, M., Pióro, M.: Optimization of link load balancing in multiple spanning tree routing networks. Telecommun. Syst. 48(1–2), 109–124 (2010)
Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 503–615. Elsevier Science, Amsterdam (1995)
Chen, W., Jin, D., Zeng, L.: Design of multiple spanning trees for traffic engineering in metro ethernet. In: 2006 International Conference on Communication Technology, pp. 1–4. IEEE (2006)
Padmaraj, M., Nair, S., Marchetti, M., Chiruvolu, G., Ali, M., Ge, A.: Metro ethernet traffic engineering based on optimal multiple spanning trees . In: Second IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2005, pp. 568–572. IEEE (2005)
Mirjalily, G., Sigari, F.A., Saadat, R.: Best multiple spanning tree in metro ethernet networks. In: 2009 Second International Conference on Computer and Electrical Engineering, pp. 117–121. IEEE (2009)
Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5), 716–740 (1989)
Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119–128 (1991)
Conforti, M., Cornuéjols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1–48 (2010)
Fernández, E., Luna-Mota, C., Hildenbrandt, A., Reinelt, G., Wiesberg, S.: A flow formulation for the optimum communication spanning tree. Electron. Notes Discrete Math. 41, 85–92 (2013)
Fortz, B., Thorup, M.: Increasing internet capacity using local search. Comput. Optim. Appl. 29(1), 13–48 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fortz, B., Gouveia, L., Moniz, M. (2014). Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-09174-7_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09173-0
Online ISBN: 978-3-319-09174-7
eBook Packages: Computer ScienceComputer Science (R0)