Title
An On-Line Routing And Wavelength Assignment Algorithm For Dynamic Traffic In A Wdm Bidirectional Ring
Abstract
We develop an on-line routing and wavelength assignment (RWA) algorithm for A WDM bidirectional ring with N nodes. The algorithm dynamically supports all k-allowable traffic matrices, where k denotes an arbitrary integer vector (k(1),..., k(N)), and node i, 1 less than or equal to i less than or equal to N, can transmit at most k wavelengths and receive at most k(i) wavelengths. Our algorithm uses [Sigma(i=1)(N) k(i)/3] lengths in each ring direction to support all k-allowable traffic matrices in a, rearrangeably nonblocking fashion. Furthermore, our algorithm requires at most three light-path rearrangements per new session request regardless of the number of nodes N and the amount of traffic k. In a special case with k(i) = k for all i, 1 less than or equal to i less than or equal to N, the algorithm uses [kN/3] wavelengths in each ring direction, which is shown in [1] to be. the minimum number of wavelengths required for any off-line nonblocking RWA algorithm.
Year
Venue
Field
2002
PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES
Wavelength-division multiplexing,Link-state routing protocol,Equal-cost multi-path routing,Multipath routing,Dynamic Source Routing,Computer science,Routing and wavelength assignment,Computer network
DocType
Citations 
PageRank 
Conference
7
0.63
References 
Authors
1
3
Name
Order
Citations
PageRank
Poompat Saengudomlert19615.77
Eytan Modiano23714314.44
Robert G. Gallager33711836.08