Abstract
We consider the online problem of active queue management. In our model, the input is a sequence of packets with values v ∈ [1,α] that arrive to a queue that can hold up to B packets. Specifically, we consider a FIFO non-preemptive queue, where any packet that is accepted into the queue must be sent, and packets are sent by the order of arrival. The benefit of a scheduling policy, on a given input, is the sum of values of the scheduled packets. Our aim is to find an online policy that maximizes its benefit compared to the optimal offline solution.
Previous work proved that no constant competitive ratio exists for this problem, showing a lower bound of ln(α) + 1 for any online policy. An upper bound of e⌈ln(α) ⌉ was proved for a few online policies. In this paper we suggest and analyze a RED-like online policy with a competitive ratio that matches the lower bound up to an additive constant proving an upper bound of ln(α) + 2 + O(ln 2(α)/B). For large values of α, we prove that no policy whose decisions are based only on the number of packets in the queue and the value of the arriving packet, has a competitive ratio lower than ln(α) + 2 - ε, for any constant ε > 0.
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: Proc. of IEEE INFOCOM (2000)
Andelman, N., Mansour, Y., Zhu, A.: Competitive Queueing Policies for QoS Switches. In: Proc. of 14th ACM-SIAM Symposium on Discrete Algorithms, SODA (2003)
Azar, Y., Richter, Y.: Management of Multi-Queue Switches In QoS Networks In. In: Proc. of 35th ACM Symposium on Theory of Computing, STOC (2003)
Black, D., Blake, S., Carlson, M., Davis, E., Wang, Z., Weiss, W.: An Architech-ture for Differentiated Services. Internet RFC 2475 (1998)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Clark, D., Wroklawski, J.: An Approach to Service Allocation in the Internet. Internet draft (1997), Available from diffserv.lcs.mit.edu
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Trans. on Networking 1(4) (1993)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive Buffer Management for Shared Memory Switches. In: Proc. of 13th ACM Symposium on Parallel Algorithms and Architectures, SPAA (2001)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviri-denko, M.: Buffer Overflow Management in QoS Switches. In: Proc. of 33rd ACM Symposium on Theory of Computing, STOC (2001)
Kesselman, A., Mansour, Y.: Loss-Bounded Analysis for Differentiated Services. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, SODA (2001)
Kesselman, A., Mansour, Y.: Harmonic Buffer Management Policy for Shared Memory Switches. In: Proc. of IEEE INFOCOM (2002)
Kesselman, A., Mansour, Y., van Stee, R.: Improved Competitive Guarantees for Qos Buffering. In: To appear in Proc. of 11th European symposium on Algorithms, ESA (2003)
Lotker, Z., Patt-Shamir, B.: Nearly Optimal FIFO Buffer Management for DiffServ. In: Proc. of 21st A CM Symposium on Principles of Distributed Computing, PODC (2002)
Nichols, K., Jacobson, V., Zhang, L.: A Two-bit Differentiated Services Architecture for the Internet, Internet draft (1997)
Sviridenko, M.: A Lower Bound for On-Line Algorithms in the FIFO Model (2001) (un-pulished Manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andelman, N., Mansour, Y. (2003). Competitive Management of Non-preemptive Queues with Multiple Values. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive