Sciweavers

74 search results - page 2 / 15
» Approximating the traffic grooming problem
Sort
View
NETWORKING
2004
13 years 7 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
JSAC
2006
157views more  JSAC 2006»
13 years 5 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
BROADNETS
2006
IEEE
13 years 9 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
ANSS
2005
IEEE
13 years 11 months ago
Approximation Techniques for the Analysis of Large Traffic-Groomed Tandem Optical Networks
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
Alicia Nicki Washington, Chih-Chieh Hsu, Harry G. ...
ISAAC
2007
Springer
95views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Hardness and Approximation of Traffic Grooming
Omid Amini, Stéphane Pérennes, Ignas...