Distributed Dijkstra sparse placement routing algorithm for translucent optical networks |
| |
Authors: | Vladica Tintor Jovan Radunovi? |
| |
Affiliation: | (1) Department for Optical Communications, Faculty of Electrical Engineering, University of Belgrade, Bulevar kralja Aleksandra 73, 11000 Belgrade, Serbia |
| |
Abstract: | In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks.
In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal
quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network.
In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary
to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully
receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage
of the network capacity resources. We apply a distributed Dijkstra routing algorithm which dynamically changes weights of
links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with
commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the
network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in
the network with electronic regenerations in order to have the same performance as in an opaque network.
|
| |
Keywords: | Translucent optical networks Routing assignment Dijkstra algorithm Wavelength division multiplex Sparse regeneration problem |
本文献已被 SpringerLink 等数据库收录! |
|