@inbook{087baeeaf25c41e0bda603dbb1935d45,
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 = "Nikhil Bansal and Fleischer, {Lisa K.} and Tracy Kimbrel and Mohammad Mahdian and Baruch Schieber and Maxim Sviridenko",
year = "2004",
doi = "10.1007/978-3-540-27836-8_19",
language = "English (US)",
isbn = "3540228497",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "196--207",
editor = "Josep D{\'i}az and Juhani Karhum{\"a}ki and Arto Lepist{\"o} and Donald Sannella",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}