Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-14T21:26:22.091Z Has data issue: false hasContentIssue false
  • English
  • Français

Queues with random service output: the case of Poisson arrivals

Published online by Cambridge University Press:  14 July 2016

Jacob Grinstein  and
Michael Rubinovitch
Jacob Grinstein
Affiliation:
Technion — Israel Institute of Technology
Michael Rubinovitch
Affiliation:
Technion — Israel Institute of Technology
Get access Rights & Permissions [Opens in a new window]

Abstract

A general class of single server queueing models is formulated. They distinguish between two factors that may influence the duration of service times: variability in the service requirements of customers, and variability (over time) in the service output of the server. Accordingly, we assume that the demands for service of successive customers form a sequence of independent, identically distributed random variables and that the amount of service produced by a busy server in a time interval is determined by the increment of a process with stationary independent increments over that interval. The results include the distribution of the busy period and the limiting distribution of the queue length. We also investigate the potential waiting process which is an extension of virtual waiting time process in existing queueing models.

Keywords

QUEUEING THEORYPROCESSES WITH STATIONARY INDEPENDENT INCREMENTS
Type
Research Papers
Information
Journal of Applied Probability , Volume 11 , Issue 4 , December 1974 , pp. 771 - 784
Copyright
Copyright © Applied Probability Trust 1974 

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

[1]Avi-Itzhak, B. (1963) Preemptive repeat priority queues as a special case of the multipurpose server problem, I and II. Operat. Res. 11, 597–619.Google Scholar
[2]Feller, W. (1966) An Introduction to Probability Theory and its Applications. Vol. II. John Wiley, New York.Google Scholar
[3]Gani, J. and Pyke, R. (1960) The content of a dam as the supremum of an infinitely divisible process. J. Math. and Mech. 9, 639–652.Google Scholar
[4]Harris, B. (1965) Theory of Probability. Addison-Wesley, Reading, Mass.Google Scholar
[5]Kingman, J. F. C. (1963) On continuous time models in the theory of dams. J. Austral. Math. Soc. 3, 480–487.Google Scholar
[6]Prabhu, N. U. (1965) Stochastic Processes. Macmillan, New York.Google Scholar
[7]Prabhu, N. U. (1967) Unified results and methods for queues and dams. Proc. Symposium on Congestion Theory. University of North Carolina Press.Google Scholar
[8]Prabhu, N. U. and Rubinovitch, M. (1971) On a continuous time extension of Feller's lemma. Z. Wahrscheinlichkeitsth. 17, 220–226.Google Scholar
[9]Rubinovitch, M. (1971) Ladder phenomena in stochastic processes with stationary independent increments. Z. Wahrscheinlichkeitsth. 20, 58–74.Google Scholar
[10]Smith, W. L. (1955) Regenerative stochastic processes. Proc. Roy. Soc. A 232, 6–31.Google Scholar
[11]Takács, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. John Wiley, New York.Google Scholar