Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hooke, John A.
1970.
On some limit theorems for the GI/G/1 queue.
Journal of Applied Probability,
Vol. 7,
Issue. 3,
p.
634.
Iglehart, Donald L.
1971.
Functional limit theorems for the queue GI/G/1 in light traffic.
Advances in Applied Probability,
Vol. 3,
Issue. 2,
p.
269.
Whitt, Ward
1971.
Weak convergence of first passage time processes.
Journal of Applied Probability,
Vol. 8,
Issue. 02,
p.
417.
Whitt, Ward
1972.
Complements to heavy traffic limit theorems for the GI/G/1 queue.
Journal of Applied Probability,
Vol. 9,
Issue. 1,
p.
185.
Whitt, Ward
1972.
Complements to heavy traffic limit theorems for the GI/G/1 queue.
Journal of Applied Probability,
Vol. 9,
Issue. 1,
p.
185.
Kennedy, Douglas P.
1972.
Rates of convergence for queues in heavy traffic. I.
Advances in Applied Probability,
Vol. 4,
Issue. 2,
p.
357.
Harrison, J. Michael
1973.
A limit theorem for priority queues in heavy traffic.
Journal of Applied Probability,
Vol. 10,
Issue. 04,
p.
907.
Iglehart, Donald L.
1973.
Weak convergence in queueing theory.
Advances in Applied Probability,
Vol. 5,
Issue. 3,
p.
570.
Schassberger, R.
1974.
A broad analysis of single server priority queues with two independent input streams, one of them Poisson.
Advances in Applied Probability,
Vol. 6,
Issue. 04,
p.
666.
Whitt, Ward
1974.
Mathematical Methods in Queueing Theory.
Vol. 98,
Issue. ,
p.
307.
Serfozo, Richard F.
1975.
Functional limit theorems for stochastic processes based on embedded processes.
Advances in Applied Probability,
Vol. 7,
Issue. 1,
p.
123.
Serfozo, Richard F.
1975.
Functional limit theorems for stochastic processes based on embedded processes.
Advances in Applied Probability,
Vol. 7,
Issue. 1,
p.
123.
Reiman, Martin I.
1984.
Modelling and Performance Evaluation Methodology.
Vol. 60,
Issue. ,
p.
207.
Sriram, K.
and
Whitt, W.
1986.
Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data.
IEEE Journal on Selected Areas in Communications,
Vol. 4,
Issue. 6,
p.
833.
Fendick, K.W.
and
Whitt, W.
1989.
Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue.
Proceedings of the IEEE,
Vol. 77,
Issue. 1,
p.
171.
Reiman, Martin I.
and
Simon, Burton
1990.
A network of priority queues in heavy traffic: One bottleneck station.
Queueing Systems,
Vol. 6,
Issue. 1,
p.
33.
Takahashi, Haruhisa
1990.
Coupled Processor: A Second-Order Continuous-State-Space Model.
Probability in the Engineering and Informational Sciences,
Vol. 4,
Issue. 2,
p.
277.
Kella, Offer
and
Whitt, Ward
1990.
Diffusion approximations for queues with server vacations.
Advances in Applied Probability,
Vol. 22,
Issue. 3,
p.
706.
Laws, C. N.
and
Louth, G. M.
1990.
Dynamic Scheduling of a Four-Station Queueing Network.
Probability in the Engineering and Informational Sciences,
Vol. 4,
Issue. 1,
p.
131.
Laws, C. N.
1992.
Resource pooling in queueing networks with dynamic routing.
Advances in Applied Probability,
Vol. 24,
Issue. 3,
p.
699.