TU Berlin

Internet Network ArchitecturesAll Publications

Page Content

to Navigation

All publications

Tight Bounds for Delay-Sensitive Aggregation
Citation key OSW-TBDSA-08
Author Oswald, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger
Title of Book 27th ACM Symposium on Principles of Distributed Computing (PODC)
Pages 195–202
Year 2008
ISBN 978-1-59593-989-0
DOI http://dx.doi.org/10.1145/1400751.1400778
Location Toronto, Canada
Month August
Abstract 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.
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe