A diffusion model for two parallel queues with processor sharing: Transient behavior and asymptotics.
Knessl, Charles (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Knessl, Charles (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Bell, S.L., Williams, R.J. (2005)
Electronic Journal of Probability [electronic only]
Similarity:
Frey, Andreas, Takahashi, Yoshitaka (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Ghosal, A., Madan, Sudhir (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Knessl, Charles, Tier, Charles (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kasahara, Shoji, Takagi, Hideaki, Takahashi, Yutaka, Hasegawa, Toshiharu (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kumar, M.Senthil, Arumuganathan, R. (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Natalia V. Djellab (2006)
The Yugoslav Journal of Operations Research
Similarity:
Choi, Bong Dae, Han, Dong Hwan, Falin, Guennadi (1993)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
George P. Cosmetatos, Gregory P. Prastacos (1985)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Kailash C. Madan, Walid Abu-Dayyeh (2002)
ESAIM: Probability and Statistics
Similarity:
We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various...
Natalia V. Djellab (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.