Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items
Julien Robert, Nicolas Schabanel

TL;DR
This paper introduces a simple, fair, and effective pull-based broadcast algorithm that minimizes user latency in wireless data dissemination, especially considering request dependencies, with proven competitive performance guarantees.
Contribution
It presents a novel $(4+\epsilon)$-speed, $O(1+1/\epsilon^2)$-competitive algorithm for dependent requests, ensuring fairness and robustness without protocol modifications.
Findings
Algorithm is simple to implement and non-clairvoyant.
Guarantees good performance despite request dependencies.
Ensures fairness to users, preventing starvation.
Abstract
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently observed that the average service time of broadcast systems can be considerably improved by taking into consideration existing correlations between requests. We study a pull-based data broadcast system where users request possibly overlapping sets of items; a request is served when all its requested items are downloaded. We aim at minimizing the average user perceived latency, i.e. the average flow time of the requests. We first show that any algorithm that ignores the dependencies can yield arbitrary bad performances with respect to the optimum even if it is given arbitrary extra resources. We then design a -speed -competitive algorithm for this setting that consists in 1)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Distributed systems and fault tolerance · Distributed and Parallel Computing Systems
