[go: up one dir, main page]

Skip to main content
Log in

Analysis of an SPP/G/1 system with multiple vacations and E-limited service discipline

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Many researchers have studied variants of queueing systems with vacations. Most of them have dealt with M/G/1 systems and have explicitly analyzed some of their performance measures, such as queue length, waiting time, and so on. Recently, studies on queueing systems whose arrival processes are not Poissonian have appeared. We consider a single server queueing system with multiple vacations and E-limited service discipline, where messages arrive to the system according to a switched Poisson process. First, we consider the joint probability density functions of the queue length and the elapsed service time or the elapsed vacation time. We derive the equations for these pdf's, which include a finite number of unknown values. Using Rouché's theorem, we determine the values from boundary conditions. Finally, we derive the transform of the stationary queue length distribution explicitly.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. C. Blondia, Finite capacity vacation models with non-renewal input, J. Appl. Prob. 28 (1991) 174–197.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  4. D.M. Lucatoni, K. 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 

  5. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins University Press, Baltimore and London, 1981).

    Google Scholar 

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

    Google Scholar 

  7. T. Ozawa, Alternating service queues with mixed exhaustive and K-limited services, Performance Evaluation 11 (1990) 165–175.

    Google Scholar 

  8. S. Sumita and T. Ozawa, Achievability of performance objectives in ATM switching nodes, in:Performance of Distributed and Parallel Systems (North-Holland, Amsterdam, 1988) pp. 45–56.

    Google Scholar 

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

    Google Scholar 

  10. T. Takine and T. Hasegawa, A Batch SPP/G/1 queue with multiple vacations and exhaustive service discipline, Telecomm. Syst. 1 (1993) 195–215.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kasahara, S., Takine, T., Takahashi, Y. et al. Analysis of an SPP/G/1 system with multiple vacations and E-limited service discipline. Queueing Syst 14, 349–367 (1993). https://doi.org/10.1007/BF01158873

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation