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

Authors:
Jiguo Yu;Suxia Cui;Guanghui Wang
Affiliations:
School of Computer Science, Qufu Normal University, Ri-zhao, China 276826;School of Computer Science, Qufu Normal University, Ri-zhao, China 276826;School of Mathematics and System Science, Shandong University, Jinan, China 250100 and Laboratoire de Mathématiques Appliquées aux Systèmes, Ecole Centrale Paris, Châtenay-Mala ...
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 12
Cited 0

An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings

IEEE/ACM Transactions on Networking (TON)
Cost-effective traffic grooming in WDM rings

IEEE/ACM Transactions on Networking (TON)
Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Approximating the traffic grooming problem in tree and star networks

Journal of Parallel and Distributed Computing
Approximating the traffic grooming problem

Journal of Discrete Algorithms
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Better bounds for minimizing SONET ADMs

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications
Lightpath arrangement in survivable rings to minimize the switching cost

IEEE Journal on Selected Areas in Communications
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks

IEEE Journal on Selected Areas in Communications
Grooming multicast traffic in unidirectional SONET/WDM rings

IEEE Journal on Selected Areas in Communications - Part Supplement

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.