An Optimized Breadth-first Search Algorithm for Routing in Optical Access Networks

Abstract

This work consists in the application of an optimized Breadth-first search (BFS) algorithm to select a couple of link-and-node-disjoint shortest-path between the two most remote users within an optical access network. Our results showed that while the average execution time of the original BFS algorithm was 12.23 seconds that of the optimized BFS was 10.80 seconds, which means a reduction of 11.69 percent of the average computing time. In future works we intend to apply the modified BFS algorithm to a generic optical network and evaluate its performance for different mesh size, node concentration and random link arrangement.