74 search results - page 1 / 15 » Approximating the traffic grooming problem |
JDA
2008
13 years 4 months ago
2008
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
BROADNETS
2006
IEEE
13 years 8 months ago
2006
IEEE
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
SIROCCO
2010
13 years 6 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
NETWORKS
2008
13 years 4 months ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...