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

12/07/2020
by   Antonios Antoniadis, et al.
0

We consider the problem of managing the buffer of a shared-memory switch that transmits packets of unit value. A shared-memory switch consists of an input port, a number of output ports, and a buffer with a specific capacity. In each time step, an arbitrary number of packets arrive at the input port, each packet designated for one output port. Each packet is added to the queue of the respective output port. If the total number of packets exceeds the capacity of the buffer, some packets have to be irrevocably rejected. At the end of each time step, each output port transmits a packet in its queue and the goal is to maximize the number of transmitted packets. The Longest Queue Drop (LQD) online algorithm accepts any arriving packet to the buffer. However, if this results in the buffer exceeding its memory capacity, then LQD drops a packet from the back of whichever queue is currently the longest, breaking ties arbitrarily. The LQD algorithm was first introduced in 1991, and is known to be 2-competitive since 2001. Although LQD remains the best known online algorithm for the problem and is of great practical interest, determining its true competitiveness is a long-standing open problem. We show that LQD is 1.707-competitive, establishing the first (2-ε) upper bound for the competitive ratio of LQD, for a constant ε>0.

READ FULL TEXT

Authors

page 7

07/09/2019

New Competitiveness Bounds for the Shared Memory Switch

We consider one of the simplest and best known buffer management archite...
09/11/2019

Tiny Buffer TCP for Data Center Networks

A low and stable buffer occupancy is critical to achieve high throughput...
06/30/2018

An optimal algorithm for 2-bounded delay buffer management with lookahead

The bounded delay buffer management problem, which was proposed by Kesse...
04/30/2020

Randomized Two-Valued Bounded Delay Online Buffer Management

In the bounded delay buffer management problem unit size packets arrive ...
04/26/2019

Construction of Subexponential-Size Optical Priority Queues with Switches and Fiber Delay Lines

All-optical switching has been considered as a natural choice to keep pa...
11/11/2020

Empirically Characterizing the Buffer Behaviour of Real Devices

All the routers include a buffer in order to enqueue packets waiting to ...
11/20/2020

Virtues of Patience in Strategic Queuing Systems

We consider the problem of selfish agents in discrete-time queuing syste...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.