Share Email Print

Proceedings Paper

Impairment aware routing with service differentiation in heterogeneous WDM networks
Author(s): Amornrat Jirattigalachote; Lena Wosinska; Paolo Monti; Kostas Katrinis; Anna Tzanakaki
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In transparent Wavelength Division Multiplexing (WDM) networks, the signal is transported from source to destination in the optical domain through all-optical channels, or lightpaths. A lightpath may traverse several fiber segments and optical components that in general degrade the optical signal. This effect introduces the need for considering physical layer impairments during the connection-provisioning phase. Physical layer impairments can be divided into linear and non-linear. Both types of impairments are highly dependent on the fiber characteristics, which in turn are sensitive to length, temperature and age. A close look at the fiber infrastructure of today's network operators reveals a situation where old and newly deployed fibers coexist in the network. This heterogeneous fiber plant presents a challenge. A tradeoff should be found between the QoS requirements of connection requests and the use of the available (old and new) network resources. This calls for a provisioning mechanism able to adapt to the various fiber composition scenarios. In parallel, given the need for service differentiation, the authors recently proposed an Impairment Constraint Based Routing (ICBR) algorithm, referred to as ICBR-Diff, supporting differentiation of services at the BER (Bit Error Rate) level in a network with a homogeneous fiber infrastructure. In this paper the ICBR-Diff algorithm is extended to heterogeneous network; particularly, it is evaluated in WDM networks with fiber links having varying Polarization Mode Dispersion characteristics, i.e., with old and new fiber coexisting. Simulation results show that the ICBR-Diff algorithm exhibits high adaptability in a heterogeneous fiber composition scenario. This translates into improved performance in terms of blocking probability, when compared to traditional impairment aware routing algorithms.

Paper Details

Date Published: 19 November 2009
PDF: 8 pages
Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 763307 (19 November 2009); doi: 10.1117/12.852076
Show Author Affiliations
Amornrat Jirattigalachote, KTH Royal Institute of Technology (Sweden)
Lena Wosinska, KTH Royal Institute of Technology (Sweden)
Paolo Monti, KTH Royal Institute of Technology (Sweden)
Kostas Katrinis, Athens Information Technology (Greece)
Anna Tzanakaki, Athens Information Technology (Greece)

Published in SPIE Proceedings Vol. 7633:
Network Architectures, Management, and Applications VII
Ken-ichi Sato; Lena Wosinska; Jing Wu; Yuefeng Ji, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?