Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Fakinos, D.
1981.
The G/G/1 Queueing System with a Particular Queue Discipline.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 43,
Issue. 2,
p.
190.
Fakinos, D.
1982.
The M/G/k group-arrival group-departure loss system.
Journal of Applied Probability,
Vol. 19,
Issue. 4,
p.
826.
Fakinos, D.
1982.
The M/G/k group-arrival group-departure loss system.
Journal of Applied Probability,
Vol. 19,
Issue. 04,
p.
826.
1982.
The Single Server Queue.
Vol. 8,
Issue. ,
p.
676.
Yamazaki, Genji
1982.
TheGI/G/1 queue with last-come-first-served.
Annals of the Institute of Statistical Mathematics,
Vol. 34,
Issue. 3,
p.
599.
1984.
Discussion of Dr Davis's Paper.
Journal of the Royal Statistical Society Series B: Statistical Methodology,
Vol. 46,
Issue. 3,
p.
377.
Disney, Ralph L.
and
König, Dieter
1985.
Queueing Networks: A Survey of Their Random Processes.
SIAM Review,
Vol. 27,
Issue. 3,
p.
335.
Cooper, Robert B.
and
Niu, Shun-Chen
1986.
Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO.
Journal of Applied Probability,
Vol. 23,
Issue. 02,
p.
550.
Cooper, Robert B.
and
Niu, Shun-Chen
1986.
Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO.
Journal of Applied Probability,
Vol. 23,
Issue. 2,
p.
550.
Fakinos, D.
1987.
The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline.
Journal of Applied Probability,
Vol. 24,
Issue. 3,
p.
758.
Fakinos, D.
1987.
The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline.
Journal of Applied Probability,
Vol. 24,
Issue. 3,
p.
758.
Niu, Shun-Chen
1988.
Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline.
Queueing Systems,
Vol. 3,
Issue. 2,
p.
157.
Shalmon, Michael
1988.
Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation.
Probability in the Engineering and Informational Sciences,
Vol. 2,
Issue. 2,
p.
215.
Yamazaki, Genji
1990.
Invariance relations in single server queues with LCFS service discipline.
Annals of the Institute of Statistical Mathematics,
Vol. 42,
Issue. 3,
p.
475.
Nelson, Randolph D.
1993.
The mathematics of product form queuing networks.
ACM Computing Surveys,
Vol. 25,
Issue. 3,
p.
339.
Miyoshi, Naoto
2011.
On the stationary LCFS-PR single-server queue:
A characterization via stochastic intensity.
Numerical Algebra, Control & Optimization,
Vol. 1,
Issue. 4,
p.
713.
Chao, I-Fen
and
Yuang, Maria C.
2011.
Design and Performance Analysis of an Integrated Traffic Control Scheme for an Optical Packet-Switched Metro WDM Ring Network.
p.
1.
Chao, I-Fen
and
Yuang, Maria C.
2013.
Toward Wireless Backhaul Using Circuit Emulation Over Optical Packet-Switched Metro WDM Ring Network.
Journal of Lightwave Technology,
Vol. 31,
Issue. 18,
p.
3032.
Chao, I-Fen
and
Yuang, Maria C.
2013.
Circuit emulation in optical packet-switched WDM ring network for wireless backhaul.
p.
80.
Jacobovic, Royi
Levering, Nikki
and
Boxma, Onno
2023.
Externalities in the M/G/1 queue: LCFS-PR versus FCFS.
Queueing Systems,
Vol. 104,
Issue. 3-4,
p.
239.