Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

Authors:
Xavier Muñoz;Ignasi Sau
Affiliations:
Graph Theory and Combinatorics Group at Applied Mathematics IV, Department of UPC, Barcelona, Spain;Graph Theory and Combinatorics Group at Applied Mathematics IV, Department of UPC, Barcelona, Spain and Mascotte joint Project - INRIA/CNRS-I3S/UNSA - 2004, route des Lucioles, Sophia-Antipolis, F ...
Venue:
Graph-Theoretic Concepts in Computer Science
Year:
2008

Citing 10
Cited 1

Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

Journal of Combinatorial Theory Series B
Cost-effective traffic grooming in WDM rings

IEEE/ACM Transactions on Networking (TON)
Hardness and approximation of traffic grooming

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximating the traffic grooming problem in tree and star networks

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximating the traffic grooming problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Traffic grooming in WDM networks

IEEE Communications Magazine
Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic

IEEE Journal on Selected Areas in Communications
Grooming of arbitrary traffic in SONET/WDM BLSRs

IEEE Journal on Selected Areas in Communications
On optimal traffic grooming in WDM rings

IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future

IEEE Network: The Magazine of Global Internetworking

Traffic grooming in star networks via matching techniques

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely Add-Drop Multiplexers (ADMs for short). We consider the unidirectional ring topology with a generic grooming factor C , and in this case, in graph-theoretical terms, the traffic grooming problem consists in partitioning the edges of a request graph into subgraphs with at most C edges, while minimizing the total number of vertices of the decomposition. We consider the case when the request graph has bounded degree Δ , and our aim is to design a network (namely, place the ADMs at each node) being able to support any request graph with maximum degree at most Δ . The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and we solve the cases Δ = 2 (for all values of C ) and Δ = 3 (except the case C = 4). We also provide lower and upper bounds for the general case.