Sciweavers

17 search results - page 1 / 4
» Hardness and Approximation of Traffic Grooming
Sort
View
71
Voted
ISAAC
2007
Springer
95views Algorithms» more  ISAAC 2007»
15 years 7 months ago
Hardness and Approximation of Traffic Grooming
Omid Amini, Stéphane Pérennes, Ignas...
119
Voted
ICC
2009
IEEE
140views Communications» more  ICC 2009»
14 years 10 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...
95
Voted
ANSS
2005
IEEE
15 years 6 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. ...
86
Voted
JDA
2008
96views more  JDA 2008»
15 years 24 days ago
Approximating the traffic grooming problem
Michele Flammini, Luca Moscardelli, Mordechai Shal...
130
Voted
JNW
2007
118views more  JNW 2007»
15 years 21 days 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