Aug 8, 2007 · In this paper we study the problem of efficient grooming of given non-uniform multicast traffic demands on a unidirectional SONET/WDM ring.

Abstract—In this paper we study the problem of efficient grooming of given non-uniform multicast traffic demands on a unidirectional SONET/WDM ring.

In this paper we study the problem of efficient grooming of given non-uniform multicast traffic demands on a unidirectional SONET/WDM ring.

In this paper, for the problem of grooming multicast traffics in unidirectional SONET/WDM rings, an efficient approximation algorithms with approximation factor ...

ABSTRACT. This paper considers the problem of grooming multicast traffic in WDM networks, with arbitrary mesh topologies.

Abstract. As an important technique, traffic grooming aggregates the traffic of multiple connections into a single wavelength channel, and sig-.

We develop traffic grooming algorithms for unidirectional SONET/WDM ring networks. The objective is to assign calls to wavelengths in a way that minimizes ...

Grooming multicast traffic in unidirectional SONET/WDM rings. Part Supplement. In this paper we study the problem of efficient grooming of given non-uniform ...

We also present new polynomial-time traffic grooming algorithms for minimizing the maximum electronic port cost in both unidirectional and bidirectional rings.

Bibliographic details on Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.