Tight Bounds for Delay-Sensitive Aggregation

9 years 1 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An optimization problem is considered where nodes are organized in a tree topology. The nodes seek to minimize the time until the root is informed about their states and to use as few transmissions as possible at the same time. We derive an upper bound on the competitive ratio of O(min(h, c)) where h is the tree's height, and c is the transmission cost per edge. Moreover, we prove that this upper bound is tight in the sense that any oblivious algorithm has a ratio of at least (min(h, c)). For chain networks, we prove a tight competitive ratio of (min( h, c)). Furthermore, the paper introduces a new model for online event aggregation where the importance of an event depends on its difference to previous events. Categories and Subject Descriptors C.2.4 [Distributed Systems] General Terms Algorithms, Theory Ke...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh
Added 02 Mar 2011
Updated 02 Mar 2011
Type Journal
Year 2010
Authors Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer
Comments (0)