Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-10T14:09:05.840Z Has data issue: false hasContentIssue false
  • English
  • Français

Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts

Published online by Cambridge University Press:  14 July 2016

Thomas Hanschke
Thomas Hanschke*
Affiliation:
Joh annes Gutenberg-Universität Mainz
*
∗Postal address Fachbereich Mathematik, Saarstr. 21, 6500 Mainz, W. Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we study the M/M/2/2 queue with repeated attempts. It is shown that the part generating functions of the steady state probabilities can be expressed in of generalized hypergeometric unctions.

Keywords

QUEUES WITH REPEATED ATTEMPTSREGULAR AND ERGODIC MARKOV PROCESSESQ-MATRIXHYPERGEOMETRIC DIFFERENTIAL EQUATIONGENERALIZED HYPERGEOMETRIC SERIES
Type
Research Papers
Information
Journal of Applied Probability , Volume 24 , Issue 2 , June 1987 , pp. 486 - 494
Copyright
Copyright © Applied Probability Trust 1987 

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.)

References

Cohen, J. W. (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommun. Rev. 18, 49–100.Google Scholar
Erdélyi, A. et al. (1953) Higher Transcendental Functions, Vol. I, McGraw-Hill, New York.Google Scholar
Falin, G. I. (1984a) On sufficient conditions for ergodicity of multichannel queueing systems with repeated calls. Adv. Appl. Prob. 16, 447–448.CrossRefGoogle Scholar
Falin, G. I. (1984b) Double-channel queueing system with repeated calls. The paper is deposited with the All-Union Institute for Scientific and Technical Information, Moscow, USSR, No. 4221–84, June 21 (in Russian).Google Scholar
Jonin, G. L. and Sedol, J. J. (1970) Telephone systems with repeated calls. Proc. 6th Internat. Teletraffic Congr., Munich, 435/1–435/5.Google Scholar
Keilson, J., Cozzolino, J. and Young, H. (1968) A service system with unfilled requests repeated. Operat. Res. 16, 1126–1137.CrossRefGoogle Scholar
Kendall, D. G. and Reuter, G. E. H. (1957) The calculation of the ergodic projection for Markov chains and processes with a countable infinity of states. Acta Math. 97, 103–144.CrossRefGoogle Scholar
Little, J. D. C. (1961) A proof for the queueing formula L = ?W. Operat Res. 9, 383–387.CrossRefGoogle Scholar
Reuter, G. E. H. (1957) Denumerable Markov processes and the associated contraction semigroups on 1. Acta Math. 97, 1–46.CrossRefGoogle Scholar
Riordan, J. (1962) Stochastic Service Systems. Wiley, New York.Google Scholar
Tweedie, R. L. (1975) Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. Math. Proc. Camb. Phil. Soc. 78, 125–136.CrossRefGoogle Scholar