Link-State-Based Algorithms for Dynamic Routing in All-Optical Networks with Ring Topologies |
| |
Authors: | Rolland Mêwanou Samuel Pierre |
| |
Affiliation: | (1) Mobile Computing and Networking Research Laboratory (LARIM), Canada;(2) Department of Computer Engineering, école Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Quebec, Canada, H3C 3A7 |
| |
Abstract: | The increased usage of large bandwidth in optical networks raises the problems of efficient routing to allow these networks to deliver fast data transmission with low blocking probabilities. Due to limited optical buffering in optical switches and constraints of high switching speeds, data transmitted over optical networks must be routed without waiting queues along a path from source to destination. Moreover, in optical networks deprived of wavelength converters, it is necessary for each established path to transfer data from source to destination by using only one wavelength. To solve this NP-hard problem, many algorithms have been proposed for dynamic optical routing like Fixed-Paths Least Congested (FPLC) routing or Least Loaded Path Routing (LLR). This paper proposes two heuristic algorithms based on former algorithms to improve network throughput and reduce blocking probabilities of data transmitted in all-optical networks with regard to connection costs. We also introduce new criteria to estimate network congestion and choose better routing paths. Experimental results in ring networks show that both new algorithms achieve promising performance. |
| |
Keywords: | Optical networks Dynamic routing Routing and wavelength assignment WDM (wavelength division multiplexing) Link-state routing |
本文献已被 SpringerLink 等数据库收录! |
|