Routing in all optical networks using recursive state space technique
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.