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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosen, A.: Dynamic routing on networks with fixed size buffers. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 771–780 (2003)
Aiello, W., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: Proceedings of the IEEE INFOCOM, pp. 431–440 (2000)
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (2004)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 761–770 (2003)
Andrews, Awerbuch, Fernandez, Kleinberg, Leighton, Liu.: Universal stability results for greedy contention-resolution protocols. In: 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 380–389 (1996)
Azar, Y., Richter, Y.: Management of multi-queue switches in QoS netowrks. In: 35th ACM Symposium on Theory of Computing, pp. 82–89 (2003)
Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 34th ACM Symposium on Theory of Computing (2004)
Bar-Noy, A., Freund, A., Landa, S., (Seffi) Naor, J.:Competitive on-line switching policies. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002)
Bernet, Y., Smith, A., Blake, S., Grossman, D.: A conceptual model for diffserv routers. Internet draft (March 2000)
Birman, A., Richard Gail, H., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the ACM 42(3), 641–657 (1995)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. Journal of the ACM 48(1), 13–38 (2001)
Clark, D., Wroclawski, J.: An approach to service allocation in the Internet. Internet draft (July 1997)
Dovrolis, C., Stiliadis, D., Ramanathan, P.: Proportional differentiated services: Delay differentiation and packet scheduling. In: SIGCOMM, pp. 109–120 (1999)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problem. In: Proceedings of the 34st Annual ACM Symposium on Theory of Computing (2002)
Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 361–372. Springer, Heidelberg (2003)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: ACM Symposium on Theory of Computing, pp. 520–529 (2001)
Koga, H.: Balanced scheudling towards loss-free packet queueing and delay fairness. In: Proc. 12th Annual International Symposium on Algorithms and Computation, pp. 61–73 (2001)
Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for Diff- Serv. In: Proc. 21st ACM-SIAM Symposium on Principles of Distributed Computing (PODC), pp. 134–142 (2002)
Mansour, Y., Patt-Shamir, B., Lapid, O.: Optimal smoothing schedules for realtime streams. In: Proc. 19th ACM Symp. on Principles of Distributed Computing, pp. 21–29 (2000)
May, M., Bolot, J.-C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services schemes for the internet. In: Proc. IEEE INFOCOM, pp. 1385–1394 (1999)
Nandagopal, T., Venkitaraman, N., Sivakumar, R., Bharghavan, V.: Delay differentiation and adaptation in core stateless networks. In: Proc. IEEE INFOCOM (2000)
Nichols, K., Jacobson, V., Zhang, L.: A twobit differentiated services architecture for the internet. Internet draft (1997)
Semret, N., Liao, R.R.-F., Campbell, A.T., Lazar, A.A.: Peering and provisioning of differentiated internet services. In: Proc. IEEE INFOCOM, pp. 414–420 (2000)
Stoica, I., Zhang, H.: Providing guaranteed services without per flow management. In: Proc. ACM SIGCOMM, pp. 81–94 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, N., Fleischer, L.K., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M. (2004). Further Improvements in Competitive Guarantees for QoS Buffering. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive