Nearly optimal FIFO buffer management for DiffServ

Zvi Lotker, Boaz Patt-Shamir

Research output: Contribution to conferencePaperpeer-review

32 Scopus citations

Abstract

We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. Motivated by DiffServ, we assume that each packet has value either 1 or α, for some α > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bound, and to the FIFO order of sent packets. We consider push-out buffers, where the algorithm may eject packets from anywhere in the buffer. The best lower bound on the competitive ratio of on-line algorithms for buffer management is approximately 1.28. In this paper we present an on-line algorithm whose competitive ratio is approximately 1.30 for the worst case α. The best previous general upper bound was about 1.888.

Original languageEnglish
Pages134-143
Number of pages10
DOIs
StatePublished - 1 Jan 2002
Externally publishedYes
EventProceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002 - Monterey, CA, United States
Duration: 21 Jul 200224 Jul 2002

Conference

ConferenceProceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002
Country/TerritoryUnited States
CityMonterey, CA
Period21/07/0224/07/02

Cite this