Skip to main content

A Discrete-Time HOL Priority Queue with Multiple Traffic Classes

  • Conference paper
Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3420))

Included in the following conference series:

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 non-preemptive (or Head-Of-the-Line) priority scheduling 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 tail probabilities) are calculated. We 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 chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  7. Walraevens, J., Steyaert, B., Bruneel, H.: Delay characteristics in discrete-time GIG- 1 queues with non-preemptive priority queueing discipline. Performance Evaluation 50, 53–75 (2002)

    Article  Google Scholar 

  8. Bruneel, H., Kim, B.: Discrete-time models for communication systems including ATM. Kluwer Academic Publisher, Boston (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walraevens, J., Steyaert, B., Moeneclaey, M., Bruneel, H. (2005). A Discrete-Time HOL Priority Queue with Multiple Traffic Classes. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31956-6_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25339-6

  • Online ISBN: 978-3-540-31956-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics