Hostname: page-component-7dd5485656-tbj44 Total loading time: 0 Render date: 2025-10-31T22:08:29.115Z Has data issue: false hasContentIssue false
  • English
  • Français

Finite capacity vacation models with non-renewal input

Published online by Cambridge University Press:  14 July 2016

C. Blondia
C. Blondia*
Affiliation:
Philips Research Laboratory
*
∗ Postal address: Philips Research Laboratory, Av. Albert Einstein 4, B-1348 Louvain-la-Neuve, Belgium.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper studies a single server queue with finite waiting room where the server takes vacations according to two different strategies: (i) an exhaustive service discipline, where the server takes a vacation whenever the system becomes empty and these vacations are repeated as long as there are no customers in the system upon return from a vacation, i.e. a repeated vacation strategy; (ii) a limited service discipline, where the server begins a vacation either if K customers have been served in the same busy period or if the system is empty and then a repeated vacation strategy is followed. The input process is a general Markovian arrival process introduced by Lucantoni, Meier-Hellstern and Neuts, which as special cases includes the Markov modulated Poisson process and the phase-type renewal process. The service times and vacation times each are generally distributed random variables. For both models, we obtain the queue length distribution at departures, at an arbitrary time instant and at arrival time. We also derive the loss probability of an arriving customer. We obtain formulae for the LST of the virtual waiting time distribution and for the LST of the waiting time distribution at arrival epochs.

Keywords

SINGLE SERVER QUEUEFINITE CAPACITY QUEUESERVER VACATIONLIMITED SERVICE DISCIPLINEEXHAUSTIVE SERVICE DISCIPLINEGENERAL MARKOVIAN ARRIVAL PROCESS

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 1 , March 1991 , pp. 174 - 197
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Blondia, C. (1989) A finite capacity multi-queueing system with priorities and with repeated server vacations. QUESTA 5, 313–330.Google Scholar
[2] Blondia, C. (1989) The finite capacity N/G/1 queue. Stochastic Models 5, 273–294.CrossRefGoogle Scholar
[3] Blondia, C. (1989) Performance evaluation of an M/1-stage in an ATM switching element. Manuscript 317, Philips Research Laboratory, Brussels.Google Scholar
[4] Courtois, P. J. (1980) The M/G/1 finite capacity queue with delays. IEEE Trans. Commum. 28, 165–172.CrossRefGoogle Scholar
[5] Doshi, B. (1986) Queueing systems with vacations – A survey. Queueing Systems 1, 29–66.CrossRefGoogle Scholar
[6] Heffes, H. and Lucantoni, D. M. (1986) A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE J. Select. Areas Commun. 4, 856–868.CrossRefGoogle Scholar
[7] Kramer, M. (1989) Stationary distributions in a queueing system with vacation times and limited service. QUESTA 4, 57–68.Google Scholar
[8] Lee, T. T. (1984) M/G/1/N queue with vacation time and exhaustive service discipline. Operat. Res. 32, 774–784.CrossRefGoogle Scholar
[9] Lee, T. T. (1989) M/G/1/N queue with vacation time and limited service discipline. Performance Eval. 9, 181–190.CrossRefGoogle Scholar
[10] Levy, Y. (1985) A class of scheduling policies for real-time processors with switching system applications. In Proc. 11th Intern. Teletraffic Congress, Kyoto, Japan, ed. Akiyama, M. North-Holland, Amsterdam. 760–766.Google Scholar
[11] Levy, Y. and Yechiali, U. (1975) Utilization of idle time in an M/G/1 queueing system. Management Sci. 21, 202–211.CrossRefGoogle Scholar
[12] Lucantoni, D. M., Meier-Hellstern, K. S. and Neuts, M. F. (1990) A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob. 22, 676–705.CrossRefGoogle Scholar
[13] Neuts, M. F. (1978) Renewal processes of phase type. Naval Res. Logist. Quart. 25, 445–454.CrossRefGoogle Scholar
[14] Neuts, M. F. (1979) A versatile Markovian point process. J. Appl. Prob. 16, 764–779.CrossRefGoogle Scholar
[15] Neuts, M. F. (1981) Matrix-Geometric Solutions in Stochastic Models – An Algorithmic Approach. John Hopkins University Press, Baltimore.Google Scholar
[16] Neuts, M. F. (1989) Structured Stochastic Matrices of M/G/1 Type and their Applications. Marcel Dekker, New York,Google Scholar
[17] Ramaswami, V. (1980) The N/G/1 queue and its detailed analysis. Adv. Appl. Prob. 12, 222–261.CrossRefGoogle Scholar
[18] Takagi, H. (1986) Analysis of Polling Systems. MIT Press, Cambridge, Mass.Google Scholar