Designing packet‐switched feeder networks with survivability and node compatibility constraints: Korean HiNET‐P case

In this paper we present heuristic algorithms to solve the combined problem of topology design, capacity assignment and routing for feeder transport networks that connect local access subnets to a packet‐switched backbone network. The algorithms are designed to build a two‐edge‐connected topology with the average packet delay constraint, switch throughput constraint, and two optional, additional constraints: dual homing and node compatibility requirements. Graph‐theoretic algorithms are used for topology design and the flow deviation algorithm is used for routing and capacity assignment. Computational results using Korea Telecom’s field data show that the algorithms can generate low‐cost feasible networks for 50 node problems within 20 s.

[1]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[2]  June S. Park,et al.  Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms , 1998, INFORMS J. Comput..

[3]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[4]  Alexander Gersht,et al.  Joint Optimization of Data Network Design and Facility Selection , 1990, IEEE J. Sel. Areas Commun..

[5]  Bezalel Gavish,et al.  LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges , 2000, J. Heuristics.

[6]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[7]  Joakim Kalvenes,et al.  Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach , 1996, Telecommun. Syst..

[8]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[9]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[10]  Yogesh K. Agarwal.  An algorithm for designing survivable networks , 1989, AT&T Technical Journal.

[11]  Panjing Gong.  Capacitated network design with column generation , 1996 .

[12]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[13]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[14]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[15]  Varadharajan Sridhar,et al.  Benders-and-cut algorithm for fixed-charge capacitated network design problem , 2000, Eur. J. Oper. Res..

[16]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[17]  J. Herrmann,et al.  A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem , 1996 .

[18]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

[19]  Pramod K. Varshney,et al.  Design of survivable communications networks under performance constraints , 1991 .