Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2004.11C.5.677

Routing and Wavelength Assignment in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths  

Choo, Hyun-Seung (성균관대학교 정보통신공학부)
Chung, Sung-Taek (한국산업기술대학교 컴퓨터공학과)
Lee, Sung-Chang (한국항공대학교 통신정보공학과)
Publication Information
The KIPS Transactions:PartC / v.11C, no.5, 2004 , pp. 677-682 More about this Journal
Abstract
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.
Keywords
RWA; Edge Disjoint Paths; Maximum Flout Technique;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI
2 M. Alanyali and E. Ayanoglu, 'Rrovisioning algorithms for WDM optical networks,' IEEE/ACM Trans. On Networking, Vol.7, No.5, pp.767-778, Oct., 1999   DOI   ScienceOn
3 I. Chlamtac, A. Farago and T. Zhang, 'Lightpath (wavelength) routing in large WDM networks,' IEEE J. Sel. Areas in Communs, Vol.14, No.5, pp.909-913, June, 1996   DOI   ScienceOn
4 http://only1.snu.ac.kr/software/lpsolver/
5 J. M. Kleinberg, 'Approximation algorithms for disjoint paths problems,' Ph.D. dissertation, MIT, Cambridge, May, 1996
6 L. R. Ford and D. R. Fulkerson, 'Flows in Network, Princeton University Press,' Princeton, 1962
7 P. Papadimitratos, Z. J. Haas and E. G. Sirer, 'Path Set Selection in Mobile Ad Hoc Networks,' MobiHoc, 2002   DOI
8 M. H. Kim, H. Choo, B. H. Yae and J. H. Lee, 'A Practical PWA Algorithm Based on Lookup Table for Edge Disjoint Paths,' Springer-Verlag Lecture Notes in Computer Science, Vol.2713, pp.138-147, June, 2003
9 Y. Zhang, K. Taira, H. Takagi and S. K. Das, 'An Efficient Heuristic for Routing and Wavelength Assignment in Optical WDM Networks,' IEEE International Conference on Communications, Vol.5, pp.2734-2739, 2002   DOI
10 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
11 R. Ramaswami and K. Sivarajan, 'Routing and Wavelength Assignment in All-Optical Network,' 'IEEE/ACM Trans. Networking, Vol.3, No.5, pp.489-500, 1995   DOI   ScienceOn
12 D. Banerjee and B. Mukherjee, 'Practiacal Approach for Routing and Wavelength Assignment in LargeWavelength Routed Optical Networks,' IEEE JSAC, Vol.14, No.5, pp.903-908, 1996   DOI   ScienceOn
13 P. Manohar, D. Manjunath and R. K. Shevgaonkar, 'Routing and Wavelength Assignment in optical Network From Edge Disjoint Path Algorithms,' IEEE Communications Letters, Vol.6, No.5, pp.211-213, May, 2002   DOI   ScienceOn