×

Bounded delay packet scheduling in a bounded buffer. (English) Zbl 1202.90133

Summary: 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.

MSC:

90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Azar, Yossi; Levy, Nir, Multiplexing packets with arbitrary deadlines in bounded buffers, (Proceedings of 10th Scandinavian Workshop on Algorithm Theory. Proceedings of 10th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 4059 (2006)), 5-16 · Zbl 1141.68335
[2] Yossi Azar, Yossi Richter, The zero-one principle for switching networks, in: Proceedings of 36th ACM Symposium on Theory of Computing, 2004, pp. 64-71.; Yossi Azar, Yossi Richter, The zero-one principle for switching networks, in: Proceedings of 36th ACM Symposium on Theory of Computing, 2004, pp. 64-71. · Zbl 1192.68021
[3] Azar, Yossi; Richter, Yossi, Management of multi-queue switches in QoS networks, Algorithmica, 43, 1-2, 81-96 (2005) · Zbl 1086.68501
[4] Bansal, Nikhil; Fleischer, Lisa; Kimbrel, Tracy; Mahdian, Mohammad; Schieber, Baruch; Sviridenko, Maxim, Further improvements in competitive guarantees for QoS buffering, (Proceedings of 31st International Colloqium on Automata, Languages and Programming. Proceedings of 31st International Colloqium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 3142 (2004)), 196-207 · Zbl 1098.68516
[5] Chin, Francis Y. L.; Chrobak, Marek; Fung, Stanley P. Y.; Jawor, Wojciech; Sgall, Jiri; Tichý, Tomas, Online competitive algorithms for maximizing weighted throughput of unit jobs, Journal of Discrete Algorithms, 4, 2, 255-276 (2006) · Zbl 1132.68317
[6] Chin, Francis Y. L.; Fung, Stanley P. Y., Online scheduling with partial job values: does timesharing or randomization help?, Algorithmica, 37, 3, 149-164 (2003) · Zbl 1087.68519
[7] Matthias Englert, Matthias Westermann, Considering suppressed packets improves buffer management in QoS switches, in: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 209-218.; Matthias Englert, Matthias Westermann, Considering suppressed packets improves buffer management in QoS switches, in: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 209-218. · Zbl 1302.68041
[8] Englert, Matthias; Westermann, Matthias, Lower and upper bounds on FIFO buffer management in QoS switches, Algorithmica, 53, 4, 523-548 (2008) · Zbl 1189.68026
[9] Bruce Hajek, On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time, in: Proceedings of Conference on Information Sciences and Systems, 2001, pp. 434-438.; Bruce Hajek, On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time, in: Proceedings of Conference on Information Sciences and Systems, 2001, pp. 434-438.
[10] Kesselman, Alexander; Lotker, Zvi; Mansour, Yishay; Patt-Shamir, Boaz; Schieber, Baruch; Sviridenko, Maxim, Buffer overflow management in QoS switches, SIAM Journal on Computing, 33, 3, 563-583 (2004) · Zbl 1112.90025
[11] Kesselman, Alexander; Mansour, Yishay; van Stee, Rob, Improved competitive guarantees for QoS buffering, Algorithmica, 43, 1-2, 63-80 (2005) · Zbl 1086.68506
[12] Fei Li, Competitive scheduling of packets with hard deadlines in a finite capacity queue, in: Proceedings of INFOCOM, 2009.; Fei Li, Competitive scheduling of packets with hard deadlines in a finite capacity queue, in: Proceedings of INFOCOM, 2009.
[13] Li, Fei, Improved online algorithms for multiplexing weighted packets in bounded buffers, (Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management. Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, vol. 5564 (2009)), 265-278 · Zbl 1246.68268
[14] Fei Li, Jay Sethuraman, Clifford Stein, Better online buffer management, in: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 199-208.; Fei Li, Jay Sethuraman, Clifford Stein, Better online buffer management, in: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 199-208. · Zbl 1302.68043
[15] Zhu, An, Analysis of queueing policies in QoS switches, Journal of Algorithms, 53, 137-168 (2004) · Zbl 1089.68027
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.