Journal
DISCRETE APPLIED MATHEMATICS
Volume 234, Issue -, Pages 114-130Publisher
ELSEVIER
DOI: 10.1016/j.dam.2016.07.015
Keywords
Telecommunications; Traffic engineering; Multiple Spanning Tree Protocol; Network design; Mixed-integer programming
Categories
Funding
- Interuniversity Attraction Poles Programme [P7/36 COMEX]
- Belgian Science Policy Office
- TCPER Nord-Pas de Calais/FEDER DATA Advanced data science and technologies
- FCT - Fundacao para a Ciencia e a Tecnologia [UID/MAT/04561/201]
Ask authors/readers for more resources
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 providing a first comparison of different models that can be used in exact methods. (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available