Title :
A Maxmin Routing Algorithm for Dense Wavelength Division Multiplexing Networks
Author :
Yang, Yunyun ; Tsai, Wei Kang
Author_Institution :
EECS Dept., Univ. of California Irvine, Irvine, CA
Abstract :
In this paper, we present an algorithm to solve the routing problem for wavelength division multiplexing networks. We use the discrete maxmin fairness as the routing metric. First we use this algorithm to solve routing problem. After we get paths for all flows in the network, we use another algorithm d-CPG, to assign discrete maxmin rates for these flows. We test our algorithm by using the National LambdaRail network topology.
Keywords :
minimax techniques; telecommunication network routing; telecommunication network topology; wavelength division multiplexing; National LambdaRail network topology; d-CPG algorithm; dense wavelength division multiplexing networks; maxmin routing algorithm; network routing problem; Algorithm design and analysis; Internet; Network topology; Optical fiber networks; Routing protocols; Telecommunication traffic; Testing; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;
Conference_Titel :
Communication Technology, 2006. ICCT '06. International Conference on
Conference_Location :
Guilin
Print_ISBN :
1-4244-0800-8
Electronic_ISBN :
1-4244-0801-6
DOI :
10.1109/ICCT.2006.341804
