630 search results - page 17 / 126 » Hardness results for approximating the bandwidth |
STOC
2007
ACM
15 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
102
Voted
ANCS
2008
ACM
14 years 11 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
86
Voted
MMNS
2003
14 years 11 months ago
2003
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
CAAN
2004
Springer
15 years 2 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— We consider a multi-class queueing system operating under the Discriminatory Processor-Sharing (DPS) discipline. The DPS discipline provides a natural approach for mode...