DOI QR코드

DOI QR Code

동적인 WDM 네트워크에서 가상 링크의 불연속성을 감소시키는 파장 할당 기법

Wavelength assignment algorithm to reduce discontinuity of virtual links in dynamic WDM network

  • 유승연 (서강대학교 공과대학 컴퓨터학과) ;
  • 김성천 (서강대학교 공과대학 컴퓨터학과)
  • 발행 : 2006.04.01

초록

파장 할당에 대해 제안된 알고리즘들의 대부분은 무한한 수의 ADM을 가정하여 I/O 블로킹을 배제하였으며 파장을 할당한 이후, 네트워크 내에 파장이 불연속적인 형태로 남게 되어 링크 블로킹을 증가시킬 수 있다는 문제점이 있다. 또한 최악의 경우 O(W $N^3$)의 시간 복잡도를 갖는다. 본 논문에서는 온라인 상에서 동적인 트래픽 요청에 대해 최악의 경우 O(W $N^2$)의 복잡도를 가지면서 I/O 블로킹과 링크 블로킹을 모두 고려하는 파장 할당 알고리즘을 제안하였다. 파장의 불연속성을 최소화함으로써 블로킹의 발생을 감소시킬 수 있었다.

Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W $N^3$) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W $N^2$) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

키워드

참고문헌

  1. H. Zang, J. P. Jue and B. Mukherjee, 'A Review of Routing and Wavelength Assignment Approaches for Wavelength Routed Optical WDM Networks', Optical Networks Magazine, Vol.1, No.1, pp.47-60, Jan., 2000
  2. A. Mokhtar and M. Azizoglu, 'Adaptive Wavelength Routing in All-Optical Networks', IEEE/ACM Transactions on Networking, Vol.7, Issue 5, pp.779-786, Oct., 1999 https://doi.org/10.1109/90.803390
  3. A. Mokhtar and M. Azizoglu, 'Adaptive Wavelength Routing in All-Optical Networks', IEEE/ACM Transactions on Networking, Vol.6, No.2, pp.197-206, Apr., 1998 https://doi.org/10.1109/90.664268
  4. S. Xu, L. Li, S. Wang and C. Chen, 'Wavelength Assignment for Dynamic Traffic in WDM Networks', Proceedings. IEEE International Conference, pp.375-379, 2000
  5. X. Zhang and C. Qiao, 'Wavelength Assignment for Dynamic Traffic in Multi-fiber WDM Networks', International Conference on Comp Comm and Networks, pp.479-485, Oct., 1998 https://doi.org/10.1109/ICCCN.1998.739952
  6. Jing Teng and George N. Rouskas, 'On Wavelength Assignment in Optical Burst Switched Networks', IEEE BROADNETS'04,2004 https://doi.org/10.1109/BROADNETS.2004.53
  7. Quang-Dzung HO and Man-Seep LEE, 'Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability', IEICE TRANS. COMMUN., Vol.E89-B, No.2 Feb., 2006 https://doi.org/10.1093/ietcom/e89-b.2.436
  8. R. Kandula and G. Sasaki, 'Grooming of Dynamic Tributary in WDM Rings with Rearrangements', 39th Allerton Conference, Monticello IL, Oct., 2001
  9. H. Ghafouri-Shiraz, G. Zhu and Y. Fei, 'Effective Wavelength Assignment Algorithms for Optimizing Design Costs in SONET/WDM Rings', Journal of Lightwave Technology, Vol.19, No.10, pp.1427-1439, Oct., 2001 https://doi.org/10.1109/50.956130
  10. L. Liu, X. Li, P. Wan and O. Frieder, 'Wavelength Assignment in WDM Rings to Minimize SONET ADMs', IEEE INFOCOM, Vol.2, pp.1020-1025, 2000 https://doi.org/10.1109/INFCOM.2000.832277
  11. X. Yuan and A. Fulay, 'Wavelength Assignment to Minimize the Number of SONET ADMs in WDM Rings', IEEE International Conference on Communications, New York, April, 28-May 2, 2002 https://doi.org/10.1109/ICC.2002.997374
  12. R. Dante, E. Moschim, and J. Martins-Filho, 'Modified distributed relative capacity loss algorithm for WDM optical networks,' J. Opt. Networks.4, pp.271-284, 2005 https://doi.org/10.1364/JON.4.000271