Metraipolis › archive › dc_a8692c8ef953

Online Multi-Level Aggregation with Per-Batch Maximum Delay — arXiv:2608.06796

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.06796
License (as archived)
CC0-1.0
Archived
2026-10-23T15:11:00.306Z
SHA-256 of the archived text
f2063c956d36d32f24432744780afb1e773afdc68d355c0e8e454d1fd8a881ff
Stable URL of this page
https://metraipolis.com/documento/dc_a8692c8ef953

How to cite

Online Multi-Level Aggregation with Per-Batch Maximum Delay — arXiv:2608.06796 — arXiv (en), https://arxiv.org/abs/2608.06796 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a8692c8ef953 (Metraipolis archive dc_a8692c8ef953, sha256 f2063c956d36d32f24432744780afb1e773afdc68d355c0e8e454d1fd8a881ff)
BibTeX
@misc{dca8692c8ef953,
  title = {Online Multi-Level Aggregation with Per-Batch Maximum Delay — arXiv:2608.06796},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.06796},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a8692c8ef953; sha256 f2063c956d36d32f24432744780afb1e773afdc68d355c0e8e454d1fd8a881ff},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06796. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study online multi-level aggregation on finite rooted trees with a per-batch maximum-delay objective. A service pays for a rooted subtree and for the maximum waiting time among the requests cleared by that service. We show that the offline optimum admits a consecutive-arrival-block normal form and can be computed by a polynomial-time dynamic program. The same dynamic program defines the deadlines of a family of online algorithms, which we call DP-Envelope. Its deterministic endpoint is $2$-competitive. Sampling one global parameter with density $e^\theta/(e-1)$ leads to an $e/(e-1)$-competitive randomized algorithm against an oblivious adversary. The deterministic guarantee matches the known fixed-node lower bound, and we prove a matching randomized lower bound. Thus, both guarantees are optimal on every nondegenerate rooted tree. We first develop the line metric as a warm-up, where the algorithm and its nested block partitions have a direct geometric interpretation. Finally, we show that the upper bounds extend to every realizable static service system with a normalized, nondecreasing, submodular joint service cost.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.06796 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-23T15:08:55.951Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).