By Topic

Path selection methods with multiple constraints in service-guaranteed WDM 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
$33 $13
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)
A. Jukan ; Fac. of Electr. Eng. & Inf. Technol., Vienna Univ. of Technol., Austria ; G. Franzl

We propose a new approach to constraint-based path selection for dynamic routing and wavelength allocation in optical networks based on WDM. Our approach considers service-specific path quality attributes, such as physical layer impairments, reliability, policy, and traffic conditions, and uses a flooding-based transfer of path information messages from source to destination to find multiple feasible paths. It is fully decentralized, as it uses local network state information. To better understand how multiple constraints impact the efficiency of wavelength routing, and consequently provision the service guarantees, we specifically focus on electronic regenerators that, while being widely considered as the basic building blocks for optical switching nodes, are likely to impose conflicting constraints on routing. For example, electronic regenerators extend the optical reach and could perform wavelength shifting, but also induce impairments, such as delays and operational costs. The question for constraint-based routing is how to account for these conflicting effects. To validate the network modeling, a wide range of networking scenarios are simulated, such as ring, mesh and interconnections of all-optical networks with electronic gateways. For all these scenarios, our approach is shown to efficiently accommodate multiple, conflicting routing metrics related to different services and network architectures.

Published in:

IEEE/ACM Transactions on Networking  (Volume:12 ,  Issue: 1 )