Design of Reliable SONET Feeder Networks

Information Technology and Management, Vol. 8, No, 1, March 2007

27 Pages Posted: 1 Feb 2008

See all articles by June S. Park

June S. Park

affiliation not provided to SSRN

Byung H. Lim

affiliation not provided to SSRN

Larry J. LeBlanc

Vanderbilt University - Operations Management

Abstract

We address the physical SONET network design problem of selecting stackable, unidirectional rings connecting central office nodes (COs) and remote nodes (RNs). This problem frequently arises in designing feeder transport networks to support centralized traffic between the COs and RNs. We formulate a 0-1 programming model for this problem. A simulated annealing-based Lagrangian relaxation procedure to find optimal or near-optimal solutions is then described. Computational results are reported showing that our procedures produce solutions that are on average within 1.1% of optimality. We show that using simulated annealing to augment the pure Lagrangian approach produces superior solutions to the Lagrangian approach.

Keywords: communications, integer programming, heuristic

Suggested Citation

Park, June S. and Lim, Byung H. and LeBlanc, Larry, Design of Reliable SONET Feeder Networks. Information Technology and Management, Vol. 8, No, 1, March 2007, Available at SSRN: https://ssrn.com/abstract=1088374

June S. Park

affiliation not provided to SSRN ( email )

No Address Available

Byung H. Lim (Contact Author)

affiliation not provided to SSRN

Larry LeBlanc

Vanderbilt University - Operations Management ( email )

Nashville, TN 37203
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
38
Abstract Views
711
PlumX Metrics