Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings

摘要

As an important technique, traffic grooming aggregates the traffic of multiple connections into a single wavelength channel, and significantly increases the utilization of bandwidth of wavelength channels. In this paper, for the problem of grooming multicast traffics in unidirectional SONET/WDM rings, an efficient approximation algorithms with approximation factor of 2lng + lnM + o(ln(M ·g)) for any given number of multicast requests M and grooming factor g is proposed.