Results 281 to 290 of about 16,132 (297)
Some of the next articles are maybe not open access.
On a Processor Sharing Queue that models balking
2009We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others in the system "balks" (i.e., decides not to enter) with probability 1 - bn. If bn is inversely proportional to n + 1, we obtain explicit expressions for a tagged customer’s sojourn time distribution.
Zhen, Q. +2 more
openaire +2 more sources
Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues
Stochastic Systems, 2022Varun Gupta, Jiheng Zhang
exaly
AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
Stochastic Models, 2005Quan-Lin Li +2 more
exaly
An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
Stochastic Models, 1992Bhaskar Sengupta
exaly
Reneging from Processor Sharing Systems and Random Queues
Mathematics of Operations Research, 1990David Assaf, Moshe Haviv
exaly
Law of Large Number Limits of Limited Processor-Sharing Queues
Mathematics of Operations Research, 2009Jiheng Zhang, J G Dai, Bert Zwart
exaly
Fluid Limits for Processor-Sharing Queues with Impatience
Mathematics of Operations Research, 2008H Christian Gromoll, Bert Zwart
exaly

