Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/improved-online-algorithms-for-buffer-management-in-qos-switches-qlb4v13MFo
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2007 by ACM Inc.
- ISSN
- 1549-6325
- DOI
- 10.1145/1290672.1290687
- Publisher site
- See Article on Publisher Site
Abstract
We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.
Journal
ACM Transactions on Algorithms (TALG) – Association for Computing Machinery
Published: Nov 1, 2007