activity
20092013
most citedOn Sojourn Times in the Finite Capacity Queue with Processor Sharing

11 citations · 35 across the 10 of their papers we have counts for

collaborators
Showing 2009Show all

5 papers · 1 filter

math.CA2009★ 5 cited

Asymptotic Expansions for the Conditional Sojourn Time Distribution in the -PS Queue

Qiang Zhen, Charles Knessl

We consider the queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic l…

math.PR2009★ 11 cited

On Sojourn Times in the Finite Capacity Queue with Processor Sharing

Qiang Zhen, Charles Knessl

We consider a processor shared queue that can accommodate at most a finite number of customers. We give an exact expression for the sojourn time distribution in the fin…

math.PR2009★ 5 cited

On a Processor Sharing Queue That Models Balking

Qiang Zhen, Johan S. H. van Leeuwaarden, Charles Knessl

We consider the processor sharing -PS queue which also models balking. A customer that arrives and sees others in the system "balks" (i.e., decides not to enter) with pr…

math.PR2009★ 4 cited

On Sojourn Times in the -PS Model, Conditioned on the Number of Other Users

Qiang Zhen, Charles Knessl

We consider the -PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers pr…

math.PR2009★ 4 cited

Asymptotic Expansions for the Sojourn Time Distribution in the -PS Queue

Qiang Zhen, Charles Knessl

We consider the queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the…