Skip to Main Content
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.
Date of Conference: 14-18 June 2009