Buffer Overflow Management in QoS Switches
Authors:
- Alexander KesselmanAKAlexander Kesselman
- Zvi LotkerZLZvi Lotker
- Yishay MansourYMYishay Mansour
- Boaz Patt-ShamirBPBoaz Patt-Shamir
- Baruch SchieberBSBaruch Schieber
- Maxim SviridenkoMSMaxim Sviridenko
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 33 (3) , 563-583
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- Optimal smoothing schedules for real-time streamsDistributed Computing, 2004
- A unified approach to approximating resource allocation and schedulingJournal of the ACM, 2001
- Approximating the Throughput of Multiple Machines in Real-Time SchedulingSIAM Journal on Computing, 2001
- Online Scheduling with Hard DeadlinesJournal of Algorithms, 2000
- Packet dropping policies for ATM and IP networksIEEE Communications Surveys & Tutorials, 1999
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time SystemsSIAM Journal on Computing, 1995
- On the self-similar nature of Ethernet traffic (extended version)IEEE/ACM Transactions on Networking, 1994
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- On the competitiveness of on-line real-time task schedulingReal-Time Systems, 1992