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

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.