Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol

DOI10.1016/j.dam.2016.07.015zbMath1376.05143OpenAlexW2510194365MaRDI QIDQ1686055

Martim Joyce-Moniz, Bernard Fortz, Luís Gouveia

Publication date: 20 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01665614/file/FGM-DAM-2016-04-15.pdf

zbMATH Keywords

network designtelecommunicationsmixed-integer programmingtraffic engineeringmultiple spanning tree protocol

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items

Majority spanning trees, cotrees and their applications ⋮ Parallel construction of multiple independent spanning trees on highly scalable datacenter networks ⋮ Models for the piecewise linear unsplittable multicommodity flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing internet capacity using local search
• Using separation algorithms to generate mixed integer model reformulations
• Optimum Communication Spanning Trees
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• The complexity of theorem-proving procedures
• Extended formulations in combinatorial optimization