Competitive Management of Non-preemptive Queues with Multiple Values

  • Nir Andelman
  • Yishay Mansour
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2848)


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 eln(α) ⌉ 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.


Competitive Ratio Input Stream Outgoing Link Random Early Detection Active Queue Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aiello, W., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive Queue Policies for Differentiated Services. In: Proc. of IEEE INFOCOM (2000)Google Scholar
  2. 2.
    Andelman, N., Mansour, Y., Zhu, A.: Competitive Queueing Policies for QoS Switches. In: Proc. of 14th ACM-SIAM Symposium on Discrete Algorithms, SODA (2003)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Black, D., Blake, S., Carlson, M., Davis, E., Wang, Z., Weiss, W.: An Architech-ture for Differentiated Services. Internet RFC 2475 (1998)Google Scholar
  5. 5.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  6. 6.
    Clark, D., Wroklawski, J.: An Approach to Service Allocation in the Internet. Internet draft (1997), Available from
  7. 7.
    Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Trans. on Networking 1(4) (1993)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Kesselman, A., Mansour, Y.: Loss-Bounded Analysis for Differentiated Services. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, SODA (2001)Google Scholar
  11. 11.
    Kesselman, A., Mansour, Y.: Harmonic Buffer Management Policy for Shared Memory Switches. In: Proc. of IEEE INFOCOM (2002)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Nichols, K., Jacobson, V., Zhang, L.: A Two-bit Differentiated Services Architecture for the Internet, Internet draft (1997)Google Scholar
  15. 15.
    Sviridenko, M.: A Lower Bound for On-Line Algorithms in the FIFO Model (2001) (un-pulished Manuscript)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nir Andelman
    • 1
  • Yishay Mansour
    • 1
  1. 1.School of Computer ScienceTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations