Nearly optimal FIFO buffer management for two packet classes

Authors:
Zvi Lotker;Boaz Patt-Shamir
Affiliations:
Department of Electrical Engineering, Faculty of Engineering, Tel Aviv University, Tel Aviv 69978, Israel;Department of Electrical Engineering, Faculty of Engineering, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 10
Cited 5

Amortized efficiency of list update and paging rules

Communications of the ACM
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Pricing the Internet

Public access to the Internet
Internet cost allocation and pricing

Internet economics
Online computation and competitive analysis

Online computation and competitive analysis
Optimal smoothing schedules for real-time streams (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Loss-bounded analysis for differentiated services

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Buffer overflow management in QoS switches

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Packet dropping policies for ATM and IP networks

IEEE Communications Surveys & Tutorials

An improved algorithm for CIOQ switches

ACM Transactions on Algorithms (TALG)
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A survey of buffer management policies for packet switches

ACM SIGACT News
An optimal lower bound for buffer management in multi-queue switches

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling of packets with agreeable deadlines

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

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. We assume that each packet has value which is 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.