New Competitiveness Bounds for the Shared Memory Switch

Abstract

We consider one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first models studied by competitive analysis, with the Longest Queue Drop (LQD) buffer management policy shown to be at least √ 2-and at most 2-competitive; a general lower bound of 4/3 has been proven for all deterministic online algorithms. Closing the gap between √ 2 and 2 has remained an open problem in competitive analysis for more than a decade, with only marginal success in reducing the upper bound of 2. In this work, we first present a simplified proof for the √ 2 lower bound for LQD and then, using a reduction to the continuous case, improve the general lower bound for all deterministic online algorithms from 4 3 to √ 2. Then, we proceed to improve the lower bound of √ 2 specifically for LQD, showing that LQD is at least 1.44546086-competitive. We are able to prove the bound by presenting an explicit construction of the optimal clairvoyant algorithm which then allows for two different ways to prove lower bounds: by direct computer simulations and by proving lower bounds via linear programming. The linear programming approach yields a lower bound for LQD of 1.4427902 (still larger than √ 2).

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop

“…More recently, Bochkov, Davydow, Gaevoy, and Nikolenko [9] improved the lower bound on the competitiveness of LQD from √ 2 to approximately 1.44 (using a direct simulation of LQD and also independently, by solving a linear program). Moreover, they show that any deterministic online algorithm is at least √ 2-competitive, using a construction inspired by the LQD specific lower bound from [1,21].…”