The Journal of the Korea Contents Association (한국콘텐츠학회논문지)

The Korea Contents Association (한국콘텐츠학회)
권호 표지
DOI QR코드

DOI QR Code

MDP-Based Stepwise Network Reconfiguration Scheme for Dynamic WDM Network

동적 WDM네트워크를 위한 MDP기반의 단계적 망 재구성 기법

  • 박병섭 (인하공업전문대학 컴퓨터시스템과)
  • Published : 2008.01.28
Download PDF
⟨ Previous Next ⟩

Abstract

We completed a new cluster system based on WDM by proposing virtual topology reconfiguration schemes. The key idea of the proposed scheme Is to construct a set with the longest chains of requests of connecting nodes which need to be assigned a wavelength. All the sets have no common factor, that is, there is no duplicated link among the requests of connecting. After making the set satisfying this condition, we could assign a wavelength to per corresponding set. We could reconfigure a virtual topology with this scheme collectively. we compared our scheme to existing approaches by the OWns simulation tool. As the results, we gained improved performances, reducing 10% of blocking rate and improving 30% of ADM utilization in terms of the blocking probability and the ADM utilization.

본 논문에서는 새로운 가상 토폴로지 재구성 기법을 제안하여 WDM 기반의 클러스터 시스템 구현을 위한 이론 연구를 수행하였다. 제안 기법의 핵심 아이디어는 파장 할당이 요구되는 연결 요청을 최대한 이어서 집합을 형성하는 것으로, 각 집합은 서로 소이며 집합 내의 연결 요청들 중에는 링크의 중복이 일어나지 않도록 한다. 이러한 조건을 만족하도록 집합을 형성한 후, 각 집합마다 파장을 하나씩 할당한다. 이는 일괄적으로 재구성을 수행하는 방법이다. 제안된 기법은 OWns 시뮬레이션도구를 사용하여 측정한 결과, 블로킹 확률 및 ADM 이용율 측면에서 First-fit 기법에 비해 10% 정도의 블로킹 감소율과 30% 정도의 ADM 이용율이 향상되었음을 보였다.

Keywords

References

  1. P. Labourdette, George W. Hart, Anthony S. Acampora, "Branch-Exchange Sequences for Reconfiguration of Lightwave Networks," IEEE Transactions on Communications, Vol.42, No.10, pp.2822-2832, 1994(10). https://doi.org/10.1109/26.328952
  2. R. Jorg, "Heuristics versus Completeness for Graph Coloring," Chicago Journal of Theoretical Computer Science The MIT Press, Vol.2000, Article 1. 2000(2).
  3. J. S. Choi and D. Su, "A Functional Classification of Routing and Wavelength Assignment schemes in DWDM networks: Static case," NRC 2000, New Jersey, USA, APR, 2000.
  4. B. Kannan, S. Fotedar, and M. Gerla, "A two level optical star WDM metropolitan area network," Global Telecommunications Conference GLOBECOM '94 IEEE, pp.563-566, 1994. https://doi.org/10.1109/GLOCOM.1994.513582
  5. H. Lee, J. Kim, S, J. Hong, and S. Lee "Processor allocation and task scheduling of matrix chain products on parallel systems," Parallel and Distributed Systems, IEEE Transactions, Vol.14, No.4, APR pp.394-407, 2003 https://doi.org/10.1109/TPDS.2003.1195411
  6. N. Baneriee and S. Sharan, "A evolutionary algorithm for solving the single objective static routing and wavelength assignment problem in WDM networks," Proceedings of International Conference, pp.13-18, 2004.
  7. D. Coudert and H. Rivano, "Lightpath assignment for multifibers WDM networks with wavelength translators," Global Telecommunications Conference, GLOBECOM '02. IEEE, Vol.3, pp.2686-2690, 2002(11). https://doi.org/10.1109/GLOCOM.2002.1189117
  8. R. Jorg, "Heuristics versus Completeness for Graph Coloring," Chicago Journal of Theoretical Computer Science The MIT Press Vol.2000, Article 1. 2000(2).
  9. http://www.eecs.wsu.edu/-dawn/software/owns.html