249 search results - page 2 / 50 » Approximating the Bandwidth of Caterpillars |
INFOCOM
2009
IEEE
14 years 27 days ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
IWPEC
2009
Springer
14 years 24 days ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
APPROX
1998
Springer
13 years 10 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
INFOCOM
2000
IEEE
13 years 10 months ago
2000
IEEE
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
RTAS
2010
IEEE
13 years 4 months ago
2010
IEEE
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...