Optimal design of switched Ethernet networks ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol
Auteur(s) :
Fortz, Bernard [Auteur]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Integrated Optimization with Complex Structure [INOCS]
Gouveia, Luís [Auteur]
Centro de Investigação Operacional [CIO]
Joyce-Moniz, Martim [Auteur]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Integrated Optimization with Complex Structure [INOCS]
Gouveia, Luís [Auteur]
Centro de Investigação Operacional [CIO]
Joyce-Moniz, Martim [Auteur]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Titre de la revue :
Discrete Applied Mathematics
Pagination :
114 - 130
Éditeur :
Elsevier
Date de publication :
2018-01
ISSN :
0166-218X
Mot(s)-clé(s) en anglais :
Telecommunications
Traffic Engineering
Multiple Spanning Tree
Protocol
Network Design
Traffic Engineering
Multiple Spanning Tree
Protocol
Network Design
Discipline(s) HAL :
Informatique [cs]/Recherche opérationnelle [cs.RO]
Résumé en anglais : [en]
Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the topology of the network to a spanning tree. The Multiple Spanning Tree Protocol (MSTP) ...
Lire la suite >Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the topology of the network to a spanning tree. The Multiple Spanning Tree Protocol (MSTP) allows for the providers to partition the traffic in the network and assign it to different virtual local area networks, each satisfying the STP. In this manner, it is possible to make a more efficient use of the physical resources in the network. In this paper we consider the traffic engineering problem of finding optimal designs of switched Ethernet networks implementing the MSTP, such that the worst-case link utilization is minimized. We show that this problem is N P-hard. We propose three mixed-integer linear programming formulations for this problem. Through a large set of computational experiments, we compare the performance of these formulations. Until now, the problem was almost exclusively solved with heuristics. Our objective here is provide a first comparison of different models that can be used in exact methods.Lire moins >
Lire la suite >Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the topology of the network to a spanning tree. The Multiple Spanning Tree Protocol (MSTP) allows for the providers to partition the traffic in the network and assign it to different virtual local area networks, each satisfying the STP. In this manner, it is possible to make a more efficient use of the physical resources in the network. In this paper we consider the traffic engineering problem of finding optimal designs of switched Ethernet networks implementing the MSTP, such that the worst-case link utilization is minimized. We show that this problem is N P-hard. We propose three mixed-integer linear programming formulations for this problem. Through a large set of computational experiments, we compare the performance of these formulations. Until now, the problem was almost exclusively solved with heuristics. Our objective here is provide a first comparison of different models that can be used in exact methods.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01665614/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01665614/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01665614/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- FGM-DAM-2016-04-15.pdf
- Accès libre
- Accéder au document
- FGM-DAM-2016-04-15.pdf
- Accès libre
- Accéder au document