17 search results - page 2 / 4 » Hardness and Approximation of Traffic Grooming |
TELETRAFFIC
2007
Springer
15 years 3 months ago
2007
Springer
Recent advances in telecommunication networks have allowed WDM to emerge as a viable solution to the ever-increasing demands of the Internet. In a wavelength-routed optical network...
SIROCCO
2010
14 years 11 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 ...
105
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
DSN
2007
IEEE
15 years 1 months ago
2007
IEEE
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...