대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제32권3호
  • /
  • Pages.219-225
  • /
  • 2006
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

파장분할다중화망의 광경로 패킹에 대한 정수계획 해법

An Integer Programming Approach to Packing Lightpaths on WDM Networks

  • 이경식 (한국외국어대학교 산업정보시스템공학부) ;
  • 이태한 (전북대학교 산업정보시스템공학과) ;
  • 박성수 (한국과학기술원 산업공학과)
  • Lee, Kyungsik (School of Industrial Information & Systems Engineering, Hankuk University of Foreign Studies) ;
  • Lee, Taehan (Department of Industrial and Information System Engineering, Chonbuk National University) ;
  • Park, Sungsoo (Department of Industrial Engineering, KAIST)
  • 발행 : 2006.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.

키워드

참고문헌

  1. Barnhart, C., Johnson, E. L., Nemhauscr, G. L., Savelsbergh. M. W. P., and Vance, P. H. (1994), Branch-and-Price ; Column Generation for Solving Huge Integet Programs, Mathematical Programming : State of the Art, J. R. Birge and K. G. Murty eds., University of Michigan
  2. Chlamtac, I., Ganz A., and karmi, G. (1992), Lightpath Communications : An approach to high bandwidth optical WAN's, IEEE Transactions on Comminication, 40, 1171-1182 https://doi.org/10.1109/26.153361
  3. Dzongang, C., Galinier, P., and Pierre, S. (2005), A tabu search heuristic for the routing and wavelength assignment problem in optical networks, IEEE communications letters, 9(5), 426-428 https://doi.org/10.1109/LCOMM.2005.1431160
  4. Garey, M. R. and Johnson, D. S. (1979), Computers and intracterbility - A guide to the theory of NP-Completeness. San Francisco: W.H.Freeman and Company
  5. Kurma, M. S. and Kurma, P. S. (2002), Static lightpath establishment in WDM-networks - New ILP formulations and heuristic algorithms, Computer Communications, 25, 109-114 https://doi.org/10.1016/S0140-3664(01)00339-5
  6. Lee, K. C. and u, V. O. K. (1996), A wavelength routing algorithm in wide-area all-optical networks, Journal of Lightwave Technology, 1218-1229
  7. Lee, K., Kang K. C., Lee T., and Park S. (2002), An Optimization Approach to Routing and Wavelength Assignment in WDM All-Optical Mesh Networks without Wavelength Conversion, ETRI Journal, 24(2), 131-141 https://doi.org/10.4218/etrij.02.0402.0206
  8. Lee, T., Lee, K., and Park, S. (2000), Optimal routing and wavelength assignment in WDM ring networks, IEEE Journal on Selected Areas in Communications, 18, 2146-2154 https://doi.org/10.1109/49.887934
  9. Ozdaglar, A. E. and Bertsekas, D. P. (2003), Routing and wavelength assignment in optical networks, IEEE/ACM transactions on networking, 11(2), 259-272 https://doi.org/10.1109/TNET.2003.810321
  10. Ramaswarni, R and Sivarajan, K. N. (1995), Routing and Wavelength Assignment in All-Optical Networks, IEEE/ ACM transactions on networking, 3, 489-500 https://doi.org/10.1109/90.469957
  11. Vanderbeck F. and Wolsey L. A. (1996), An exact algorithm for IP column generation, Operations Research Letters, 19, 151-159 https://doi.org/10.1016/0167-6377(96)00033-8
  12. Wuttisittikulkij L. and O'Mahony M. J. (1995), Algorithms for Wavelength Assignment in All-Optical Networks, Performance Engineering of Computer and Telecommunication Systems, M. Merabti, M. Carew and F. Ball eds., Springer