TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Online computation and competitive analysis
Online computation and competitive analysis
On-line analysis of the TCP acknowledgment delay problem
Journal of the ACM (JACM)
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic TCP acknowledgement: penalizing long delays
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Control Message Aggregation in Group Communication Protocols
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Computational Aspacts of Organization Theory (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Latency constrained aggregation in sensor networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Data aggregation in sensor networks: balancing communication and delay costs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Brief announcement: delay or deliver dilemma in organization networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
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 Omega(min(h,c)). For chain networks, we prove a tight competitive ratio of Theta(min(sqrt{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.