Home Yen-BSR: A New Approach for the Choice of Routes in WDM Networks
Article
Licensed
Unlicensed Requires Authentication

Yen-BSR: A New Approach for the Choice of Routes in WDM Networks

  • A. F. Santos , R. C. Almeida and K. D. R. Assis EMAIL logo
Published/Copyright: August 21, 2014
Become an author with De Gruyter Brill

Abstract

In this paper we propose to use an iterative algorithm for optimizing the fixed-alternate shortest path routing in the dynamic routing and wavelength assignment (RWA) problem in wavelength routing optical networks. The algorithm performance is compared, in terms of blocking probability, with the Dijkstra and Yen traditional algorithms, as well as with the recently proposed best among the shortest routes (BSR) algorithm. The results suggest that it is feasible to choose an appropriate set of routes for each pair of nodes (source, destination), among the shortest paths and efficiently balance the network load. For all studied scenarios, the proposed heuristic achieved superior performance.

Received: 2014-3-6
Accepted: 2014-7-15
Published Online: 2014-8-21
Published in Print: 2014-12-1

©2014 by Walter de Gruyter Berlin/Munich/Boston

Downloaded on 11.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/joc-2014-0026/html
Scroll to top button