Loading…

Comparing OSNR based policies for an adaptive-alternative IA-RWA algorithm applied to all-optical networks

We propose two policies to select the route for an adaptive-alternative routing algorithm for all-optical networks. We use the NrPSR to find the Nr routes with lower cost for a given source-destination pair according to a cost function expanded in a power series (PSR) in which the coefficients are d...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Microwaves, Optoelectronics and Electromagnetic Applications Optoelectronics and Electromagnetic Applications, 2013-12, Vol.12 (2), p.694-706
Main Authors: Bastos-Filho, Carmelo J. A., Silva, Rodrigo C. L., Chaves, Daniel A. R., Xavier, André V. S., Martins-Filho, Joaquim F.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose two policies to select the route for an adaptive-alternative routing algorithm for all-optical networks. We use the NrPSR to find the Nr routes with lower cost for a given source-destination pair according to a cost function expanded in a power series (PSR) in which the coefficients are determined by a Particle Swarm Optimizer (PSO). The selected route to attend to the call request can be chosen among the Nr found routes depending on the adopted policy. In the first proposal, named NrPSR(OSNR JE), we select the route that presents the lower OSNR that attends the Quality of Transmission requirements. In the second approach, named NrPSR(OSNR MAX), we select the route that presents the higher OSNR. In our simulations we considered some physical layer effects, such as: ASE noise generation, Optical Amplifier gain and ASE saturation and OXC crosstalk. We compared the performance of our proposed policies to others previous proposed policies for the NrPSR and other well known algorithms described in the literature. NrPSR(OSNR JE) outperformed all other routing algorithms.
ISSN:2179-1074
2179-1074
DOI:10.1590/S2179-10742013000200036