Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kitaev, M. Yu.
1993.
The M/G/1 processor-sharing model: transient behavior.
Queueing Systems,
Vol. 14,
Issue. 3-4,
p.
239.
Grishechkin, Sergei
1994.
GI/G/1 processor sharing queue in heavy traffic.
Advances in Applied Probability,
Vol. 26,
Issue. 2,
p.
539.
Grishechkin, Sergei
1994.
GI/G/1 processor sharing queue in heavy traffic.
Advances in Applied Probability,
Vol. 26,
Issue. 02,
p.
539.
Grishechkin, S. A.
1995.
Interoutput Times in an $M/G/1/PS$ Queue with Instant Feedback.
Theory of Probability & Its Applications,
Vol. 39,
Issue. 4,
p.
692.
Núñez-Queija, Rudesindo
2001.
SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING.
Stochastic Models,
Vol. 17,
Issue. 1,
p.
61.
Pechinkin, A. V.
2001.
The Map/G//1/$\infty$ Queue with SRPT Service Discipline.
Theory of Probability & Its Applications,
Vol. 45,
Issue. 3,
p.
532.
Bansal, Nikhil
2003.
Analysis of the M/G/1 processor-sharing queue with bulk arrivals.
Operations Research Letters,
Vol. 31,
Issue. 5,
p.
401.
Li, Quan-Lin
Lian, Zhaotong
and
Liu, Liming
2005.
AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue.
Stochastic Models,
Vol. 21,
Issue. 2-3,
p.
507.
Avrachenkov, K.
Ayesta, U.
Brown, P.
and
Nunez-Queija, R.
2005.
Discriminatory processor sharing revisited.
Vol. 2,
Issue. ,
p.
784.
Cheung, Sing-Kong
van den Berg, Hans
and
Boucherie, Richard J.
2006.
Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue.
Queueing Systems,
Vol. 53,
Issue. 1-2,
p.
7.
Altman, Eitan
Avrachenkov, Konstantin
and
Ayesta, Urtzi
2006.
A survey on discriminatory processor sharing.
Queueing Systems,
Vol. 53,
Issue. 1-2,
p.
53.
Li, Quan-Lin
and
Lin, Chuang
2006.
The M/G/1 processor-sharing queue with disasters.
Computers & Mathematics with Applications,
Vol. 51,
Issue. 6-7,
p.
987.
Aalto, Samuli
Ayesta, Urtzi
Borst, Sem
Misra, Vishal
and
Núñez-Queija, Rudesindo
2007.
Beyond processor sharing.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 34,
Issue. 4,
p.
36.
Yashkov, S. F.
and
Yashkova, A. S.
2007.
Processor sharing: A survey of the mathematical theory.
Automation and Remote Control,
Vol. 68,
Issue. 9,
p.
1662.
Altman, Eitan
and
Fiems, Dieter
2007.
Expected waiting time in symmetric polling systems with correlated walking times.
Queueing Systems,
Vol. 56,
Issue. 3-4,
p.
241.
Egorova, Regina
and
Zwart, Bert
2007.
Tail behavior of conditional sojourn times in Processor-Sharing queues.
Queueing Systems,
Vol. 55,
Issue. 2,
p.
107.
Verloop, I. M.
Ayesta, U.
and
Núñez-Queija, R.
2009.
Heavy-traffic analysis of the M/PH/1 discriminatory processor sharing queue with phase-dependent weights.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 37,
Issue. 2,
p.
42.
Milovanova, T. A.
2009.
BMAP/G/1/∞ system with last come first served probabilistic priority.
Automation and Remote Control,
Vol. 70,
Issue. 5,
p.
885.
Altman, Eitan
2009.
Semi-linear Stochastic Difference Equations.
Discrete Event Dynamic Systems,
Vol. 19,
Issue. 1,
p.
115.
Cascone, A.
Manzo, R.
Pechinkin, A. V.
and
Salerno, S.
2010.
Discrete-time MAP/G/1/∞ system with inversive probabilistic servicing discipline.
Automation and Remote Control,
Vol. 71,
Issue. 12,
p.
2547.