Mathematical programming models for traffic engineering in Ethernet networks implementing the multiple spanning tree protocol
作者： Bernard Fortz , Luís Gouveia , Martim Moniz
DOI: 10.1007/978-3-319-09174-7_21
关键词:
摘要: The Multiple Spanning Tree Protocol (MSTP), used in Ethernet networks, maintains a set of spanning trees that are for routing the demands network. Each tree is allocated to pre-defined demands. In this paper we present two mixed integer programming models Traffic Engineering problem optimally designing network implementing MSTP, such link utilization minimized. This first approach focuses on using exact methods solve problem. We tests order compare formulations, terms formulation strength and computing time.
springer.com
ulb.ac.be
sci-hub.st 参考文章(16)
George L Nemhauser, AHG Rinnooy Kan, MJ Todd, Handbooks in operations research and management science North-Holland , Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co. ,(1989)
Trong-Viet Ho, Traffic engineering techniques for data center networks ,(2012)
Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg, A Flow Formulation for the Optimum Communication Spanning Tree international network optimization conference. ,vol. 41, pp. 85- 92 ,(2013) , 10.1016/J.ENDM.2013.05.079
Dorabella Santos, Amaro de Sousa, Filipe Alvelos, Mateusz Dzida, Michał Pióro, Optimization of link load balancing in multiple spanning tree routing networks Telecommunication Systems. ,vol. 48, pp. 109- 124 ,(2011) , 10.1007/S11235-010-9337-8
Bernard Fortz, Mikkel Thorup, Increasing Internet Capacity Using Local Search Computational Optimization and Applications. ,vol. 29, pp. 13- 48 ,(2004) , 10.1023/B:COAP.0000039487.35027.02
M. Padmaraj, S. Nair, M. Marchetti, G. Chiruvolu, M. Ali, A. Ge, Metro Ethernet traffic engineering based on optimal multiple spanning trees wireless and optical communications networks. pp. 568- 572 ,(2005) , 10.1109/WOCN.2005.1436090
Dorabella Santos, Amaro de Sousa, Filipe Alvelos, Mateusz Dzida, Michal Pioro, Michal Zagozdzon, Traffic Engineering of Multiple Spanning Tree Routing Networks: the Load Balancing Case next generation internet. pp. 138- 145 ,(2009) , 10.1109/NGI.2009.5175784
A. Balakrishnan, T. L. Magnanti, R. T. Wong, A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design Operations Research. ,vol. 37, pp. 716- 740 ,(1989) , 10.1287/OPRE.37.5.716
Aref Meddeb, NGL01-3: Multiple Spanning Tree Generation and Mapping Algorithms for Carrier Class Ethernets global communications conference. pp. 1- 5 ,(2006) , 10.1109/GLOCOM.2006.245
R.Kipp Martin, Using separation algorithms to generate mixed integer model reformulations Operations Research Letters. ,vol. 10, pp. 119- 128 ,(1991) , 10.1016/0167-6377(91)90028-N