Abstract
Motivated by providing differentiated services in the Internet, we consider online buffer management algorithms for quality-of-service network switches. We study a multi-buffer model. Packets have values and deadlines; they arrive at a switch over time. The switch consists of multiple buffers whose sizes are bounded. In each time step, only one pending packet can be sent. Our objective is to maximize the total value of the packets sent by their deadlines. We employ competitive analysis to measure an online algorithm’s performance. In this paper, we first show that the lower bound of competitive ratio of a broad family of online algorithms is 2. Then we propose a (\(3 + \sqrt{3} \approx 4.723\))-competitive deterministic algorithm, which is improved from the previously best-known result 9.82 (Azar and Levy. SWAT 2006).
Research is partially supported by the Seed Grant from the Office of the Vice President for Research and Economic Development at George Mason University.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aiello, W., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 431–440 (2000)
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)
Azar, Y., Levy, N.: Multiplexing packets with arbitrary deadlines in bounded buffers. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 5–16. Springer, Heidelberg (2006)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
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)
Chrobak, M., Jawor, W., Sgall, J., Tichy, T.: Online scheduling of equal-length jobs: Randomization and restart help? SIAM Journal on Computing (SICOMP) 36(6), 1709–1728 (2007)
Chrobak, M., Jawor, W., Sgall, J., Tichy, T.: Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms, 3(4), Article number 50 (2007)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)
Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the 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 35th Annual Conference on Information Science and Systems (CISS), pp. 434–438 (2001)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM Journal of Computing (SICOMP) 33(3), 563–583 (2004)
Li, F.: Competitive scheduling of packets with hard deadlines in a finite capacity queue. In: Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM) (2009)
Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 801–802 (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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, F. (2009). Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers. In: Goldberg, A.V., Zhou, Y. (eds) Algorithmic Aspects in Information and Management. AAIM 2009. Lecture Notes in Computer Science, vol 5564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02158-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-02158-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02157-2
Online ISBN: 978-3-642-02158-9
eBook Packages: Computer ScienceComputer Science (R0)