Implementation of Dynamic Programing to Find All Pairs Shortest Path on Fibre Optics Networks to Produced Optimized Routing and Virtual Topology

Abstract

Optical fibre has been the main choice of communication medium for long-haul networks because of its low transmission loss and high capacity of the data rate. A fibre cable can transmit many channels simultaneously using wavelength Division multiplexing (WDM) technology. This makes possible to establish many different virtual topologies on top of the physical topology. In this paper, dynamic programming model has been developed to produce different sets of traffic matrices for finding shortest path from each source to different destinations. On which existing Heuristic logical design Algorithm (HLDA) is implemented to find shortest path by varying number of optical transceivers. A study is made on stage wise 4-node, 7-node and 14-node NSFNET traffic matrices and comparative study has been done on utilisation of Average Weighted hops and Wavelength.