1691 search results - page 137 / 339 » The Delayed k-Server Problem |
149
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
158
click to vote
WIOPT
2011
IEEE
14 years 7 months ago
2011
IEEE
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
114
click to vote
PRDC
2006
IEEE
15 years 10 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
127
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
137
click to vote
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content...