Sciweavers

17 search results - page 1 / 4
» Hardness and Approximation of Traffic Grooming
Sort
View
ISAAC
2007
Springer
95views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Hardness and Approximation of Traffic Grooming
Omid Amini, Stéphane Pérennes, Ignas...
ICC
2009
IEEE
140views Communications» more  ICC 2009»
13 years 6 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
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 "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
ANSS
2005
IEEE
14 years 2 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. ...
JDA
2008
96views more  JDA 2008»
13 years 8 months ago
Approximating the traffic grooming problem
Michele Flammini, Luca Moscardelli, Mordechai Shal...
JNW
2007
118views more  JNW 2007»
13 years 8 months ago
Alternate Routing in Tandem Traffic-Groomed Optical Networks
— Recent advances in telecommunication networks have allowed WDM to emerge as a viable solution to the ever-increasing demands of the Internet. Because these networks carry large...
Alicia Nicki Washington, Harry G. Perros