14 search results - page 2 / 3 » Tight Bounds for Delay-Sensitive Aggregation |
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
PE
2002
Springer
13 years 4 months ago
2002
Springer
We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem a...
WASA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
CN
2004
13 years 4 months ago
2004
The Differentiated Services architecture targets at providing scalable network Quality of Service by means of aggregate scheduling. However, the defined framework itself only give...