Optimal design of switched Ethernet networks ...
Document type :
Compte-rendu et recension critique d'ouvrage
Title :
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol
Author(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]
Journal title :
Discrete Applied Mathematics
Pages :
114 - 130
Publisher :
Elsevier
Publication date :
2018-01
ISSN :
0166-218X
English keyword(s) :
Telecommunications
Traffic Engineering
Multiple Spanning Tree
Protocol
Network Design
Traffic Engineering
Multiple Spanning Tree
Protocol
Network Design
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [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) ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01665614/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01665614/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01665614/document
- Open access
- Access the document
- document
- Open access
- Access the document
- FGM-DAM-2016-04-15.pdf
- Open access
- Access the document
- FGM-DAM-2016-04-15.pdf
- Open access
- Access the document