A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

被引:339
作者
Banerjee, D
Mukherjee, B
机构
[1] Department of Computer Science, University of California, Davis
[2] Indian Institute of Technology, Madras
[3] University of California, Davis, CA
[4] Networks Research Lab., University of California, Davis, CA
[5] Indian Institute of Technology, Kharagpur
[6] University of Washington, Seattle, WA
基金
美国国家科学基金会;
关键词
Graph coloring algorithms - Lightpaths - Wavelength assignment - Wavelength routing switches;
D O I
10.1109/49.510913
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node pairs, We propose a practical approach to solve routing and wavelength assignment (RWA) of lightpaths in such networks. A large RWA problem is partitioned into several smaller subproblems, each of which may be solved independently and efficiently using well-known approximation techniques, A multicommodity flow formulation combined with randomized rounding is employed to calculate the routes for lightpaths. Wavelength assignments for lightpaths are performed based on graph-coloring techniques, Representative numerical examples indicate the accuracy of our algorithms.
引用
收藏
页码:903 / 908
页数:6
相关论文
共 5 条
[1]   LIGHTPATH COMMUNICATIONS - AN APPROACH TO HIGH BANDWIDTH OPTICAL WANS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (07) :1171-1182
[2]  
Matula David W, 1972, GTC, P109
[3]   RANDOMIZED ROUNDING - A TECHNIQUE FOR PROVABLY GOOD ALGORITHMS AND ALGORITHMIC PROOFS [J].
RAGHAVAN, P ;
THOMPSON, CD .
COMBINATORICA, 1987, 7 (04) :365-374
[4]  
RAMASWAMI R, 1994, P IEEE INFOCOM 94, P970
[5]  
ZHANG Z, 1994, P IEEE INFOCOM 94, P534