Improving the routing performance in optical networks by an optimised BFS algorithm Online publication date: Tue, 20-Jun-2023
by Juliano Antonio Da Silva; Djeisson Hoffmann Thomas; Fernando Cesar De Castro
International Journal of Computer Applications in Technology (IJCAT), Vol. 71, No. 2, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook