Abstract
This work studies online scheduling algorithms for buffer management, develops new algorithms, and analyzes their performances. Packets arrive at a release time r, with a non-negative weight w and an integer deadline d. At each time step, at most one packet is scheduled. The modified greedy (MG) algorithm is 1.618-competitive for the objective of maximizing the sum of weights of packets sent, assuming agreeable deadlines. We analyze the empirical behavior of MG in a situation with arbitrary deadlines and demonstrate that it is at a disadvantage when frequently preferring maximum weight packets over early deadline ones. We develop the MLP algorithm, which remedies this problem whilst mimicking the behavior of the offline algorithm. Our comparative analysis shows that, although the competitive ratio of MLP is not as good as that of MG, it performs better in practice. We validate this by simulating the behavior of both algorithms under a spectrum of parameter settings. Finally, we propose the design of three additional algorithms, which may help in improving performance in practice.
N. Sakr—Supported in part by NSF grant CCF-1421161.
C. Stein—Supported in part by NSF grant CCF-1421161.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. SIAM J. Comput. (SICOMP) 35(2), 278–304 (2005)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queuing polices for QoS switches. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 761–770 (2003)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Bienkowski, M., Chrobak, M., Jeż, Ł.: Randomized algorithms for buffer management with 2-bounded delay. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 92–104. Springer, Heidelberg (2009)
Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: does timesharing or randomization help? Algorithmica 37(3), 149–164 (2003)
Chin, F.Y.L., Fung, S.P.Y.: Improved competitive algorithms for online scheduling with partial job values. Theor. Comput. Sci. 325(3), 467–478 (2004)
Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichy, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2), 255–276 (2006)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved online algorithms for buffer management in QoS switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 204–215. Springer, Heidelberg (2004)
Englert, M., Westermann, M.: Lower and upper bounds on FIFO buffer management in QoS switches. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 352–363. Springer, Heidelberg (2006)
Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 209–218 (2007)
Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of the 2001 Conference on Information Sciences and Systems (CISS), pp. 434–438 (2001)
Jeż, Ł., Li, F., Sethuraman, J., Stein, C.: Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms (TALG) 9(1), 5 (2012)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM J. Comput. (SICOMP) 33(3), 563–583 (2004)
Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. Algorithmica 43, 63–80 (2005)
Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 199–208 (2007)
Sakr, N., Stein, C.: An empirical study of online packet scheduling algorithms. Draft on arXiv under Computer Science: Data Structures and Algorithms. http://arxiv.org/abs/1603.07947
Acknowledgments
The authors would like to thank Dr. Shokri Z. Selim and Javid Ali.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Sakr, N., Stein, C. (2016). An Empirical Study of Online Packet Scheduling Algorithms. In: Goldberg, A., Kulikov, A. (eds) Experimental Algorithms. SEA 2016. Lecture Notes in Computer Science(), vol 9685. Springer, Cham. https://doi.org/10.1007/978-3-319-38851-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-38851-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38850-2
Online ISBN: 978-3-319-38851-9
eBook Packages: Computer ScienceComputer Science (R0)