Management Science and Financial Engineering

  • 제11권2호
  • /
  • Pages.85-103
  • /
  • 2005
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Routing and Wavelength Assignment in Survivable WDM Networks without Wavelength Conversion

  • Lee, Tae-Han (Department of Industrial and Information Systems Engineering, Chonbuk National University) ;
  • Park, Sung-Soo (Department of Industrial Engineering, KAIST) ;
  • Lee, Kyung-Sik (School of Industrial Information & Systems Engineering, Hankuk University of Foreign Studies)
  • 발행 : 2005.11.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

키워드

참고문헌

  1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, 'Branch-and-Price; Column Generation for Solving Huge Integer Programs,' Operations Research 46 (1998), 316-329 https://doi.org/10.1287/opre.46.3.316
  2. Bond, J. A and U. S. R. Murty, Graph theory with application, Elsevier Publishing, 1976
  3. Bonefant, P., 'Optical layer survivability: A comprehnsive approach,' Proceedings of OFC'98 (1998), 270-271 https://doi.org/10.1109/OFC.1998.657389
  4. Gerstel, O. and R. Ramaswami, 'Optical layer survivability: A services perspective,' IEEE Communications magazine (2000), 104-113 https://doi.org/10.1109/35.825647
  5. Kennington, J., E. Olinick, A. Ortynski, and G. Spride, 'Wavelength routing and assignment in a survivable WDM mesh network,' Operations Research 51 (2003), 67-79 https://doi.org/10.1287/opre.51.1.67.12805
  6. Kurma, M. S. and P. S. Kurma, 'Static lightpath establishment in WDM-networks - New ILP formulations and heuristic algorithms,' Computer Communications 25 (2002), 109-114 https://doi.org/10.1016/S0140-3664(01)00339-5
  7. Lee, T., K. Lee, and S. Park, 'Optimal routing and wavelength assignment in WDM ring networks,' IEEE Journal on Selected Areas in Communications 18 (2000), 2146-2154 https://doi.org/10.1109/49.887934
  8. Lee, K., S. Park, K. Choe, and C. Park, 'Routing and wavelength assignment in WDM all-optical networks,' lEE Electronics Letters 36 (2000), 964-966 https://doi.org/10.1049/el:20000441
  9. Miyao, Y. and H. Saito, 'Optimal design and evalution of survivable WDM transport network,' IEEE Journal on Selected Areas in Communications 16 (1998), 1190-1198 https://doi.org/10.1109/49.725189
  10. Mohan, G. and C. S. R. Murthy, 'Lightpath restoration in WDM optical networks,' IEEE network (2000), 24-32 https://doi.org/10.1109/65.885667
  11. Nagatsu, N., S. Okamoto, and K. Sato, 'Optical path cross-connect system scale evaluation using path accomodation design for restricted wavelength multiplexing,' IEEE Journal on Selected Areas in Communications 14 (1996), 893-902 https://doi.org/10.1109/49.510912
  12. Narura-Tam, A., P. J. Lin, and E. Modiano, 'Efficient routing and wavelength assignment for reconfigurable WDM networks,' IEEE Journal on Selected Areas in Communications 20 (2002), 75-88 https://doi.org/10.1109/49.974663
  13. Ramamurthy, R., and B. Mukherjee, 'Survivable WDM mesh networks, part I - protection,' Proceedings of Infocom'99 (1999), 744-751 https://doi.org/10.1109/INFCOM.1999.751461
  14. Ramaswami, R., and K. N. Sivarajan, Optical networks - A Practical Perspective, Morgan Kaufmann 2000
  15. Savelsbergh, M., 'A branch-and-price algorithm for the general assignment problem,' Operations Research 45 (1997), 831-847 https://doi.org/10.1287/opre.45.6.831
  16. Ye, Y., T.H. Cheng, and C. Lu, 'Routing and wavelength assignment algorithms for translucent optical networks,' Optical Communications 229 (2004), 233-239 https://doi.org/10.1016/j.optcom.2003.11.001
  17. Zang, H., A. Ou and B. Mukherjee, 'Path-protection routing and wavelength assignment in WDM mesh networks under duct-layer constrains,' IEEE/ACM Transactions on networking 11 (2003), 248-258 https://doi.org/10.1109/TNET.2003.810313