Browse > Article

Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph  

Kim Duk Hun (성균관대학교 정보통신공학부 네트워크 기술 연구실)
Chung Min Young (성균관대학교 정보통신공학부 네트워크 기술 연구실)
Lee Tae-Jin (성균관대학교 정보통신공학부 네트워크 시스템 연구실)
Choo Hyunseung (성균관대학교 정보통신공학부 통신망 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.7B, 2005 , pp. 417-426 More about this Journal
Abstract
Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.
Keywords
Routing and wavelength assignment(RWA); Edge disjoint paths(EDP); PCG(Path conflict graph);
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Siva Ram Murthy, 'WDM optical networks,': concepts, design, and algorithms, Prentice Hall PTR, 2002
2 Y. Zhang, K. Taira, H. Takagi and S. K. Das, 'An Efficient Heuristic for Routin and Wavelength Assignment in Optical WDM Networks,' IEEE International Conference on Communications, vol.5, pp. 2734-2739, 2002
3 M. Alanyali and E. Ayanoglu, 'Provisioning algorithms for WDM optical networks,' IEEE/ACM Transactions On Networking, vol.7, no.5, pp. 767-778, Oct. 1999   DOI   ScienceOn
4 김명희, 박영철, 정민영, 이태진, 추현승, 'EDP들의 참조 테이블을 이용한 실용적인 경로 설정 및 파장 할당 알고리즘', 정보과학회논문지, 정보통신 4월호, 제31권 제2호. pp. 123-130, 2004
5 D. Banerjee and B. Mukherjee, 'Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks,' IEEE Journal on Selected Areas in Communications, Vol.14, pp. 903-908, June 1996   DOI   ScienceOn
6 P. Manohar, D. Manjunath, and R. K. Shevgaonkar, 'Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithm,' IEEE Communication Letters, vol.5, pp.211-213, May 2002
7 P. Papadimitratos, Z. J. Haas, and E. G. Sirer, 'Path Set Selection in Mobile Ad Hoc Networks,' MobiHoc 2002
8 Ramaswami R., K. Sivarajan, 'Routing and Wavelength Assignment in All-Optical Networks,' IEEE/ACM Transactions on Networking, vol.3, no.5, pp. 489-500, October 1995   DOI   ScienceOn
9 I. Chlamtac, A. Farago, and T. Zhang, 'Lightpath(wavelength) routing in large WDM networks,' IEEE Journal on Selected Areas in Communications, Vol.14, no.5, pp. 909-913, June 1996   DOI   ScienceOn
10 H. Zang, J. P. Jue, and B. Mukherjee 'A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks,' SPIE/Baltzer Optical Networks Magazine, vol.1, no.1, Jan. 2000
11 G. Li and R. Simha, 'The Partition Coloring Problem and its Application to Wavelength Routing and Assignment,' First Workshop on Optical Networks, Dallas, TX, 2000
12 Kolliopoulos S., C. Stein, 'Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs,' Lecture Notes in Computer Science, vol. 1412, 1998
13 Choi J., N. Golmie, F. Lapeyrere, F. Mouveaux and D. Su, 'A Functional Classification of Routing and Wavelength Assignment Schemes in DWDM Networks: Static Case,' Proceedings of VII International Conference on Optical Communication and Networks, Jan. 2000
14 M. D. Swaminathan and K. N. Sivarajan, 'Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion,' IEEE International Conference on Communications, vol.5, pp. 2750-2755, 2002