Advertisement
Published in:
2009 | OriginalPaper | Chapter
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
Authors : Jiguo Yu, Suxia Cui, Guanghui Wang
Published in: Combinatorial Optimization and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 2
lng
+
lnM
+
o
(
ln
(
M
·
g
)) for any given number of multicast requests
M
and grooming factor
g
is proposed.