Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Ott, Teunis J.
1984.
The sojourn-time distribution in the M/G/1 queue by processor sharing.
Journal of Applied Probability,
Vol. 21,
Issue. 02,
p.
360.
Yashkov, S. F.
1987.
Processor-sharing queues: Some progress in analysis.
Queueing Systems,
Vol. 2,
Issue. 1,
p.
1.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1987.
Server sharing with a limited number of service positions and symmetric queues.
Journal of Applied Probability,
Vol. 24,
Issue. 04,
p.
990.
Foley, R. D.
and
Klutke, Georgia-Ann
1989.
Stationary increments in the accumulated work process in processor-sharing queues.
Journal of Applied Probability,
Vol. 26,
Issue. 3,
p.
671.
Jagerman, David L.
and
Sengupta, Bhaskar
1989.
A Functional Equation Arising in a Queue With a Gating Mechanism.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 3,
p.
417.
Sengupta, Bhaskar
1992.
An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 1,
p.
35.
Yashkov, S. F.
1992.
Mathematical problems in the theory of shared-processor systems.
Journal of Soviet Mathematics,
Vol. 58,
Issue. 2,
p.
101.
Rege, Kiran M.
and
Sengupta, Bhaskar
1994.
A decomposition theorem and related results for the discriminatory processor sharing queue.
Queueing Systems,
Vol. 18,
Issue. 3-4,
p.
333.
Kim, Jeongsim
and
Kim, Bara
2004.
Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing.
Performance Evaluation,
Vol. 58,
Issue. 4,
p.
341.
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.
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.
van den Berg, Hans
Mandjes, Michel
and
Roijers, Frank
2006.
Ad-Hoc, Mobile, and Wireless Networks.
Vol. 4104,
Issue. ,
p.
321.
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.
Kim, Jeongsim
and
Kim, Bara
2007.
The processor-sharing queue with bulk arrivals and phase-type services.
Performance Evaluation,
Vol. 64,
Issue. 4,
p.
277.
Lian, Z.
Liu, X.
and
Liu, L.
2008.
Discriminatory Processor Sharing Queues and the DREB Method.
Stochastic Models,
Vol. 24,
Issue. 1,
p.
19.
Kim, Jeongsim
and
Kim, Bara
2008.
Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals.
Queueing Systems,
Vol. 58,
Issue. 1,
p.
57.
Guillemin, Fabrice M.
and
Mazumdar, Ravi R.
2015.
Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks.
Journal of Applied Probability,
Vol. 52,
Issue. 4,
p.
962.
Guillemin, Fabrice M.
and
Mazumdar, Ravi R.
2015.
Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks.
Journal of Applied Probability,
Vol. 52,
Issue. 04,
p.
962.
Pender, Jamol
and
Zhang, Elena
2021.
Uniting Simulation and Machine Learning For Response Time Prediction In Processor Sharing Queues.
p.
1.
Fiems, Dieter
2022.
Retrial queues with generally distributed retrial times.
Queueing Systems,
Vol. 100,
Issue. 3-4,
p.
189.