Traffic Grooming in Bidirectional WDM Ring Networks

Bermond, Jean‐Claude; Coudert, David; Mufioz, X.; Sau, Ignasi

doi:10.1109/icton.2006.248390

Cited by 7 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of designing networks that support TG efficiently is not an insignificant one and the solution may have a great impact on the cost of the network. TG's ability to support unicast traffic has been widely researched (Sahasrabuddhe and Mukherjee, 1999;Gerstel et al, 2000;Bermond et al, 2006).…”

Section: Introductionmentioning

confidence: 99%

Impact of the number of SAB on architectures that support unicast/multicast traffic in WDM networks

Sierra

Luis

Marzo

et al. 2010

IJCNDS

View full text Add to dashboard Cite

Optical transport networks (OTN) should be prepared to jointly handle both multicast and unicast traffic. Both opaque and transparent architectures are available to handle these types of traffic. Light-trees have been proposed as a way to transport information in a transparent manner. The light-tree however, may route unwanted information through some links while performing grooming of unicast and multicast traffic. To solve this problem we propose S/G light-tree with the goal of optimising the resources from the point of view of the number of wavelengths and available capacity. S/G light-tree uses detection systems (DS) and splitter and amplifier banks (SABs) to determine when unicast traffic should not be routed jointly with a multicast one by eliminating it optically from the link. This article proposes an online heuristic with grooming policies which allows for the analysis of the effects of the number of SABs on the blocking probability in OTN with dynamic traffic. Impact of the number of SAB on architectures 91

show abstract

Section: Introductionmentioning

confidence: 99%

Impact of the number of SAB on architectures that support unicast/multicast traffic in WDM networks

Sierra

Luis

Marzo

et al. 2010

IJCNDS

View full text Add to dashboard Cite

show abstract

“…As an important special case, the all-to-all traffic pattern attracts a lot of research attention as well. The all-to-all traffic pattern has been well studied for minimizing the total number of required SADMs [10], [15], [16], [17], [18], [19], [20]. For the all-to-all traffic pattern, the traffic graph is a complete graph.…”

Section: Introductionmentioning

confidence: 99%

A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks

Wang

2007

2007 16th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

In SONET/WDM networks, a wavelength channel is shared by multiplexed low-rate traffic demands. The multiplexing/de-multiplexing is known as traffic grooming and performed by SONET Add-Drop Multiplexers (SADM). The grooming factor, denoted by k, is the maximum number of low-rate traffic demands that can be multiplexed in one wavelength. Since SADMs are expensive, a key optimization problem in traffic grooming is to minimize the total number of required SADMs to satisfy the full connectivity for a given set of traffic demands. In this paper, we study traffic grooming from a different point of view. We consider a Min-Max optimization problem to minimize the number of SADMs at the network node where the number of required SADMs is the maximum over all nodes. We focus on the Unidirectional Path-Switched Ring networks with arbitrary duplex traffic demands. We prove the NP-hardness of this Min-Max optimization problem, and propose a linear time ( k+1 2 + 2)-approximation algorithm. We then show that the approximation algorithm achieves the worst case lower bound. We also study the all-to-all traffic pattern, and propose an algorithm achieving solutions only a constant factor away from the optimal ones. Extensive simulations are conducted as well to validate the performance of our algorithm.

show abstract

“…To apply network coding to single-hub ring networks, the hub acts as an encoder and generates n i − 1 code words for each group following the same coding scheme described in Fig.2 with coefficients from GF (2). The combinations of original data has the same rate as the original traffic, which is r i .…”

Section: ) Solutions With Network Codingmentioning

confidence: 99%

“…Among a number of network architectures, ring topologies drew significant attention in the research community due to the availability of legacy SONET equipment [12], [19], [20]. In ring networks, both all-to-all [1], [2], [11], [13], multicast [9], [14] and arbitrary [21] traffic scenarios have been studied. Most of the literature addressing this problem focuses on evaluating and reducing the dominant cost in the optical network, namely, Electronic Add-Drop Multiplexers (ADM), which is required at a node if it either has data to transmit to or receive from another counterpart.…”

Section: Introductionmentioning

confidence: 99%

Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding

Long

Kamal

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

Abstract-In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimizing the number of Line Terminating Equipment (LTE) on two types of unidirectional rings, namely, single-hub and unhubbed rings, as our objective. In single-hub rings, we investigate the minimum cost provisioning of uniform all-to-all traffic in two cases: where network coding is used to linearly combine data, and where it is not used and data is transmitted without coding. We generalize the service mode to many-to-many and evaluate the cost of provisioning. In un-hubbed ring, we propose a multi-hub approach to obtain the minimum cost provisioning in the case of all-to-all and many-to-many traffic. In each type of ring topology, two network scenarios are considered: first, the distinct communication groups in the ring are node-disjoint and second, the different groups may have common member nodes. From our numerical results, we find that under many-to-many traffic pattern for both scenarios, network coding can reduce the network cost by 10-20% in single-hub rings and 1-5% in un-hubbed rings in both network scenarios.

show abstract

Traffic Grooming in Bidirectional WDM Ring Networks

Cited by 7 publications

References 23 publications

Impact of the number of SAB on architectures that support unicast/multicast traffic in WDM networks

Impact of the number of SAB on architectures that support unicast/multicast traffic in WDM networks

A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks

Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding

Contact Info

Product

Resources

About