By Topic

A novel fairness based criticality avoidance routing algorithm for wavelength routed 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
$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

3 Author(s)
S. R. Pramod ; Opt. Networks Res. Center, Ottawa Univ., Ont., Canada ; S. Siddiqui ; H. T. Mouftah

In conventional RWA algorithms the shorter lightpaths fragment the available wavelengths resulting in a higher blocking probability for longer hopcount lightpaths. In this paper we study a novel routing algorithm, which uses traffic classification to classify different hop count connection requests to provide fairness among short and long hop count traffic requests. Also our routing algorithm uses the link criticality information which is related to the number of available wavelengths on a link to provide load balancing over all the links in a network.

Published in:

2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)

Date of Conference:

14-17 Aug. 2005