260 search results - page 4 / 52 » Quorum placement in networks: minimizing network congestion |
STOC
2006
ACM
14 years 1 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
SIGCOMM
2012
ACM
11 years 10 months ago
2012
ACM
With the rapid growth of data centers, minimizing the queueing delay at network switches has been one of the key challenges. In this work, we analyze the shortcomings of the curre...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
