Abstract
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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Y.K. Agarwal, An algorithm for designing survivable networks, AT&T Technical Journal (1989) 64–76.
D. Bienstock and O. Gunluk, Capacitated network design – polyhedral structure and computation, INFORMS Journal on Computing 8 (1996) 243–259.
R. Boorstyn and H. Frank, Large scale network topological optimization, IEEE Transactions on Communications 25 (1977) 29–46.
G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10 (1998) 1–11.
L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: Approach to store-and forward computer communication network design, Networks 3 (1973) 97–133.
B. Gavish, Topological design of computer communication networks – the overall design problem, European Journal of Operational Research 58 (1992) 149–172.
B. Gavish, P. Trudeau, M. Dror, M. Gendreau and L. Mason, Fiberoptic circuit network design under reliability constraints, IEEE Journal on Selected Areas in Communications 7 (1989) 1181–1187.
M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Transactions on Communications 25 (1977) 48–60.
A. Gersht and R. Weihmayer, Joint optimization of data network design and facility selection, IEEE Journal on Selected Areas in Communications 8 (1990) 1667–1681.
P. Gong, Capacitated network design with column generation, Ph.D. thesis, Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA (1995).
J.W. Herrmann, A dual ascent approach to the fixed-charge capacitated network design problem, European Journal of Operational Research 95 (1996) 476–490.
F. Kaefer and J.S. Park, Interconnecting LANs and a FDDI backbone using transparent bridges: A model and solution algorithms, INFORMS Journal on Computing 10 (1998) 25–39.
A. Kershenbaum, P. Kermani and G. Grover, MENTOR: An algorithm for mesh network topological optimization and routing, IEEE Transactions on Communications 39 (1991) 503–513.
L. LeBlanc, J.S. Park, V. Sridhar and J. Kalvenes, Topology design and bridge-capacity assignment for interconnecting token ring LANs: Simulated annealing approach, Telecommunication Systems 6 (1996) 21–43.
T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research 43 (1995) 142–157.
C.L. Monma and D.F. Shallcross, Methods for designing communications networks with certain two-connected survivability constraints, Operations Research 37 (1989) 531–541.
K.T. Newport and P.K. Varshney, Design of survivable communications networks under performance constraints, IEEE Transactions on Reliability 4 (1991) 433–440.
V. Sridhar and J.S. Park, Benders-and-cut algorithm for fixed-charge capacitated network design problems, European Journal of Operational Research (forthcoming).
V. Sridhar, J.S. Park and B. Gavish, LP-based heuristic algorithms for interconnecting token rings via source routing bridges, Journal of Heuristics (forthcoming).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kim, Y.K., Koh, S.H. & Park, J.S. Designing packet‐switched feeder networks with survivability and node compatibility constraints: Korean HiNET‐P case. Telecommunication Systems 14, 321–329 (2000). https://doi.org/10.1023/A:1019157904460
Issue Date:
DOI: https://doi.org/10.1023/A:1019157904460