Connection Level Active Rerouting in WDM Mesh Networks with Traffic Grooming Capability

Ho, Quang-Dzung; Lee, Man-Seop

doi:10.1109/icc.2006.255131

Cited by 5 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [35] and [36], Ho et al developed a rerouting approach which actively packs existing connections of different bandwidth granularities. Basically different from previously proposed active rerouting that blindly attempts to reroute many existing lightpaths, the proposed algorithm at first estimates the potential resource gain of each existing connection and then reroutes only a small number of candidate connections that may give the largest gain.…”

Section: Related Workmentioning

confidence: 99%

Efficient Traffic Engineering Strategies for Optimizing Network Throughput in WDM All-Optical Networks

Koubàa¹,

Amdouni²,

Aguili³

2015

IJCNIS

View full text Add to dashboard Cite

In this paper we investigate traffic-engineering issues in Wavelength Division Multiplexing (WDM) alloptical networks. In such networks, the wavelength continuity constraint along with the wavelength clash constraint, lead to poor network performances when dealing with the lightpath provisioning problem. The impact of these constraints is especially severe when traffic demands are unpredictable and characterized by random arrivals and departures. In order to alleviate the impact of these constraints, we propose to employ intentional/active rerouting. Active lightpath rerouting is to intentionally reroute already established lightpaths, during their life period, so as to achieve a better blocking performance. We here assume that due to the large geographic area an optical WDM network can cover, upgrading such a network to support the huge demand for network bandwidth can be costly. Thereby, it is extremely important for network operators to apply traffic-engineering strategies to cost-effectively optimize network throughput. Two new routing and wavelength assignment (RWA) algorithms applying intentional rerouting are proposed. Both algorithms dynamically reroute some already established lightpaths from longer paths to vacant shorter ones so as to reduce the network resources consumption and hence improve the network throughput. The first algorithm, namely, Timer-Based Active Lightpath Rerouting (TB-ALR) initiates the rerouting procedure every time a timer expires. The second algorithm, namely, Sequential Routing with Active Lightpath Rerouting (SeqRwALR) initiates the rerouting procedure when a connection leaves and its lightpaths are released. To the best of our knowledge, our global approach has not already been investigated in the literature. Simulation results show that the proposed active rerouting algorithms yield much lower connection rejection ratios than rerouting algorithms previously presented in the literature while rerouting a small number of already established lightpaths. By rerouting a small number of existing lightpaths, we hope that the disruption period incurred due to rerouting is minimized.

show abstract

Section: Related Workmentioning

confidence: 99%