2009 | OriginalPaper | Buchkapitel
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
verfasst von : Jiguo Yu, Suxia Cui, Guanghui Wang
Erschienen in: Combinatorial Optimization and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.