28 search results - page 4 / 6 » Approximation Algorithms for Traffic Grooming in WDM Rings |
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
APPROX
1998
Springer
13 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
SIROCCO
2010
13 years 8 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 ...
CN
1999
13 years 6 months ago
1999
We describe a WDM-based optical access network architecture for providing broadband Internet services. The architecture uses a passive collection and distribution network and a co...
COMSWARE
2007
IEEE
14 years 28 days ago
2007
IEEE
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...