Abstract
As optical wdm networks are becoming the backbone building blocks of twenty first century’s networks due to their capacity of carrying huge bandwidth. So evaluating the performance of optical wdm networks and optimizing it, is need of the day. For this the problem of routing and wavelength assignment is of significance importance. Researchers have done extensive simulations for both static and dynamic routing and wavelength problem. In this paper we have presented various algorithms for solving the dynamic RWA problem in literature.Also we have prepared a optical wdm network using which RWA problem is analysed.
Highlights
2.1 Fixed Path RoutingIt uses only one route from source end to destination .In this approach the network resources are not properly utilized.[1]2.2 Alternate Path Routing ICAET-2016It uses alternate paths from source to a destination .If the first is unavailable second path is used.[15]In dynamic routing in DRW1 algorithm no weight assignment is done all links have same weight
In this paper we have presented the review of various techniques available for solving dynamic routing and wavelength problem
2.3 Fixed alternate shortest Path routing with least Priority wavelength assignment Strategies
Summary
It uses alternate paths from source to a destination .If the first is unavailable second path is used.[15]. As the request arrived it is routed to the nodes having less weight if wavelength is available if not request is routed through higher weight nodes and the process is repeated. 2.3 Fixed alternate shortest Path routing with least Priority wavelength assignment Strategies In this algorithm the wavelength information table is made according to the use of the each wavelength in the network the lightpath is set on shortest or alternate shortest path with the least used wavelength if available else the route call is blocked.[16]
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have