Tight Bounds for Delay-Sensitive Aggregation - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Tight Bounds for Delay-Sensitive Aggregation


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.
Fichier principal
Vignette du fichier
1346-4885-1-PB.pdf (389.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00990442 , version 1 (13-05-2014)



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


78 View
1002 Download



Gmail Mastodon Facebook X LinkedIn More