Buffer Overflow Management in QoS Switches

• Published in: SIAM journal on computing Vol. 33; no. 3; pp. 563 - 583
• Main Authors: Kesselman, Alexander, Lotker, Zvi, Mansour, Yishay, Patt-Shamir, Boaz, Schieber, Baruch, Sviridenko, Maxim
• Format: Journal Article
• Language: English
• Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2004
• Subjects: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Competition; Computer science; control theory; systems; Computer systems performance. Reliability; Exact sciences and technology; Operational research and scientific management; Operational research. Management science; Quality of service; Scheduling, sequencing; Software; Theoretical computing; Operations research; Overload; Optimal algorithm; Competitive analysis; Bandwidth; Quality of service; Greedy algorithm; Scheduling; Delay time; Buffer overflow; FIFO scheduling
• ISSN: 0097-5397; 1095-7111
• DOI: 10.1137/S0097539701399666

We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the order in which they arrive; the constraint in this case is the limited buffer space. In the bounded-delay type, each packet has a maximum delay time by which it must be transmitted, or otherwise it is lost. We study the case of overloads resulting in packet loss. In our model, each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is a thorough investigation of some natural greedy algorithms in various models. For the FIFO model we prove tight bounds on the competitive ratio of the greedy algorithm that discards packets with the lowest value when an overflow occurs. We also prove that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm. This algorithm can be as much as 1.5 times better than the tail-drop greedy policy, which drops the latest lowest-value packets. In the bounded-delay model we show that the competitive ratio of any on-line algorithm for a uniform bounded-delay buffer is bounded away from 1, independent of the delay size. We analyze the greedy algorithm in the general case and in three special cases: delay bound 2, link bandwidth 1, and only two possible packet values. Finally, we consider the off-line scenario. We give efficient optimal algorithms and study the relation between the bounded-delay and FIFO models in this case.