Information Technology and Management

, Volume 8, Issue 1, pp 19–29 | Cite as

Design of reliable SONET feeder networks

  • June S. Park
  • Byung Ha Lim
  • Larry J. LeBlanc


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.


Communications Integer Programming Heuristic 


  1. 1.
    G.R. Boyer, A perspective on fiber in the loop systems, IEEE Magazine of Lightwave Communications Systems 1(3) (1990) 6–11.Google Scholar
  2. 2.
    Broadband Publishing Corporation, The optical report: Guide to next-gen SONET multiplexing, The ATM & Report 7(11) (2001) 5–6.Google Scholar
  3. 3.
    S. Cosares, I. Saniee and O. Wasem, Network planning with the SONET Toolkit, Bellcore Exchange (1992) 8–13.Google Scholar
  4. 4.
    M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533–1541.Google Scholar
  5. 5.
    S. Martello and P. Toth, Knapsack Problems, Algorithms and Computer Implementations, Wiley, Chichester England, 1990.Google Scholar
  6. 6.
    R.M. Nauss, An efficient algorithm for the 0–1 Knapsack problem, Management Science 23 (1997) 27–31.Google Scholar
  7. 7.
    J.S. Park, B.H. Lim and Y. Lee, A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem, Management Science 44 (1998) 271–282.CrossRefGoogle Scholar
  8. 8.
    H.D. Sherali, J. Cole Smith and Y. Lee, Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting, INFORMS Journal on Computing 12 (2000) 284–298.CrossRefGoogle Scholar
  9. 9.
    J.C. Smith, Algorithms for Distributing Telecommunication Traffic on a Multiple-ring SONET-based Network, Department of Systems and Industrial Engineering, University of Arizona, P.O. Box 210020, Tucson, AZ 85721, 2002.Google Scholar
  10. 10.
    J. Sosnosky and T. Wu, SONET ring applications for survivable fiber loop network, IEEE Communications Magazine 29(6) (1991) 51–58.CrossRefGoogle Scholar
  11. 11.
    T. Wu, Fiber Network Service Survivability, Artech House, Boston, 1992.Google Scholar
  12. 12.
    T. Wu, D.J. Kolar and R.H. Cardwell, Survivable network architectures for broadband fiber optic networks: model and performance comparisons, IEEE Journal of Lightwave Technology 6 (1988) 1698–1709.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • June S. Park
    • 1
  • Byung Ha Lim
    • 2
  • Larry J. LeBlanc
    • 3
  1. 1.Samsung SDS Co., LtdSeoulKorea
  2. 2.College of Business AdministrationChung-Ang UniversitySeoulKorea
  3. 3.Owen Graduate School of ManagementVanderbilt UniversityNashvilleUSA

Personalised recommendations