On-line dynamic traffic grooming algorithms for WDM mesh networks

Authors:
André C. Drummond;Nelson L. S. Da Fonseca
Affiliations:
Institute of Computing, State University of Campinas, Brazil;Institute of Computing, State University of Campinas, Brazil
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 3
Cited 1

Blocking analysis of dynamic traffic grooming in mesh WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Dynamic Traffic Grooming in Optical Networks with Wavelength Conversion

IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Resource provisioning for multigranular traffic flows in multilayer networks

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic grooming in Wavelength Division Multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. On-line solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network partially leading to scalable solutions. Previous algorithms based on such type of auxiliary graph produce unfair distribution of resources. This paper introduces a novel algorithm and two of its variants, which are scalable and produce low blocking and fair distribution of resources.