Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Kingman, J. F. C.
1970.
Inequalities in the Theory of Queues.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 32,
Issue. 1,
p.
102.
Gaver, D. P.
and
Shedler, G. S.
1973.
Approximate Models for Processor Utilization in Multiprogrammed Computer Systems.
SIAM Journal on Computing,
Vol. 2,
Issue. 3,
p.
183.
Ross, Sheldon M.
1974.
Bounds on the delay distribution in GI/G/1 queues.
Journal of Applied Probability,
Vol. 11,
Issue. 2,
p.
417.
Kovalenko, I. N.
1974.
Queueing theory.
Journal of Soviet Mathematics,
Vol. 2,
Issue. 1,
p.
1.
Marchal, William G.
1976.
An Approximate Formula for Waiting Time in Single Server Queues.
A I I E Transactions,
Vol. 8,
Issue. 4,
p.
473.
Köllerström, J.
1976.
Stochastic bounds for the single-server queue.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 80,
Issue. 3,
p.
521.
Köllerström, Julian
1978.
Stochastic bounds for the queue GI/G/1 in heavy traffic.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 84,
Issue. 2,
p.
361.
Tan, Harry H.
1979.
Another martingale bound on the waiting-time distribution in GI/G/1 queues.
Journal of Applied Probability,
Vol. 16,
Issue. 2,
p.
454.
Stirzaker, David
1980.
Inheritance.
Advances in Applied Probability,
Vol. 12,
Issue. 3,
p.
574.
Asmussen, S�ren
1981.
Equilibrium properties of the M/G/1 queue.
Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete,
Vol. 58,
Issue. 2,
p.
267.
Asmussen, Søren
1982.
Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/1 queue.
Advances in Applied Probability,
Vol. 14,
Issue. 1,
p.
143.
Niznik
1983.
A Quantization Approximation for Modeling Computer Network Nodal Queueing Delay.
IEEE Transactions on Computers,
Vol. C-32,
Issue. 3,
p.
245.
Depuis, H.
and
Hajek, B.
1993.
Simple formulas for multiplexing delay for independent regenerative sources.
p.
28.
Jau-Hsiung Huang
and
Kleinrock, L.
1993.
Performance evaluation of dynamic sharing of processors in two-stage parallel processing systems.
IEEE Transactions on Parallel and Distributed Systems,
Vol. 4,
Issue. 3,
p.
306.
Kumar, S.
and
Kumar, P.R.
1993.
Performance bounds for queueing networks and scheduling policies.
p.
3166.
Lin, F.Y.S.
1993.
Allocation of end-to-end delay objectives for networks supporting SMDS.
p.
1346.
Buffet, E.
and
Duffield, N. G.
1994.
Exponential upper bounds via martingales for multiplexers with Markovian arrivals.
Journal of Applied Probability,
Vol. 31,
Issue. 4,
p.
1049.
Duffield, N. G.
1994.
Exponential bounds for queues with Markovian arrivals.
Queueing Systems,
Vol. 17,
Issue. 3-4,
p.
413.
Cheng-Shang Chang
1994.
Stability, queue length, and delay of deterministic and stochastic queueing networks.
IEEE Transactions on Automatic Control,
Vol. 39,
Issue. 5,
p.
913.
Jadoon, T.M.
and
Harle, D.A.
1994.
Performance comparison of peak bit rate and bursty traffic specification and allocation policer functions.
Vol. 2,
Issue. ,
p.
525.