Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-05T21:00:19.477Z Has data issue: false hasContentIssue false

Weak convergence of the average of flag processes

Published online by Cambridge University Press:  14 July 2016

Donald L. Iglehart
Affiliation:
Stanford University
Douglas P. Kennedy
Affiliation:
Stanford University

Extract

Let be a sequence of non-negative random variables and the associated point process defined by

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1970 

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] Billingsley, P. (1968) Convergence of Probability Measures. John Wiley and Sons, New York.Google Scholar
[2] Borovkov, A. (1967) On limit laws for service processes in multi-channel systems. Siberian Math. J. 8, 746763. (English translation).Google Scholar
[3] Iglehart, D. and Whitt, W. (1969) The equivalence of functional central limit theorems for counting processes and associated partial sums. Technical Report No. 6, Department of Operations Research, Stanford University.Google Scholar
[4] Iglehart, D. and Whitt, W. (1970) Multiple channel queues in heavy traffic. I. Adv. Appl. Prob. 2, 150177.CrossRefGoogle Scholar
[5] Narasimham, T. (1968) A note on the asymptotic distribution of the traffic-time-average in a GI/G/8 with bulk arrivals. J. Appl. Prob. 5, 476480.CrossRefGoogle Scholar