O(depth)-Competitive Algorithm for Online Multi-level Aggregation

We consider a multi-level aggregation problem in a weighted rooted tree, studied recently by Bienkowski et al. [7]. In this problem requests arrive over time at the nodes of the tree, and each request specifies a deadline. A request is served by sending it to the root before its deadline at a cost equal to the weight of the path from the node in which it resides to the root. However, requests from different nodes can be aggregated, and served together, so as to save on cost. The cost of serving an aggregated set of requests is equal to the weight of the subtree spanning the nodes in which the requests reside. Thus, the problem is to find a competitive online aggregation algorithm that minimizes the total cost of the aggregated requests. This problem arises naturally in many scenarios, including multicasting, supply-chain management and sensor networks. It is also related to the well studied TCP-acknowledgement problem and the online joint replenishment problem. We present an online O(D)-competitive algorithm for the problem, where D is the depth, or number of levels, of the aggregation tree. This result improves upon the D22D-competitive algorithm obtained recently by Bienkowski et al. [7].

[1]  Marek Chrobak,et al.  Online Control Message Aggregation in Chain Networks , 2013, WADS.

[2]  Alexander Souza,et al.  Approximating the Joint replenishment Problem with Deadlines , 2009, Discret. Math. Algorithms Appl..

[3]  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).

[4]  Sally A. Goldman,et al.  TCP dynamic acknowledgment delay (extended abstract): theory and practice , 1998, STOC '98.

[5]  A. Kimms.  Multi-Level Lot Sizing and Scheduling: Methods for Capacitated, Dynamic, and Deterministic Models , 1996 .

[6]  Marek Chrobak,et al.  Online Algorithms for Multi-Level Aggregation , 2015, ESA.

[7]  Leen Stougie,et al.  Latency-constrained aggregation in sensor networks , 2006, TALG.

[8]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[9]  Niv Buchbinder,et al.  Online make-to-order joint replenishment model: primal dual competitive algorithms , 2008, SODA '08.

[10]  Marek Chrobak,et al.  Better Approximation Bounds for the Joint Replenishment Problem , 2014, SODA.

[11]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[12]  David B. Shmoys,et al.  Primal-dual algorithms for deterministic inventory problems , 2004, STOC '04.

[13]  M. H. Wagner,et al.  Dynamic Lot Size Models for Multi-Stage Assembly Systems , 1973 .

[14]  E. Arkin,et al.  Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .

[15]  Marek Chrobak,et al.  Approximation algorithms for the joint replenishment problem with deadlines , 2015, J. Sched..

[16]  David B. Shmoys,et al.  A constant approximation algorithm for the one-warehouse multi-retailer problem , 2005, SODA '05.

[17]  Elias Koutsoupias,et al.  Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? , 2004, SODA '04.

[18]  Reuven Cohen,et al.  Schemes for scheduling control messages by hierarchical protocols , 2001, Comput. Commun..

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

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

[21]  Joseph Naor,et al.  A Polylogarithmic-Competitive Algorithm for the k-Server Problem , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

[23]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[24]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[26]  Maxim Sviridenko,et al.  Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem , 2006, APPROX-RANDOM.