Skip to main content
SpringerLink
Log in

Delay Analysis of a HOL Priority Queue

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Priority scheduling for packets is a hot topic, as interactive (voice, video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the probability generating functions of the packet delays. From these functions, some performance measures (such as moments and approximate probabilities) are calculated. We illustrate the performance measures by means of some numerical examples and show how to apply the theoretical results to a queue that handles arriving multimedia traffic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Bruneel and B. Kim, Discrete-Time Models for Communication Systems Including ATM (Kluwer AcademicPublisher, Boston, 1993).

    Google Scholar 

  2. A. Khamisy and M. Sidi, Discrete-time priority queues with two-state Markov Modulated arrivals, Stochastic Models 8(2) (1992) 337–357.

    Google Scholar 

  3. L. Kleinrock, Queueing Systems Volume II: Computer Applications (John Wiley & Sons, 1976)

  4. K. Laevens and H. Bruneel, Discrete-time multiserver queues with priorities, Performance Evaluation, 33(4) (1998) 249–275.

    Article  Google Scholar 

  5. J. Liebeherr and D. Wrege, Priority queue schedulers with approximate sorting inoutput-buffered switches, IEEE Journal on Selected Areas in Communications 17(6) (1999)1127–1144.

    Article  Google Scholar 

  6. K. Liu, D. Petr, V. Frost, H. Zhu, C. Braun and W. Edwards, Design and analysis of a bandwidth management framework for ATM-based broadband ISDN, IEEE Communications Magazine 35(5) (1997) 138–145.

    Article  Google Scholar 

  7. R. Miller, Priority queues, Annals of Mathematical Statistics 31 (1960) 86–103.

    Google Scholar 

  8. A. Parekh and R. Gallager, A generalized processor sharing approach to flow-control inintegrated services networks: The multiple node case, IEEE/ACM Transactions on Networking 2(2) (1994) 137–150.

    Article  Google Scholar 

  9. I. Rubin and Z. Tsai, Message delay analysis of multiclass priority TDMA, FDMA, anddiscrete-time queueing systems, IEEE Transactions on Information Theory 35(3) (1989) 637–647.

    Article  Google Scholar 

  10. D. Stanford, Interdeparture-time distributions in the nonpreemptive priority ∑Mi/Gi/1 queue, Performance Evaluation 12(1) (1991) 43–60.

    Article  Google Scholar 

  11. A. Sugahara, T. Takine, Y. Takahashi and T. Hasegawa, Analysis of a nonpreemptive priority queue with SPP arrivals of high-class, Performance Evaluation 21(3) (1995) 215–238.

    Article  Google Scholar 

  12. H. Takagi, Queueing analysis: A Foundation of Performance Evaluation Volume 1: Vacation and Priority Systems, Part 1, (North-Holland, 1991).

  13. Y. Takahashi and O. Hashida, Delay analysis of discrete-time priority queue with structured inputs, Queueing Systems 8(2) (1991) 149–164.

    Google Scholar 

  14. T. Takine, A nonpreemptive priority MAP/G/1 queue with two classes ofcustomers, Journal of Operations Research Society of Japan 39(2) (1996) 266–290.

    Google Scholar 

  15. T. Takine, Y. Matsumoto, T. Suda and T. Hasegawa, Mean waiting-times in nonpreemptive priority-queues with Markovian arrival and iid service processes, Performance Evaluation 20(1–3) (1994) 131–149.

    Google Scholar 

  16. T. Takine, B. Sengupta and T. Hasegawa, An analysis of a discrete-time queue for broad-band ISDN withpriorities among traffic classes, IEEE Transactions on Communications 42(2–4) (1994) 1837–1845.

    Google Scholar 

  17. C. Tham, Q. Yao and Y. Jiang, Achieving differentiated services through multi-class probabilistic priority scheduling, Computer Networks 40(4) (2002) 577–593.

    Article  Google Scholar 

  18. J. Walraevens, B. Steyaert and H. Bruneel, Performance analysis of the system contents in a discrete-time non-preemptive priority queue with general service times, Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL) 40(1/2) (2000) 91–103.

    Google Scholar 

  19. J. Walraevens, B. Steyaert and H. Bruneel, Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline, Performance Evaluatio 50(1) (2002) 53–75.

    Article  Google Scholar 

  20. J. Walraevens, B. Steyaert and H. Bruneel, Performance analysis of a single-server ATM queue with a priority scheduling, Computers & Operations Research 30(12) (2003) 1807–1829.

    Article  Google Scholar 

  21. X. Xiao and L. Ni, Internet Qo S: A big picture, IEEE Network 13(2) (1999) 8–18.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunications and Information Processing (IR07), Ghent University-UGent, Sint-Pietersnieuwstraat 41, B-9000, Gent, Belgium

    Joris Walraevens, Bart Steyaert, Marc Moeneclaey & Herwig Bruneel

Authors
  1. Joris Walraevens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bart Steyaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marc Moeneclaey
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Herwig Bruneel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joris Walraevens.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Walraevens, J., Steyaert, B., Moeneclaey, M. et al. Delay Analysis of a HOL Priority Queue. Telecommun Syst 30, 81–98 (2005). https://doi.org/10.1007/s11235-005-4317-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-005-4317-0

Keywords

Search

Navigation