Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-26T09:14:49.505Z Has data issue: false hasContentIssue false
  • English
  • Français

Stationary queue-length and waiting-time distributions in single-server feedback queues

Published online by Cambridge University Press:  01 July 2016

Ralph L. Disney ,
Dieter König  and
Volker schmidt
Ralph L. Disney*
Affiliation:
Virginia Polytechnic Institute and State University
Dieter König*
Affiliation:
Mining Academy, Freiberg
Volker schmidt*
Affiliation:
Virginia Polytechnic Institute and State University
*
∗Postal address: Department of Industrial Engineering and Operations Research, Virginia Polytechnic and State University, Blacksburg, VA 24061, U.S.A.
∗∗ Postal address: Sektion Mathematik, Bergakademie Freiberg, DDR-9200 Freiberg (Sachs), GDR.
∗∗ Postal address: Sektion Mathematik, Bergakademie Freiberg, DDR-9200 Freiberg (Sachs), GDR.
Get access Rights & Permissions [Opens in a new window]

Abstract

For M/GI/1/∞ queues with instantaneous Bernoulli feedback time- and customer-stationary characteristics of the number of customers in the system and of the waiting time are investigated. Customer-stationary characteristics are thereby obtained describing the behaviour of the queueing processes, for example, at arrival epochs, at feedback epochs, and at times at which an arbitrary (arriving or fed-back) customer enters the waiting room. The method used to obtain these characteristics consists of simple relationships between them and the time-stationary distribution of the number of customers in the system at an arbitrary point in time. The latter is obtained from the wellknown Pollaczek–Khinchine formula for M/GI/1/∞ queues without feedback.

Keywords

POISSON ARRIVALSTIME- AND CUSTOMER-STATIONARY CHARACTERISTICS
Type
Research Article
Information
Advances in Applied Probability , Volume 16 , Issue 2 , June 1984 , pp. 437 - 446
Copyright
Copyright © Applied Probability Trust 1984 

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

Disney, R. L. (1981) A note on sojourn times in M/GI/1 queues with instantaneous Bernoulli feedback. Naval Res. Logist. Quart. 28, 679–684.Google Scholar
Disney, R. L. and König, D. (1984) Queueing networks: A survey of their random processes. SIAM Rev. To appear.Google Scholar
Disney, R. L., McNickle, D. C. and Simon, B. (1980) The M/G/1 queue with instantaneous Bernoulli feedback. Naval Res. Logist. Quart. 27, 635–644.Google Scholar
Franken, P., König, D., Arndt, U. and Schmidt, V. (1982) Queues and Point Processes. Wiley, New York.Google Scholar
KaläHne, U. (1976) Existence, uniqueness and some invariance properties of stationary distributions for general single-server queues. Math. Operationsforsch. Statist. 7, 557–575.Google Scholar
König, D. and Schmidt, V. (1980) Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes J. Appl. Prob. 17, 753–767.Google Scholar
König, D. and Schmidt, V. (1983) Stationary two-node queueing networks with delayed feedback. Technical Report, Dept. of Mathematics, Mining Academy of Freiberg.Google Scholar
Loynes, R. M. (1962) The stability of a queue with non-independent interarrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
Miyazawa, M. (1977) Time and customer processes in queues with stationary inputs. J. Appl. Prob. 14, 349–357.Google Scholar
Miyazawa, M. (1979) A formal approach to queueing processes in the steady state and their applications. J. Appl. Prob. 16, 332–346.Google Scholar
Takács, L. (1963) A single server queue with feedback. Bell System Tech. J. 42, 505–519.CrossRefGoogle Scholar