Design of Broadband Virtual Private Networks: Model and Heuristics for the B–WiN
Please always quote using this URN: urn:nbn:de:0297-zib-3565
- We investigate the problem of designing survivable broadband virtual private networks that employ the Open Shortest Path First (OSPF) routing protocol to route the packages. The capacities available for the links of the network are a minimal capacity plus multiples of a unit capacity. Given the directed communication demands between all pairs of nodes, we wish to select the capacities in a such way, that even in case of a single node or a single link failure a specified percentage of each demand can be satisfied and the costs for these capacities are minimal. We present a mixed--integer linear programming formulation of this problem and several heuristics for its solution. Furthermore, we report on computational results with real-world data.
Author: | Andreas Bley, Martin Grötschel, Roland Wessäly |
---|---|
Document Type: | ZIB-Report |
Tag: | Heuristics; Network Capacity Planning; OSPF Routing; Shortest Path Routing; Survivable Networks; Telecommunication Network Design |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C90 Applications of mathematical programming | |
Date of first Publication: | 1998/03/19 |
Series (Serial Number): | ZIB-Report (SC-98-13) |
ZIB-Reportnumber: | SC-98-13 |
Published in: | Appeared in: Robust Communication Networks : Interconnection and Survivability. Dean, N. et al. (eds.), 2000, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 53, pp. 1-16 |