Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-22T08:42:55.075Z Has data issue: false hasContentIssue false
  • English
  • Français

The BMAP/G/1 vacation queue with queue-length dependent vacation schedule

Published online by Cambridge University Press:  17 February 2009

Yang Woo Shin  and
Chareles E. M. Pearce
Yang Woo Shin
Affiliation:
Department of Statistics, Changwon National University, 9 Sarimdong, Changwon 641 - 773, Korea
Chareles E. M. Pearce
Affiliation:
Applied Mathematics Department, The University of Adelaide, Adelaide SA 5005, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We treat a single-server vacation queue with queue-length dependent vacation schedules. This subsumes the single-server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch-Markovian arrival process (BMAP). We derive the queue-length distribution at departure epochs. By using a semi-Markov process technique, we obtain the Laplace-Stieltjes transform of the transient queue-length distribution at an arbitrary time point and its limiting distribution

Type
Research Article
Information
The ANZIAM Journal , Volume 40 , Issue 2 , October 1998 , pp. 207 - 221
Copyright
Copyright © Australian Mathematical Society 1998

References

[1]Çinlar, E., Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, N. J., 1975).Google Scholar
[2]Doshi, H. T., “Queueing systems with vacations - a survey”, Queueing Syst. 1 (1986) 29–66.CrossRefGoogle Scholar
[3]Harris, C. M. and Marchal, W. G., “State dependence in M/G/l server-vacation models”, Oper. Res. 36 (1988) 560–565.CrossRefGoogle Scholar
[4]Lucantoni, D. L., “New results on the single server queue with a batch Markovian arrival process”, Stoch. Models 7 (1991) 1–46.CrossRefGoogle Scholar
[5]Lucantoni, D. L., Choudhury, G. L. and Whitt, W., “The transient BMAP/G1 queue”, Stoch.Models 10 (1994) 145–182.CrossRefGoogle Scholar
[6]Lucantoni, D. L., Meier-Hellstern, K. S. and Neuts, M. F., “A single server queue with server vacations and a class of non-renewal arrival processes”, Adv. Appl. Prob. 22 (1990).CrossRefGoogle Scholar
[7]Lucantoni, D. L. and Neuts, M. F., “Simpler proofs of some properties of the fundamental period of the MAP/G/1 queue”, J. Appl. Prob. 31 (1994) 235–243.CrossRefGoogle Scholar
[8]Lucantoni, D. L. and Neuts, M. F., “Some steady state distributions for the MAP/SM/1 queue”, Stoch. Models 10 (1994) 575–598.CrossRefGoogle Scholar
[9]Machihara, F., “A queue with vacation depending on services”, in Symposium on Performance Models for Information Communication Networks (ed. Hashida, O.), (Univ. of Tsukuba, Japan, 1995), 25–37.Google Scholar
[10]Neuts, M. F., Structured stochastic matrices of M/G/1 type and their applications (Marcel Dekker, New York, 1989).Google Scholar
[11]Shin, Y. W., “Time-dependent analysis of the Mx/G/1 vacation queue with queue length dependent vacation schedule”, submitted for publication.Google Scholar
[12]Takagi, H., Queueing analysis: a foundation of performance evaluation, Volume 1: vacation and priority systems, Part I (North-Holland, Amsterdam, 1991).Google Scholar
[13]Takine, T. and Hasegawa, T., “A batch SPP/G/1 queue with multiple vacations and exhaustive service discipline”, Telecomm. Syst. 1 (1993) 195–215.CrossRefGoogle Scholar