Photonic Network Communications

, Volume 16, Issue 2, pp 93–106 | Cite as

A traffic grooming problem of SONET-WDM rings

  • Junghee Han
  • Youngho Lee
  • Youngjin Kim


In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.


SONET-WDM ring Traffic grooming Integer programming Tabu search 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aringhieri R. and Dell’Amico M. (2005). Comparing metaheuristic algorithms for SONET network design problems. J. Heuristics 11: 35–57 MATHCrossRefGoogle Scholar
  2. 2.
    Chang M. and Chang S. (2000). A heuristic method for self-healing ring design in a single-homing cluster. Telecommun. Syst. 14: 175–195 MATHCrossRefGoogle Scholar
  3. 3.
    Cho W., Wang J. and Mukherjee B. (2001). Improved approaches for cost-effective traffic grooming in WDM ring networks: uniform-traffic case. Photonic Netw. Commun. 3: 245–254 CrossRefGoogle Scholar
  4. 4.
    Chung S., Kim H., Yoon Y. and Tcha D. (1996). Cost-minimizing construction of a unidirectional SHR with diverse protection. IEE/ACM Trans. Network 4: 921–928 CrossRefGoogle Scholar
  5. 5.
    Fortz B., Soriano P. and Wynants C. (2003). A tabu search algorithm for self-healing ring network design. Eur. J. Oper. Res. 151: 280–295 MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gerstel O., Ramaswami R. and Sasaki G. (2000). Cost-effective traffic grooming in WDM rings. IEEE/ACM Trans. Network 8: 618–630 CrossRefGoogle Scholar
  7. 7.
    Glover F. and Laguna M. (1997). Tabu Search. Kluwer Academic Publishers, Boston MATHGoogle Scholar
  8. 8.
    Glover F., Laguna M. and Marti R. (2000). Fundamentals of scatter search and path relinking. Control Cybern. 39: 653–684 MathSciNetGoogle Scholar
  9. 9.
    Goldschmidt O., Laugier A. and Olinick E. (2003). SONET/SDH ring assignment with capacity constraints. Discrete Appl. Math. 129: 99–128 MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. John Wiley & Sons (2004)Google Scholar
  11. 11.
    Kang D., Lee K., Park S., Park K. and Kim S. (2000). Design of local networks using USHRs. Telecommun. Syst. 14: 197–217 MATHCrossRefGoogle Scholar
  12. 12.
    Klincewicz J.G. (1998). Hub location in backbone/tributary network design: A review. Location Sci. 6: 307–333 CrossRefGoogle Scholar
  13. 13.
    Laguna, M., Marti, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publisher (2003)Google Scholar
  14. 14.
    Lee Y.H., Sherali H.D., Han J.H. and Kim S.I. (2000). A branch-and-cut algorithm for solving an intra-ring SONET design problem. Networks 35: 223–232 MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Martello S. and Toth P. (1990). Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, New York MATHGoogle Scholar
  16. 16.
    Nemhauser G. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York MATHGoogle Scholar
  17. 17.
    Ramaswami R. and Sivarajan K.N. (1998). Optical Networks: A Practical Perspective. Morgan Kaufman Publishers, California Google Scholar
  18. 18.
    Sherali H.D., Smith J.C. and Lee Y.H. (2000). Enhanced model representation for an intra-ring SONET design problem allowing demand splitting. INFORMS J. Comput. 12: 284–298 CrossRefGoogle Scholar
  19. 19.
    Thomadsen T. and Stidsen T. (2005). Hierarchical ring network design using branch-and-price. Telecommun. Syst. 29: 61–76 CrossRefGoogle Scholar
  20. 20.
    Wang J., Cho W. and Mukherjee B. (2001). Improved approaches for cost-effective traffic grooming in WDM ring networks: non-uniform traffic and bi-directional ring. IEEE/OSA J. Lightwave Technol. 19: 1645–1653 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.College of Business AdministrationKangwon National UniversityKangwon-doKorea
  2. 2.Department of Industrial Systems and Information EngineeringKorea UniversitySeoulKorea

Personalised recommendations