Skip to main content
Log in

A batchSPP/G/1 queue with multiple vacations and exhaustive service discipline

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper considers a batch-arrival single-server queueing system with multiple vacations and exhaustive service discipline. Customers arrive to the system in accordance with a batch switched Poisson process (batchSPP). Using the supplementary variable technique, we analyze the stationary queue length distribution and derive various formulas for queue lengths and waiting times. In particular, we analytically show the decomposition property for the waiting time distributions. Therefore, the waiting time formulas developed in this paper can also be applied to a batchSPP/G/1 queue without vacations.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. Çinlar,Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).

    Google Scholar 

  2. B.T. Doshi, Queueing systems with vacations — A survey, Queueing Syst. 1(1986)29–66.

    Google Scholar 

  3. B.T. Doshi, Single server queues with vacations, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990), pp. 217–265.

    Google Scholar 

  4. B.T. Doshi, Generalizations of the stochastic decomposition results for single server queues with vacations, Stoch. Models 6(1990)307–333.

    Google Scholar 

  5. H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE J. Sel. Areas Commun. SAC-4(1986)856–868.

    Google Scholar 

  6. S. Kasahara, T. Takine, Y. Takahashi and T. Hasegawa, Analysis of anSPP/G/1 system with multiple vacations and E-limited service discipline, submitted for publication.

  7. J. Keilson and L.D. Servi, Oscillating random walk models forG/G/1 vacation systems with Bernoulli schedules, J. Appl. Prob. 23(1986)790–802.

    Google Scholar 

  8. Y. Levy and U. Yechiali, Utilization of idle time in anM/G/1 queueing system, Manag. Sci. 22(1975)202–211.

    Google Scholar 

  9. D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single server queue with server vacations and a class of non-renewal arrival processes, Adv. Appl. Prob. 22(1990)676–705.

    Google Scholar 

  10. D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stoch. Models 7(1991)1–46.

    Google Scholar 

  11. B. Maglaris, D. Anastassiou, P. Sen, G. Karlsson and J.D. Robbins, Performance models of statistical multiplexing in packet video communications, IEEE Trans. Commun. COM-36(1988)834–844.

    Google Scholar 

  12. M.F. Neuts,Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).

    Google Scholar 

  13. H. Sakasegawa and R.W. Wolff, The equality of the virtual delay and attained waiting time distributions, Adv. Appl. Prob. 22(1990)257–259.

    Google Scholar 

  14. A. Sugahara, T. Takine, Y. Takahashi and T. Hasegawa, Analysis of a non-preemptive priority queue withSPP arrivals of high class, submitted for publication.

  15. H. Takagi,Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1:Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Takine, T., Hasegawa, T. A batchSPP/G/1 queue with multiple vacations and exhaustive service discipline. Telecommunication Systems 1, 195–215 (1993). https://doi.org/10.1007/BF02136161

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02136161

Keywords

Navigation