Traffic grooming for minimizing wavelength usage in WDM networks
D Li, Z Sun, X Jia, S Makki - … Eleventh International Conference …, 2002 - ieeexplore.ieee.org
We consider the traffic grooming problem on general topology WDM networks. The problem
is: given a set of t connections and their routes, and the grooming factor g, to find an optimal …
is: given a set of t connections and their routes, and the grooming factor g, to find an optimal …
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring …
disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring …
Traffic grooming on general topology WDM networks
D Li, Z Sun, X Jia, K Makki - IEE Proceedings-Communications, 2003 - IET
The authors consider the traffic grooming problem on general topology WDM networks. The
problem is: given a set of t connections, their routes and the grooming factor g, find an …
problem is: given a set of t connections, their routes and the grooming factor g, find an …
Deterministic monotone algorithms for scheduling on related machines
P Ambrosio, V Auletta - International Workshop on Approximation and …, 2004 - Springer
We consider the problem of designing monotone deterministic algorithms for scheduling
tasks on related machines in order to minimize the makespan. Several recent papers …
tasks on related machines in order to minimize the makespan. Several recent papers …
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
R Dutta, S Huang, GN Rouskas - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
In wavelength division multiplexing (WDM) optical networks, the lightpath is the main
transport element. The set of lightpaths defines a logical topology. The logical topology …
transport element. The set of lightpaths defines a logical topology. The logical topology …
Traffic grooming on the path
In a WDM network, routing a request consists in assigning it a route in the physical network
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …
On optimal traffic grooming in WDM rings
R Dutta, GN Rouskas - ACM SIGMETRICS Performance Evaluation …, 2001 - dl.acm.org
We consider the problem of designing a virtual topology to minimize electronic routing, that
is, grooming traffic, in wavelength routed optical rings. We present a new framework …
is, grooming traffic, in wavelength routed optical rings. We present a new framework …
Traffic grooming on the path
In a WDM network, routing a request consists in assigning it a route in the physical network
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …
Approximating the traffic grooming problem
The problem of grooming is central in studies of optical networks. In graph-theoretic terms,
this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the …
this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the …
Grooming of arbitrary traffic in SONET/WDM rings
SONET add-drop multiplexers (ADMs) are the dominant cost in SONET/WDM rings. They
can potentially be reduced by optical bypass via wavelength add-drop multiplexers …
can potentially be reduced by optical bypass via wavelength add-drop multiplexers …