Online Packet Scheduling with Bounded Delay and Lookahead
Martin B\"ohm, Marek Chrobak, {\L}ukasz Je\.z, Fei Li, Ji\v{r}\'i, Sgall, Pavel Vesel\'y

TL;DR
This paper advances online packet scheduling algorithms with bounded delay and lookahead, achieving new competitive ratios for specific instance bounds and variants, including 4-bounded and 2-bounded with 1-lookahead.
Contribution
It introduces a $$-competitive algorithm for 4-bounded instances and a near-optimal algorithm for 2-bounded instances with 1-lookahead, improving previous bounds.
Findings
A $$-competitive algorithm for 4-bounded instances.
An online algorithm with ratio approximately 1.303 for 2-bounded with 1-lookahead.
A lower bound of approximately 1.281 for the same setting.
Abstract
We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the literature, yet its optimal competitive ratio remains unknown: the best upper bound is , still quite far from the best lower bound of . In the variant of BDPS with -bounded instances, each packet can be scheduled in at most consecutive slots, starting at its release time. The lower bound of applies even to the special case of -bounded instances, and a -competitive algorithm for -bounded instances was given in Chin et al. Improving that result, and addressing a…
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.
