Improving the routing performance in optical networks by an optimised BFS algorithm

Abstract

The procedure of routing and wavelength assignment became a limiting factor for new applications in Optical Networks (ONs) due to the faster dynamic and greater unpredictability of service requests. The need for quick service recovery in the event of failures is also a crucial aspect which depends on this procedure. The present work proposes a new assignment of alternative routes able to comply to any data service request in ONs. The assignment procedure is based on the distinction by low correlation between paths, on the available bandwidth of different paths and on the latency for the establishment of communication between network nodes. In such context, an improvement of the Breadth-First Search (BFS) algorithm is proposed and tested with parameters from a real-world system, resulting in a good performance to find alternative routes and to classify them according to the best score obtainable, independently of the source or destiny nodes.