A Minimum Reconfiguration Probability Routing Algorithm for RWA in All-Optical Networks

TL;DR

This paper introduces the MRPR algorithm for all-optical networks, which minimizes reconfiguration failures by selecting reliable routes and efficiently assigning wavelengths, outperforming existing routing methods.

Contribution

The paper proposes the MRPR algorithm that reduces reconfiguration probability and computational complexity using Kalman Filter techniques, improving reliability in optical networks.

Findings

MRPR reduces reconfiguration failures compared to AUR and LLR.

Kalman Filter techniques lower computational complexity.

MRPR enhances network reliability under varying load conditions.

Abstract

In this paper, we present a detailed study of Minimum Reconfiguration Probability Routing (MRPR) algorithm, and its performance evaluation in comparison with Adaptive unconstrained routing (AUR) and Least Loaded routing (LLR) algorithms. We have minimized the effects of failures on link and router failure in the network under changing load conditions, we assess the probability of service and number of light path failures due to link or route failure on Wavelength Interchange(WI) network. The computation complexity is reduced by using Kalman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm selects most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.