Tight Bounds for Delay-Sensitive Aggregation

Abstract : This article studies the fundamental trade-off between delay and communication cost in networks. We consider an online optimization problem where nodes are organized in a tree topology. The nodes seek to minimize the time until the root is informed about the changes of their states and to use as few transmissions as possible. 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 Omega(min (h, c)). For chain networks, we prove a tight competitive ratio of Theta(min (root h, c)). Furthermore, we introduce a model for value-sensitive aggregation, where the cost depends on the number of transmissions and the error at the root.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990442
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:37:12 PM
Last modification on : Tuesday, March 5, 2019 - 9:32:52 AM
Document(s) archivé(s) le : Monday, April 10, 2017 - 10:02:19 PM

File

1346-4885-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990442, version 1

Collections

Citation

Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer. Tight Bounds for Delay-Sensitive Aggregation. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (1), pp.38-58. ⟨hal-00990442⟩

Share

Metrics

Record views

87

Files downloads

551