• Citer

Mathematical programming models for traffic engineering in Ethernet networks implementing the multiple spanning tree protocol

par Fortz, Bernard ;Gouveia, Luis;Moniz, Martim
Référence Lecture notes in computer science, 8596 LNCS, page (242-254)
Publication Publié, 2014

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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. © 2014 Springer International Publishing.