A Better Memoryless Online Algorithm for FIFO Buffering Packets with Two Values
Fei Li

TL;DR
This paper introduces a simpler, memoryless online algorithm for FIFO packet buffering with two values, achieving a competitive ratio of 1.304, improving simplicity without sacrificing performance in a capacity-bounded setting.
Contribution
It presents a novel, simpler deterministic memoryless algorithm for FIFO buffering with two packet values, matching the best known competitive ratio without using marking bits.
Findings
Achieves a 1.304-competitive ratio with a simpler algorithm.
Does not use marking bits, simplifying implementation.
Preempts multiple low-value packets based on high-value packet presence.
Abstract
We consider scheduling packets with values in a capacity-bounded buffer in an online setting. In this model, there is a buffer with limited capacity . At any time, the buffer cannot accommodate more than packets. Packets arrive over time. Each packet is associated with a non-negative value. Packets leave the buffer only because they are either sent or dropped. Those packets that have left the buffer will not be reconsidered for delivery any more. In each time step, at most one packet in the buffer can be sent. The order in which the packets are sent should comply with the order of their arrival time. The objective is to maximize the total value of the packets sent in an online manner. In this paper, we study a variant of this FIFO buffering model in which a packet's value is either 1 or . We present a deterministic memoryless 1.304-competitive algorithm. This…
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 · Advanced Wireless Network Optimization · Caching and Content Delivery
