Scalable multihop WDM passive ring with optimal wavelength assignment and adaptive wavelength routing

2002 ◽  
Author(s):  
Duanyang Guo ◽  
Wei Guo ◽  
A.S. Acampora
Keyword(s):  
Wavelength Assignment ◽  
Wavelength Routing ◽  
Optimal Wavelength

Bounds on optimal wavelength assignment with and without wavelength changers

1998 ◽  
Author(s):  
M. K. Rajesh ◽  
Kumar N. Sivarajan ◽  
Ananth Selvarajan
Keyword(s):  
Wavelength Assignment ◽  
Optimal Wavelength

Yen-BSR: A New Approach for the Choice of Routes in WDM Networks

2014 ◽  
Vol 35 (4) ◽  
Author(s):  
A. F. Santos ◽  
R. C. Almeida ◽  
K. D. R. Assis
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Shortest Paths ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Superior Performance ◽  
Wavelength Routing ◽  
Algorithm Performance ◽  
New Approach ◽  
Shortest Path Routing

AbstractIn this paper we propose to use an iterative algorithm for optimizing the fixed-alternate shortest path routing in the dynamic routing and wavelength assignment (RWA) problem in wavelength routing optical networks. The algorithm performance is compared, in terms of blocking probability, with the Dijkstra and Yen traditional algorithms, as well as with the recently proposed best among the shortest routes (BSR) algorithm. The results suggest that it is feasible to choose an appropriate set of routes for each pair of nodes (source, destination), among the shortest paths and efficiently balance the network load. For all studied scenarios, the proposed heuristic achieved superior performance.

Sign in / Sign up

Export Citation Format

Share Document