경영과학 (Korean Management Science Review)

한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

WDM 망에서의 다중 링 설계 알고리즘 연구

Multi-ring Design Algorithm for Survivable WDM Networks

  • 발행 : 2009.11.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

키워드

참고문헌

  1. 이영호 외, 그물구조 WDM 망 설계 알고리즘과 망 설계 시스템 연구, '한국경영과학회지', 제30권, 제1호(2005), pp.1-15
  2. Boworntumrnarat, C et al., 'Using mesh and multi-ring methods in the design of survivable wavelength-routed all-optical networks,' European Transactions on Telecarmunications, Vol.2, No.16(2005), pp.157-172
  3. CPLEX8.0, ILOG, 2003
  4. Gardner, L.M et al., Techniques for finding Ring Covers in Survivable Networks, Proc' of IEEE Globecom, 1994
  5. Garey, MR. and D.S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979
  6. Labbe, M et al., 'Covering a graph with cycles,' Computers and Operations Research, Vol.25, No.6(1998), pp.499-504 https://doi.org/10.1016/S0305-0548(97)00082-8
  7. Mehrotra, A et al., 'A Column Generation Approach for Graph Coloring,' Informs Journal on Computing, No.8(1996), pp.344-354 https://doi.org/10.1287/ijoc.8.4.344
  8. Sholvin, J.K, Approximating the Longest Path Problem with Heuristics : A Survey, B.S. Thesis, Northwestern Univ., 1999
  9. Stem, T.E. and K Bala, Multiwavelength Optical Networks, Addison Wesley, 1999
  10. Stidsen, T. and A.J. Glenstrup, 'Quantifying Optimal Mesh and Ring Design Costs,' Naval Research Logistics, No.25(2005), pp.150-158 https://doi.org/10.1002/nav.20008
  11. Thomassen, C, 'On the Complexity of Finding a Minimum Cycle Cover of a Graph,' SIAM. Journal on Computing, Vol.26, No.3 (1997), pp.675-677
  12. Wang, J. and W. Yurcik, A Multi-Ring Framework for Survivable Group Communications, Symposium of Command and Control Research Program, 2004
  13. Wuttisittikulkij, L. et al., 'A Comparative study of mesh and multi--ring design for survivable WDMnetworks,' IEICE Trans. Commun, Vol.E83-B, No.10(2000), pp.2270-2277