By Topic

Performance Evaluation of Fixed Routing Algorithms in All-Optical Networks under Non-uniform Traffic

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

4 Author(s)
Durães, G. ; Res. Group on Opt. Networks, Univ. Salvador UNIFACS, Salvador, Brazil ; Soares, A. ; Amazonas, J.R. ; Giozza, W.

Most works about all-optical circuit-switched WDM networks considers a shortest path algorithm for fixed routing, like the Dijkstra' algorithm. However, recently, two new algorithms, searching for better load balancing and presenting superior performance than Dijkstra's when submitted to an uniform traffic load, were proposed, the Restricted Routing Technique (RRT) and the Best among the Shortest Routes-(BSR). This work evaluates the performance of these algorithms under a non-uniform traffic load. For each topology studied were observed specific characteristics of the impact of the non-uniform traffic load for each routing algorithm. Overall, performance evaluation results showed that the algorithm BSR achieves for all topologies studied superior performance in terms of blocking probability and fairness.

Published in:

Systems and Networks Communications (ICSNC), 2010 Fifth International Conference on

Date of Conference:

22-27 Aug. 2010