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

10 papers

math.PR2013★ 1 cited

Some Asymptotic Results for the Transient Distribution of the Halfin-Whitt Diffusion Process

Qiang Zhen, Charles Knessl

We consider the Halfin-Whitt diffusion process , which is used, for example, as an approximation to the -server queue. We use recently obtained integral represen…

math.PR2013★ 2 cited

Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues

Qiang Zhen, Charles Knessl

We consider sojourn (or response) times in processor-shared queues that have a finite customer capacity. Computing the response time of a tagged customer involves solving a finite…

math.PR2013★ 3 cited

On Spectral Properties of Finite Population Processor Shared Queues

Qiang Zhen, Charles Knessl

We consider sojourn or response times in processor-shared queues that have a finite population of potential users. Computing the response time of a tagged customer involves solving…

math.PR2013

On the Sojourn Time Distribution in a Finite Population Markovian Processor Sharing Queue

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

We consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of…

math.CO2010

An Explicit Solution to the Chessboard Pebbling Problem

Qiang Zhen, Charles Knessl

We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations and a related double sequenc…

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…