Skip to main content

The Discrete-Time Queue with Geometrically Distributed Service Capacities Revisited

  • Conference paper
Book cover Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2013)

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

Abstract

We analyze a discrete-time queue with variable service capacity, such that the total amount of work that can be performed during each time slot is a stochastic variable that is geometrically distributed. We study the buffer occupancy by constructing an analogous model with fixed service capacity. In contrast with classical discrete-time queueing models, however, the service times in the fixed-capacity model can take the value zero with positive probability (service times are non-negative). We study the late arrival models with immediate and delayed access, the first model being the most natural model for a system with fixed capacity and non-negative service times and the second model the more practically relevant model for the variable-capacity model.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Book  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Gao, P., Wittevrongel, S., Bruneel, H.: Discrete-time multiserver queues with geometric service times. Computers and Operations Research 31, 81–99 (2004)

    Article  MATH  Google Scholar 

  4. Janssen, A., van Leeuwaarden, J.: Analytic computation schemes for the discrete-time bulk service queue. Queueing Systems 50, 141–163 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bruneel, H., Walraevens, J., Claeys, D., Wittevrongel, S.: Analysis of a discrete-time queue with geometrically distributed service capacities. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 121–135. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Kafetzakis, E., Kontovasilis, K., Stavrakakis, I.: Effective-capacity-based stochastic delay guarantees for systems with time-varying servers, with an application to IEEE 802.11 WLANs. Performance Evaluation 68, 614–628 (2011)

    Article  Google Scholar 

  7. Chang, C., Thomas, J.: Effective bandwidth in high-speed digital networks. IEEE Journal on Selected Areas in Communications 13, 1091–1100 (1995)

    Article  Google Scholar 

  8. Jin, X., Min, G., Velentzas, S.: An analytical queuing model for long range dependent arrivals and variable service capacity. In: Proceedings of IEEE International Conference on Communications (ICC 2008), Beijing, pp. 230–234 (2008)

    Google Scholar 

  9. Glock, C.: Batch sizing with controllable production rates. International Journal of Production Research 48, 5925–5942 (2010)

    Article  MATH  Google Scholar 

  10. Balkhi, Z.: On the global optimal solution to an integrated inventory system with general time varying demand, production and deterioration rates. European Journal of Operations Research 114, 29–37 (1999)

    Article  MATH  Google Scholar 

  11. Yang, H.L.: A partial backlogging production-inventory lot-size model for deteriorating items with time-varying production and demand rate over a finite time horizon. International Journal of Systems Science 42, 1397–1407 (2011)

    Article  MATH  Google Scholar 

  12. Hunter, J.: Mathematical Techniques of Applied Probability. Discrete Time Models: Techniques and Applications, vol. 2. Academic Press, New York (1983)

    Google Scholar 

  13. Takagi, H.: Queueing analysis: a foundation of performance evaluation. Discrete-time systems, vol. 3. North-Holland (1991)

    Google Scholar 

  14. Fiems, D., Steyaert, B., Bruneel, H.: Discrete-time queues with generally distributed service times and renewal-type server interruptions. Performance Evaluation 55, 277–298 (2004)

    Article  Google Scholar 

  15. Takagi, H.: Queueing analysis: a foundation of performance evaluation. Vacation and priority systems, vol. 1, part 1. North-Holland (1991)

    Google Scholar 

  16. Bruneel, H., Steyaert, B., Desmet, E., Petit, G.: An analytical technique for the derivation of the delay performance of ATM switches with multiserver output queues. International Journal of Digital and Analog Communication Systems 5, 193–201 (1992)

    Article  Google Scholar 

  17. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walraevens, J., Bruneel, H., Claeys, D., Wittevrongel, S. (2013). The Discrete-Time Queue with Geometrically Distributed Service Capacities Revisited. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39408-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39407-2

  • Online ISBN: 978-3-642-39408-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics