Cart (Loading....) | Create Account
Close category search window
 

Spare capacity allocation for WDM mesh networks with partial wavelength conversion capacity

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 $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)
Pin-Han Ho ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Mouftah, H.T.

The paper studies the spare capacity allocation problem in WDM mesh networks with partial wavelength conversion capacity. The proposed approach is characterized by the following two factors: (1) partial wavelength conversion capability is considered and formulated in the allocation process, in which a scheme dedicated to WDM networks is demonstrated; (2) the adoption of the short leap shared protection framework (SLSP) can improve the capacity-efficiency by increasing the resource sharing and constrain the restoration time by reducing the size of each protection domain (i.e., a self-healing unit that can perform local restoration). We formulate the protection domain allocation problem into a modified Dijkstra's algorithm, where the transferred graph of cycles is proposed. To assign wavelength to the spare channels, a novel tree structure of the wavelength graph is used. The task of spare capacity allocation is sequentially performed for the working lightpaths in the network. The proposed algorithm is verified through simulation on five networks with different topologies and compared with three reported schemes, namely SLSP-R, NS and SSR (successive survivable routing). We show that the proposed algorithm outperforms the other approaches while taking less computation time, which is tractable for a dynamic configuration.

Published in:

High Performance Switching and Routing, 2003, HPSR. Workshop on

Date of Conference:

24-27 June 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.