Scipediacontent: Scipediacontent moved page Draft Content 504489558 to Joyce-Moniz et al 2015a

2021-01-28T19:04:11Z

Scipediacontent moved page Draft Content 504489558 to Joyce-Moniz et al 2015a

Scipediacontent: Created page with " == Abstract == International audience; Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the..."

2021-01-28T19:04:07Z

Created page with " == Abstract == International audience; Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the..."

New page

== Abstract ==

International audience; 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.

== Original document ==

The different versions of the original document can be found in:

* [http://hdl.handle.net/20.500.12210/23798 http://hdl.handle.net/20.500.12210/23798]

* [https://hal.inria.fr/hal-01261389 https://hal.inria.fr/hal-01261389]

* [https://hal.inria.fr/hal-01665614/file/FGM-DAM-2016-04-15.pdf https://hal.inria.fr/hal-01665614/file/FGM-DAM-2016-04-15.pdf]

* [https://api.elsevier.com/content/article/PII:S0166218X16303353?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S0166218X16303353?httpAccept=text/xml],
: [https://api.elsevier.com/content/article/PII:S0166218X16303353?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S0166218X16303353?httpAccept=text/plain],
: [http://dx.doi.org/10.1016/j.dam.2016.07.015 http://dx.doi.org/10.1016/j.dam.2016.07.015] under the license https://www.elsevier.com/tdm/userlicense/1.0/

* [https://hal.inria.fr/hal-01665614 https://hal.inria.fr/hal-01665614],
: [https://hal.inria.fr/hal-01665614/document https://hal.inria.fr/hal-01665614/document],
: [https://hal.inria.fr/hal-01665614/file/FGM-DAM-2016-04-15.pdf https://hal.inria.fr/hal-01665614/file/FGM-DAM-2016-04-15.pdf]

* [https://www.sciencedirect.com/science/article/pii/S0166218X16303353 https://www.sciencedirect.com/science/article/pii/S0166218X16303353],
: [https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/262909/Details https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/262909/Details],
: [https://hal.inria.fr/hal-01665614/document https://hal.inria.fr/hal-01665614/document],
: [https://hal.inria.fr/hal-01665614 https://hal.inria.fr/hal-01665614],
: [https://dblp.uni-trier.de/db/journals/dam/dam234.html#FortzGJ18 https://dblp.uni-trier.de/db/journals/dam/dam234.html#FortzGJ18],
: [https://core.ac.uk/display/154739505 https://core.ac.uk/display/154739505],
: [https://academic.microsoft.com/#/detail/2510194365 https://academic.microsoft.com/#/detail/2510194365]

← Older revision	Revision as of 19:04, 28 January 2021
(No difference)

Joyce-Moniz et al 2015a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 504489558 to Joyce-Moniz et al 2015a

Scipediacontent: Created page with " == Abstract == International audience; Switched Ethernet networks rely on the Spanning Tree Protocol (STP) to ensure a cycle-free connectivity between nodes, by reducing the..."