Topological expansion of multiple-ring metropolitan area networks

This paper presents a mixed 0–1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new switch sites, the update of the configuration of the switches (with respect to port and shelf types), the update of the access network, and the expansion of the backbone (core) network. In addition, we consider that several technologies (e.g., frame relay and asynchronous transfer mode) and rates (e.g., OC-3 and OC-12) may be used in the access network. A multiple-ring topology is chosen for the backbone network since it is sparse, therefore not too expensive, while providing protection against single-link or switch failure. To find a good solution, we propose an initial heuristic that provides a starting solution and a tabu–based heuristic to improve the solution. Finally, we present an illustrative example of a MAN design with its successive expansions, followed by a systematic set of experiments designed to assess the performance of the proposed algorithms. © 2000 John Wiley & Sons, Inc.

[1]  Larry J. LeBlanc,et al.  Topological Expansion of Metropolitan Area Networks , 1994, Comput. Networks ISDN Syst..

[2]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

[3]  M. Beshai,et al.  Designing an ATM-based broadband network: an overview , 1995, Proceedings of GLOBECOM '95.

[4]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[5]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[6]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[7]  Yuping Qiu,et al.  Planning for optimal expansion of leased line communication networks , 1992, Ann. Oper. Res..

[8]  Daniel Bienstock,et al.  Computational experience with an effective heuristic for some capacity expansion problems in local access networks , 1993, Telecommun. Syst..

[9]  Hanan Luss,et al.  Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..

[10]  Louis Anthony Cox,et al.  Optimal Expansion of Fiber-Optic Telecommunications Networks in Metropolitan Areas , 1993 .

[11]  Alexander Shulman,et al.  An algorithm for capacity expansion of local access networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[12]  Egon Balas,et al.  The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.

[13]  Abraham P. Punnen,et al.  Optimal expansion of capacitated transshipment networks , 1996 .

[14]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[15]  Jeffery L. Kennington,et al.  An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations , 1991, INFORMS J. Comput..

[16]  S. Chamberland,et al.  Expansion of multiple ring MANs , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[17]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .