Skip to main content

Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5261))

Abstract

In this paper, we analyze a discrete-time single-server queue with two classes of packet arrivals and a reservation-based scheduling discipline. The objective of this discipline is to give a certain priority to (delay-sensitive) packets of class 1 and at the same time to avoid packet starvation for the (delay-tolerant) packets of class 2. This is achieved by the introduction of a reserved place in the queue that can be taken by a future arrival of class 1. Both classes contain packets with generally distributed transmission times.

By means of a probability generating functions approach, both the class-1 and the class-2 packet delay are studied. By some numerical examples, the delay performance of the Reservation discipline is compared to that of the classical Absolute Priority (AP) and First-In First-Out (FIFO) scheduling disciplines.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Takine, T., Sengupta, B., Hasegawa, T.: An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes. IEEE Transactions on Communications 42(24), 1837–1845 (1994)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Mazzini, G., Rovatti, R., Setti, G.: A closed form solution of Bernoullian two-classes priority queue. IEEE Communications Letters 9(3), 264–266 (2005)

    Article  Google Scholar 

  4. Ndreca, S., Scoppola, B.: Discrete time GI/Geom/1 queueing system with priority. European Journal of Operational Research 189(3), 1403–1408 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ali, M.M., Song, X.: A performance analysis of a discrete-time priority queueing system with correlated arrivals. Performance Evaluation 57(3), 307–339 (2004)

    Article  Google Scholar 

  6. Jin, X.L., Min, G.: Performance analysis of priority scheduling mechanisms under heterogeneous network traffic. Journal of Computer and System Sciences 73(8), 1207–1220 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Walraevens, J., Wittevrongel, S., Bruneel, H.: A discrete-time priority queue with train arrivals. Stochastic Models 23(3), 489–512 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Burakowski, W., Tarasiuk, H.: On new strategy for prioritising the selected flow in queuing system. In: Proceedings of the COST 257 11th Management Committee Meeting, Barcelona (January 2000) COST-257 TD(00)03

    Google Scholar 

  9. De Vuyst, S., Wittevrongel, S., Bruneel, H.: Delay differentiation by reserving space in queue. Electronics Letters 41(9), 564–565 (2005)

    Article  Google Scholar 

  10. De Vuyst, S., Wittevrongel, S., Bruneel, H.: Place reservation: delay analysis of a novel scheduling mechanism. Computers & Operations Research 35(8), 2447–2462 (2008)

    MATH  Google Scholar 

  11. Feyaerts, B., De Vuyst, S., Wittevrongel, S., Bruneel, H.: Analysis of a discrete-time priority queue with place reservations and geometric service times. In: Proceedings of the Sixth Conference on Design, Analysis, and Simulation of Distributed Systems, DASD 2008, Edinburgh (June 2008)

    Google Scholar 

  12. Bruneel, H.: Performance of discrete-time queueing systems. Computers & Operations Research 20(3), 303–320 (1993)

    Article  MATH  Google Scholar 

  13. Bruneel, H., Kim, B.G.: Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Nigel Thomas Carlos Juiz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feyaerts, B., Wittevrongel, S. (2008). Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times. In: Thomas, N., Juiz, C. (eds) Computer Performance Engineering. EPEW 2008. Lecture Notes in Computer Science, vol 5261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87412-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87412-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87411-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics