A Simple Proof of the 2-Competitiveness of the Greedy FIFO Buffering Algorithm

We consider the behavior of a simple algorithm for buffering packets weighted by different levels of Quality of Service (QoS) guarantees in a single FIFO queue. Buffer space is limited, and packet loss occurs when the buffer overflows. A simple greedy algorithm is known to have a competitive ratio of 2. Here we give a very simple proof of this.

By: Tracy Kimbrel

Published in: RC23272 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .