Routing in all optical networks using recursive state space technique

TL;DR

This paper proposes a recursive state space technique for routing in all-optical networks that minimizes failure effects and improves reliability using Kalman Filter-based algorithms for efficient wavelength assignment and route selection.

Contribution

It introduces a novel MRPR algorithm that enhances route reliability and reduces reconfiguration probability in optical networks using recursive state space and Kalman Filter techniques.

Findings

Reduced network failure impact and blocking probability

Efficient wavelength assignment with Kalman Filter

Improved route reliability and reconfiguration efficiency

Abstract

In this paper, we have minimized the effects of failures on network performance, by using suitable Routing and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light path(LP) established efficiently considering all possible requests.