Design of reliable SONET feeder networks

Authors:
June S. Park;Byung Ha Lim;Larry J. Leblanc
Affiliations:
Samsung SDS Co., Ltd, Seoul, Korea 135-918;College of Business Administration, Chung-Ang University, Seoul, Korea 156-756;Owen Graduate School of Management, Vanderbilt University, Nashville, USA 37203
Venue:
Information Technology and Management
Year:
2007

Citing 5
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Clustering for the design of SONET rings in interoffice telecommunications

Management Science
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

Management Science
Fiber Network Service Survivability

Fiber Network Service Survivability
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting

INFORMS Journal on Computing

Reward mechanisms for P2P VoIP networks

Information Technology and Management

Quantified Score

Hi-index	0.00

Visualization

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.