论文信息 - Routing, Wavelength Assignment in Optical Networks Using an Efficient and Fair EDP Algorithm

Routing, Wavelength Assignment in Optical Networks Using an Efficient and Fair EDP Algorithm

Routing and wavelength assignment (RWA) problem in wavelength routed optical networks is typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. RWA with maximum edge disjoint path (EDP) using simple bounded greedy algorithm is shown to be as good as previously known solution method. In this paper, we present shortest path first greedy algorithm for maximum EDP with construction of path conflict graph which gives fair and efficient solution to the RWA problem in optical networks.

V. Sridhar | Pallavi Manohar | V. Sridhar | P. Manohar

[1] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[2] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[3] Clifford Stein,et al. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[4] George N. Rouskas. Routing and Wavelength Assignment in Optical WDM Networks , 2001 .

[5] Robert A. Meyers,et al. Encyclopedia of telecommunications , 1988 .

[6] D. Manjunath,et al. Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.

[7] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .

[8] Kumar N. Sivarajan,et al. Routing and wavelength assignment in all-optical networks , 1995, TNET.

[9] Aravind Srinivasan,et al. Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[10] Biswanath Mukherjee,et al. A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..