@inproceedings{b4ab6a8bdd9044ac8000c1e3220d2c0f,
title = "Further improvements in competitive guarantees for QoS buffering",
abstract = "We study the behavior of algorithms for buffering packets weighted by different levels of Quality of Service (QoS) guarantees in a single queue. Buffer space is limited, and packet loss occurs when the buffer overflows. We describe a modification of the previously proposed ``preemptive greedy{''} algorithm of for buffer management and give an analysis to show that this algorithm achieves a competitive ratio of at most 1.75. This improves upon recent work showing a 1.98 competitive ratio, and a previous result that shows a simple greedy algorithm has a competitive ratio of 2.",
author = "N. Bansal and L.K. Fleischer and T. Kimbrel and M. Mahdian and B. Schieber and M. Sviridenko",
year = "2004",
doi = "10.1007/978-3-540-27836-8_19",
language = "English",
isbn = "3-540-22849-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "196--207",
editor = "J. Diaz and J. Karhum{\"a}ki and A. Lepist{\"o} and D. Sannella",
booktitle = "Automata, Languages and Programming (31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings)",
address = "Germany",
}