Single-layer Cuts for Multi-layer Network Design Problems
Please always quote using this URN: urn:nbn:de:0296-matheon-4113
We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost
installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with problem-specific preprocessing and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context,
helping to increase the dual bound and to reduce the optimality gaps.
| Author: | Arie M. C. A. Koster, Sebastian Orlowski, Christian Raack, Georg Baier, Thomas Engel |
|---|---|
| URN: | urn:nbn:de:0296-matheon-4113 |
| Referee: | Martin Grötschel |
| Language: | English |
| Date of first Publication: | 19.08.2007 |
| Tag: | cutting planes; mixed-integer programming; multi-layer network design; telecommunication networks |
| Institute: | Zuse Institute Berlin (ZIB) |
| Project: | B3 Integrated Planning of Multi-layer Telecommunication Networks |
| MSC-Classification: | 68M10 Network design and communication [See also 68R10, 90B18] |
| 90B18 Communication networks [See also 68M10, 94A05] | |
| 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | |
| Preprint Number: | Matheon Preprint #398 |


