Hostname: page-component-848d4c4894-4hhp2 Total loading time: 0 Render date: 2024-05-27T11:13:16.050Z Has data issue: false hasContentIssue false
  • English
  • Français

On queues with periodic Poisson input

Published online by Cambridge University Press:  14 July 2016

Austin J. Lemoine
Austin J. Lemoine*
Affiliation:
Systems Control, Inc.
*
∗Postal address: Systems Control, Inc., 1801 Page Mill Rd., Palo Alto, CA 94304, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is concerned with asymptotic results for a single-server queue having periodic Poisson input and general service-time distribution, and carries forward the analysis of this model initiated in Harrison and Lemoine. First, it is shown that a theorem of Hooke relating the stationary virtual and actual waiting-time distributions for the GI/G/1 queue extends to the periodic Poisson model; it is then pointed out that Hooke's theorem leads to the extension (developed in [3]) of a related theorem of Takács. Second, it is demonstrated that the asymptotic distribution for the server-load process at a fixed ‘time of day' coincides with the distribution for the supremum, over the time horizon [0,∞), of the sum of a stationary compound Poisson process with negative drift and a continuous periodic function. Some implications of this characterization result for the computation and approximation of the asymptotic distributions are then discussed, including a direct proof, for the periodic Poisson case, of a recent result of Rolski comparing mean asymptotic customer waiting time with that of a corresponding M/G/1 system.

Keywords

SINGLE-SERVER QUEUESPERIODIC POISSON INPUTWAITING TIMESERVER LOADASYMPTOTIC DISTRIBUTIONSCOMPOUND POISSON PROCESSPERIODIC FUNCTIONS
Type
Research Papers
Information
Journal of Applied Probability , Volume 18 , Issue 4 , December 1981 , pp. 889 - 900
Copyright
Copyright © Applied Probability Trust 1981 

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

Footnotes

This work was sponsored by the National Science Foundation under Grant No. ENG–7824568.

References

[1] Crane, M. A. and Iglehart, D. L. (1975) Simulating stable stochastic systems: III. Regenerative processes and discrete-event simulations. Operat. Res. 23, 33–45.CrossRefGoogle Scholar
[2] Harrison, J. M. and Lemoine, A. J. (1976) On the virtual and actual waiting time distributions of a GI/G/1 queue. J. Appl. Prob. 13, 833–836.Google Scholar
[3] Harrison, J. M. and Lemoine, A. J. (1977) Limit theorems for periodic queues. J. Appl. Prob. 14, 566–576.Google Scholar
[4] Hooke, J. A. (1969) Some limit theorems for priority queues. Technical Report No. 91, Department of Operations Research, Cornell University.Google Scholar
[5] Pfanzagl, J. (1974) Convexity and conditional expectations. Ann. Prob. 2, 490–494.CrossRefGoogle Scholar
[6] Rolski, T. (1981) Queues with non-stationary input stream: Ross's conjecture. Adv. Appl. Prob. 13, 603–618.Google Scholar
[7] Ross, S. (1978) Average delay in queues with non-stationary Poisson arrivals. J. Appl. Prob. 15, 602–609.Google Scholar
[8] Takács, L. (1963) The limiting distribution of the virtual waiting time and the queue size for a single-server queue with recurrent input and general service times. Sankhya A 25, 91–100.Google Scholar
[9] Takács, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York.Google Scholar