Bounded delay packet scheduling in a bounded buffer

Authors:
Stanley P. Y. Fung
Affiliations:
Department of Computer Science, University of Leicester, Leicester LE1 7RH, United Kingdom
Venue:
Operations Research Letters
Year:
2010

Citing 8
Cited 1

Buffer Overflow Management in QoS Switches

SIAM Journal on Computing
The zero-one principle for switching networks

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analysis of queueing policies in QoS switches

Journal of Algorithms
Better online buffer management

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches

Algorithmica
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Multiplexing packets with arbitrary deadlines in bounded buffers

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory

Scheduling Packets with Values and Deadlines in Size-Bounded Buffers

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study buffer management in QoS-enabled network switches in the bounded delay model where each packet has a weight and a deadline. We consider the more realistic situation where the switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers. Recently, for the single buffer case, a 3-competitive deterministic algorithm and a 2.618-competitive randomized algorithm were found. We give a simple deterministic 2-competitive algorithm for the single buffer case.