Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?

We study, from the perspective of competitive analysis, the trade-off between communication cost and delay cost, or simply the send-or-wait dilemma on a hierarchical rooted tree. The problem is an abstraction of the message aggregation problem on communication networks and an organizational problem in network hierarchies.We consider the most natural variant of the problem, the distributed asynchronous regime, and give tight (within a small additive constant) upper and lower bounds on the competitive ratio of the optimization problem. We also consider the centralized version of the problem, in which there is a central entity which remains updated about any incoming messages to the network and which can control the internal delivery of messages in the network. For the centralized setting, we combine a natural rent-to-buy strategy with prediction techniques to achieve the first constant competitive ratio algorithm for any non-trivial class of network topologies.

[1]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

[2]  Christos H. Papadimitriou,et al.  Computational Aspacts of Organization Theory (Extended Abstract) , 1996, Embedded Systems and Applications.

[3]  Christos H. Papadimitriou,et al.  Communication in hierarchies: explaining deadlines , 2000 .

[4]  B. R. Badrinath,et al.  Gathercast: the design and implementation of a programmable aggregation mechanism for the Internet , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[5]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[6]  Sally A. Goldman,et al.  On-line analysis of the TCP acknowledgment delay problem , 2001, JACM.

[7]  Christos H. Papadimitriou,et al.  The Origins of the Deadline: Optimizing Communication in Organizations , 2004 .

[8]  Sandy Irani,et al.  Competitive analysis of dynamic power management strategies for systems with multiple power saving states , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[9]  J. R. Freer.  Computer Communications and Networks , 1988 .

[10]  Reuven Cohen,et al.  Schemes for scheduling of control messages by hierarchical protocols , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Markus Hofmann,et al.  A Generic Concept for Large-Scale Multicast , 1996, International Zurich Seminar on Digital Communications.

[12]  Sandy Irani,et al.  Online strategies for dynamic power management in systems with multiple power-saving states , 2003, TECS.

[13]  Claire Mathieu,et al.  Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) , 2003, Algorithmica.

[14]  Joseph Naor,et al.  Control Message Aggregation in Group Communication Protocols , 2002, ICALP.