Sciweavers

1691 search results - page 137 / 339
» The Delayed k-Server Problem
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—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 ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
WIOPT
2011
IEEE
13 years 1 months ago
LIFO-Backpressure achieves near optimal utility-delay tradeoff
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...
Longbo Huang, Scott Moeller, Michael J. Neely, Bha...
PRDC
2006
IEEE
14 years 4 months ago
Leader Election in the Timed Finite Average Response Time Model
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...
Christof Fetzer, Martin Süßkraut
SAC
2003
ACM
14 years 3 months ago
Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Mili...
EUROPAR
2003
Springer
14 years 3 months ago
Distributed Multimedia Streaming over Peer-to-Peer Networks
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...
Jin B. Kwon, Heon Young Yeom