A multicost approach to online impairment-aware RWA

Authors:
K. Christodoulopoulos;K. Manousakis;E. A. Varvarigos;M. Angelou;I. Tomkos
Affiliations:
Computer Engineering and Informatics Dep., University of Patras, Patra, Greece;Computer Engineering and Informatics Dep., University of Patras, Patra, Greece;Computer Engineering and Informatics Dep., University of Patras, Patra, Greece;Athens Information Technology, Athens, Greece;Athens Information Technology, Athens, Greece
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 2

Optical networks: a practical perspective

Optical networks: a practical perspective
Path selection methods with multiple constraints in service-guaranteed WDM networks

IEEE/ACM Transactions on Networking (TON)
Routing and scheduling connections in networks that support advance reservations

Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Multi-parametric online RWA based on impairment generating sources

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Indirect and direct multicost algorithms for online impairment-aware RWA

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design and implement a multicost impairment-aware routing and wavelength assignment algorithm for online traffic. In transparent optical networks the quality of a transmission degrades due to physical layer impairments. To serve a connection, the proposed algorithm finds a path and a free wavelength (a lightpath) that has acceptable signal quality performance by estimating a quality of transmission measure, called the Q factor. We take into account channel utilization in the network, which changes as new connections are established or released, in order to calculate the noise variances that correspond to physical impairments on the links. These, along with the time invariant eye impairment penalties of all candidate network paths, form the inputs to the algorithm. The multicost algorithm finds a set of so called non-dominated Q paths from the given source to the given destination. Various objective functions are then evaluated in order to choose the optimal lightpath to serve the connection. The proposed algorithm combines the strength of multicost optimization with low execution time, making it appropriate for serving online connections.