A Simple Scheme for Routing and Wavelength Assignment in WDM Networks
Khaled Maamoun and Hussein Mouftah
2008 Spring Simulation Multiconference (SpringSim'08)- Poster Sessions (SCS-Poster sessions 2008)
Ottawa, Canada, April 14 - 17, 2008
Summary
Routing and wavelength assignment (RWA) is an important and difficult topic in wavelength division multiplexing (WDM) networks if the node blocking probability is taken into consideration. Here we introduce a new method aimed at minimizing this problem by finding the most suitable route for a coming connection request based on blocking probability estimation at every node. This novel and simple method is achieved by transforming the node-weights to link-weights and finding the route on the new transformed network using the well known Dijkstra’s algorithm to find the shortest path.
|
START
Conference Manager (V2.54.5)
|