By Topic

Routing and Wavelength Assignment in Optical Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31.0 $31.0
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The algorithms presented in this chapter assume that either wavelength conversion is available at all switches or not available at any switch. The algorithms assume that the wavelength sharing constraint needs to be satisfied. The Extended Bellman-Ford (EBF) algorithm is extended in the chapter in order to incorporate the wavelength sharing and wavelength continuity constraints. The authors propose modified versions of the algorithms in the Enlightened system for continuous time model. These algorithms are called Modified Switch Path First (MSPF) and Modified Switch Window First (MSWF). The chapter presents a new network model that can emulate the existing full-conversion algorithms when only a subset of nodes have a wavelength converter. The authors demonstrate the utility of this approach using the EBF and k-Alternative Path (k-Path) algorithms. The chapter evaluates the algorithms on three performances metrics: blocking probability, average start time and scheduling overhead.