Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-24T17:52:49.987Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on M/G/1 Vacation Systems with Sojourn Time Limits

Part of: Stochastic processes Volterra integral equations Special processes

Published online by Cambridge University Press:  30 January 2018

Tsuyoshi Katayama
Tsuyoshi Katayama*
Affiliation:
Chubu Teletraffic Engineering Laboratory
*
∗ Postal address: Chubu Teletraffic Engineering Laboratory, Naka-taikouyama 4-66, Imizu-shi, Toyama, 939-0363, Japan. Email address: katagon@silk.plala.or.jp
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.

In this paper we deal with an M/G/1 vacation system with the sojourn time (wait plus service) limit and two typical vacation rules, i.e. multiple and single vacation rules. Using the level crossing approach, we derive recursive equations for the steady-state distributions of the virtual waiting times in M/G/1 vacation systems with a general vacation time and two vacation rules.

Keywords

Sojourn time limitvacation systembalkinglevel crossingintegral equation

MSC classification

Primary: 45D05: Volterra integral equations 60G17: Sample path properties 60K25: Queueing theory
Type
Research Article
Information
Journal of Applied Probability , Volume 49 , Issue 4 , December 2012 , pp. 1194 - 1199
Copyright
© Applied Probability Trust 

References

Asmussen, S. (2003). Applied Probability and Queues (Appl. Math. 51), 2nd edn. Springer, New York.Google Scholar
Brill, P. H. (2008). Level Crossing Methods in Stochastic Models (Internat. Ser. Operat. Res. Manag. Sci. 123). Springer, New York.Google Scholar
Fuhrmann, S. W. and Cooper, R. B. (1985). Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.CrossRefGoogle Scholar
Gavish, B. and Schweitzer, P. J. (1977). The Markovian queue with bounded waiting time. Manag. Sci. 23, 1349–1357.Google Scholar
Hokstad, P. (1979). A single-server queue with constant service time and restricted accessibility. Manag. Sci. 25, 205–208.Google Scholar
Katayama, T. (2011). Some results for vacation systems with sojourn time limits. J. Appl. Prob. 48, 679–687.Google Scholar
Perry, D. and Asmussen, S. (1995). Rejection rules in the M/G/1 queue. Queueing Systems 19, 105–130.Google Scholar
Roubine, É. (ed.) (1970). Mathematics Applied to Physics. Springer, New York.Google Scholar
Takács, L. (1967). The distribution of the content of finite dams. J. Appl. Prob. 4, 151–161.Google Scholar