P. E. Wirth, The role of teletraffic modeling in the new communications paradigms, Communications Magazine, IEEE, vol.35, issue.8, pp.86-92, 1997.

C. Kim, M. Caesar, and J. Rexford, Floodless in seattle, ACM SIGCOMM Computer Communication Review, vol.38, issue.4, pp.3-14, 2008.
DOI : 10.1145/1402946.1402961

T. Ho, Traffic engineering techniques for data center networks, 2012.
DOI : 10.1016/j.comnet.2014.03.018

A. Kolarov, B. Sengupta, and A. Iwata, Design of multiple reverse spanning trees in next generation of ethernet-VPNs, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., pp.1390-1395, 2004.
DOI : 10.1109/GLOCOM.2004.1378212

A. Meddeb, Smart Spanning Tree Bridging for Carrier Ethernets, IEEE GLOBECOM 2008, 2008 IEEE Global Telecommunications Conference, pp.1-5, 2008.
DOI : 10.1109/GLOCOM.2008.ECP.331

T. Ho, Y. Deville, O. Bonaventure, and P. Francois, Traffic engineering for multiple spanning tree protocol in large data centers, 23rd International Teletraffic Congress (ITC), pp.23-30, 2011.

A. De-sousa and G. Soares, Improving Load Balance and Minimizing Service Disruption on Ethernet Networks with IEEE 802, 1S MSTP IP QoS and Traffic Control, pp.25-35, 2007.

X. He, M. Zhu, and Q. Chu, Traffic Engineering for Metro Ethernet Based on Multiple Spanning Trees, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, pp.97-97, 2006.

Y. Lim, H. Yu, S. Das, S. S. Lee, and M. Gerla, QoS-aware multiple spanning tree mechanism over a bridged LAN environment, GLOBECOM '03

A. Meddeb, NGL01-3: Multiple Spanning Tree Generation and Mapping Algorithms for Carrier Class Ethernets, IEEE Globecom 2006, pp.1-5, 2006.
DOI : 10.1109/GLOCOM.2006.245

D. Santos, A. De-sousa, F. Alvelos, M. Dzida, and M. Pióro, Optimization of link load balancing in multiple spanning tree routing networks, Telecommunication Systems, vol.148, issue.5, pp.109-124, 2010.
DOI : 10.1016/S0377-2217(02)00399-5

D. Santos, A. De-sousa, F. Alvelos, M. Dzida, M. Pióro et al., Traffic Engineering of Multiple Spanning Tree Routing Networks : the Load Balancing Case, in: Next Generation Internet Networks, pp.1-8, 2009.

W. Chen, D. Jin, and L. Zeng, Design of Multiple Spanning Trees for Traffic Engineering in Metro Ethernet, 2006 International Conference on Communication Technology, pp.1-4, 2006.
DOI : 10.1109/ICCT.2006.341953

M. Padmaraj, S. Nair, M. Marchetti, G. Chiruvolu, M. Ali et al., Metro ethernet traffic engineering based on optimal multiple spanning trees~, Second IFIP International Conference on Wireless and Optical Communications Networks, 2005. WOCN 2005., pp.568-572, 2005.
DOI : 10.1109/WOCN.2005.1436090

G. Mirjalily, F. A. Sigari, and R. Saadat, Best Multiple Spanning Tree in Metro Ethernet Networks, 2009 Second International Conference on Computer and Electrical Engineering, pp.117-121, 2009.
DOI : 10.1109/ICCEE.2009.200

T. Cinkler, A. Kern, and I. Moldován, Optimized QoS protection of ethernet trees, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005., 2005.
DOI : 10.1109/DRCN.2005.1563889

T. Cinkler, I. Moldován, A. Kern, C. Lukovszki, and G. Sallai, Optimizing QoS aware ethernet spanning trees, 2005 1st International Conference on Multimedia Services Access Networks, 2005. MSAN '05., pp.30-34, 2005.
DOI : 10.1109/MSAN.2005.1489937

A. Capone, D. Corti, L. Gianoli, and B. Sansó, An optimization framework for the energy management of carrier ethernet networks with Multiple Spanning Trees, Computer Networks, vol.56, issue.17, pp.3666-3681, 2012.
DOI : 10.1016/j.comnet.2012.08.002

S. S. Lee, K. Li, and C. Lin, Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks, Mathematical Problems in Engineering, vol.9, issue.5, 2015.
DOI : 10.1007/s11235-010-9337-8

URL : http://doi.org/10.1155/2015/676542

T. C. Hu, Optimum Communication Spanning Trees, SIAM Journal on Computing, vol.3, issue.3, pp.188-195, 1974.
DOI : 10.1137/0203015

URL : http://www2.informatik.hu-berlin.de/alkox/lehre/lvss12/ga/notes/GH_tree_application.pdf

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

L. A. Levin, Universal sequential search problems, Problemy Peredachi Informatsii, vol.9, issue.3, pp.115-116, 1973.

T. L. Magnanti and L. A. Wolsey, Optimal trees, pp.503-615, 1995.

R. K. Martin, Using separation algorithms to generate mixed integer model reformulations, Operations Research Letters, vol.10, issue.3, pp.119-128, 1991.
DOI : 10.1016/0167-6377(91)90028-N

M. Conforti, G. Cornuéjols, and G. Zambelli, Extended formulations in combinatorial optimization, pp.1-48, 2010.
DOI : 10.1007/s10479-012-1269-0

A. Balakrishnan, T. L. Magnanti, and R. T. Wong, A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design, Operations Research, vol.37, issue.5, pp.716-740, 1989.
DOI : 10.1287/opre.37.5.716

B. Fortz and M. Thorup, Increasing Internet Capacity Using Local Search, Computational Optimization and Applications, vol.29, issue.1, pp.13-48, 2004.
DOI : 10.1023/B:COAP.0000039487.35027.02

URL : https://hal.archives-ouvertes.fr/hal-01255580