Competitive analysis of organization networks or multicast acknowledgement: how much to wait?

Authors:
Carlos Brito;Elias Koutsoupias;Shailesh Vaya
Affiliations:
University of California Los Angeles, Los Angeles;University of California Los Angeles, Los Angeles;University of California Los Angeles, Los Angeles
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 8
Cited 8

Amortized efficiency of list update and paging rules

Communications of the ACM
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
Control Message Aggregation in Group Communication Protocols

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Computational Aspacts of Organization Theory (Extended Abstract)

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A Generic Concept for Large-Scale Multicast

IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
Competitive Analysis of Dynamic Power Management Strategies for Systems with Multiple Power Savings States

Proceedings of the conference on Design, automation and test in Europe
Schemes for scheduling control messages by hierarchical protocols

Computer Communications

Three dozen papers on online algorithms

ACM SIGACT News
Latency constrained aggregation in sensor networks

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Tight bounds for delay-sensitive aggregation

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Data aggregation in sensor networks: Balancing communication and delay costs

Theoretical Computer Science
Latency Constrained Aggregation in Chain Networks Admits a PTAS

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Latency-constrained aggregation in sensor networks

ACM Transactions on Algorithms (TALG)
Data aggregation in sensor networks: balancing communication and delay costs

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Approximation algorithms for the joint replenishment problem with deadlines

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the send-or-wait dilemma) on a hierarchy (rooted tree). The problem is an abstraction of the message aggregation problem on communication networks and the organizational problem in network hierarchies. We consider the most natural variant of the problem, the distributed asynchronous regime, and give tight (within an additive constant) upper and lower bounds of the competitive ratio.We also consider the centralized version of the problem, where we combine the natural rent-to-buy strategy with prediction techniques to achieve the first constant competitive ratio algorithm for any non-trivial class of network topologies.