Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management

ArXi:2604.26349v1 Announce Type: cross We present a learning-augmented online algorithm for the preemptive FIFO buffer management problem, where packets arrive online to a finite-capacity buffer, must be transmitted in FIFO order, and the algorithm may preemptively discard buffered packets to accommodate future arrivals. Our algorithm simultaneously achieves 1-consistency, \eta-smoothness, and asymptotic \sqrt{3}-robustness, where \eta denotes the prediction error.