Novel strategies for sparse regenerator placement in translucent optical networks

Authors:
Daniel A. Chaves;Renan V. Carvalho;Helder A. Pereira;Carmelo J. Bastos-Filho;Joaquim F. Martins-Filho
Affiliations:
Polytechnic School of Pernambuco, University of Pernambuco, Recife, Brazil;Department of Electronics and Systems, Federal University of Pernambuco, Recife, Brazil;Polytechnic School of Pernambuco, University of Pernambuco, Recife, Brazil;Polytechnic School of Pernambuco, University of Pernambuco, Recife, Brazil;Department of Electronics and Systems, Federal University of Pernambuco, Recife, Brazil
Venue:
Photonic Network Communications
Year:
2012

Citing 8
Cited 1

Optical Networks: A Practical Perspective, 3rd Edition

Optical Networks: A Practical Perspective, 3rd Edition
Dynamic routing and wavelength assignment algorithms in wavelength division multiplexed translucent optical networks

Computer Communications
The regenerator location problem

Networks - Network Optimization (INOC 2007)
Cross optimization for RWA and regenerator placement in translucent WDM networks

ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Translucent network design from a CapEx/OpEx perspective

Photonic Network Communications
Impairment-aware path selection and regenerator placement in translucent optical networks

ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
On the complexity of the regenerator placement problem in optical networks

IEEE/ACM Transactions on Networking (TON)
Translucent optical networks: the way forward [Topics in Optical Communications]

IEEE Communications Magazine

QoS-driven multicast routing in sparse-splitting optical networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two strategies for sparse regenerator placement (RP) in translucent optical networks, named most used regenerator placement (MU-RP), and most simultaneous used regenerator placement (MSU-RP). Our proposals are compared to well known RP algorithms presented in literature for two different network topologies for different network loads, distribution of load along the networks and number of translucent nodes. MSU-RP presented remarkable results and outperformed all previous approaches in all cases, while MSU-RP obtained a slightly superior or similar performance when compared to previous approaches presented in the literature.