On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm

Abstract

Shortest path routing algorithms, such as Dijkstra's algorithm present an overload problem when used to define routes for ring topologies in networks that implement source routing. This paper presents the effects of Dijkstra's shortest path routing in the simulation and modeling of static source routed networks, in particular we evaluated the effect of this routing scheme in the performance of Optical Burst Switched (OBS) networks. A new static shortest path algorithm is presented and its performance compared with the standard shortest path algorithm, using two new metrics. We propose the use of this routing algorithm in network simulators instead of standard Dijkstra, as it produces more symmetric and balanced routes over the network links, thus producing results that are closer to real networks which implement a more dynamic routing.

A review of routing strategies for optical burst switched networks

“…As mentioned earlier, Garcia proposed two new static routing algorithms for OBS: extended Dijkstra algorithm and travel agency algorithm. According to them, the extended version of Dijkstra generates the shortest paths and therefore may allow a faster convergence to routing table equilibrium in dynamically routed meshed networks.…”

Resource Assignment for Fiber Optic Networks

“…Using wavelength division multiplexing (WDM) technology, spectrum usage has greatly increased by allowing multiple-line-rates and tra c grooming, which we discussed above. We have intro- to develop many heuristic algorithms for network design [38,39,40]. Although these algorithms are computationally simple, they often yield poor performance when the problem becomes complex and consideration cannot be given to all influencing factors.…”