Knessl Charles

Charles Knessl

Information about the author Charles Knessl will soon be added to the site.
Found 22 papers in total
On spectral properties of finite population processor shared queues
On spectral properties of finite population processor shared queues
2013
We consider sojourn or response times in processor‐shared queues that have a...
Wireless three‐hop networks with stealing II: exact solutions through boundary value problems
Wireless three‐hop networks with stealing II: exact solutions through boundary value problems
2013
We study the stationary distribution of a random walk in the quarter plane arising in...
Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue
Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue
2010
We consider the M / G /1 queue with a processor sharing server. We study the...
Asymptotic analysis by the saddle point method of the Anick–Mitra–Sondhi model
Asymptotic analysis by the saddle point method of the Anick–Mitra–Sondhi model
2004
We consider a fluid queue where the input process consists of N identical sources that...
Asymptotic expansions for the congestion period for the M/M/∞ queue
Asymptotic expansions for the congestion period for the M/M/∞ queue
2001
We consider the M/M/ ∞ queue with arrival rate λ, service rate μ and...
An exact solution for an M(t)/M(t)/1 queue with time-dependent arrivals and service
An exact solution for an M(t)/M(t)/1 queue with time-dependent arrivals and service
2002
We consider an M/M/ 1 queue with a time dependent arrival rate λ( t ) and...
Exact and asymptotic solutions to a PDE that arises in time-dependent queues
Exact and asymptotic solutions to a PDE that arises in time-dependent queues
2000
We consider a diffusing particle in one dimension that is subject to a time-dependent...
An explicit solution to a tandem queueing model
An explicit solution to a tandem queueing model
1998
We consider two queues in tandem, each with an exponential server, and with...
A diffusion model for two tandem queues with general renewal input
A diffusion model for two tandem queues with general renewal input
1999
We consider two tandem queues with exponential servers. Arrivals to the first queue...
A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks
A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks
1999
A queueing system (M/G 1 , G 2 /1/K) is considered in which the service time of a...
A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
1996
We consider two parallel M/M/1 queues which are fed by a single Poisson arrival...
Application of singular perturbation methods in queueing
Application of singular perturbation methods in queueing
1995
A survey is presented describing the application of singular perturbation techniques...
Mean time for the development of large workloads and large queue lengths in the GI/G/1 queue
Mean time for the development of large workloads and large queue lengths in the GI/G/1 queue
1996
The authors consider the GI/G/1 queue described by either the workload U(t)...
Asymptotic properties of first passage times for tandem Jackson networks I: Buildup of large queue lengths
Asymptotic properties of first passage times for tandem Jackson networks I: Buildup of large queue lengths
1995
The authors consider d M/M/1 queues in series. Asymptotic expansions are constructed...
Heavy traffic asymptotics for a gated, infinite-server queue with uniform service times
Heavy traffic asymptotics for a gated, infinite-server queue with uniform service times
1994
The authors consider a gated, infinite-server queue with uniform service times. Using...
A processor-shared queue that models switching times: Heavy usage asymptotics
A processor-shared queue that models switching times: Heavy usage asymptotics
1994
A closed processor-sharing queueing model that corresponds to M terminals in series...
On the distribution of the maximum number of broken machines for the repairman problem
On the distribution of the maximum number of broken machines for the repairman problem
1994
The repairman problem is considered where a single repairman services M identical...
Conditional sojourn time moments in the finite capacity GI/M/1 queue with processor-sharing service
Conditional sojourn time moments in the finite capacity GI/M/1 queue with processor-sharing service
1993
This paper considers a processor-sharing GI/M/1 queue that can hold at most K...
A finite capacity PS queue which models switching times
A finite capacity PS queue which models switching times
1993
A processor-sharing queue is considered that has a finite capacity of jobs and a...
On the transient behavior of the Erlang loss model: Heavy usage asymptotics
On the transient behavior of the Erlang loss model: Heavy usage asymptotics
1993
The Erlang loss model, which is the M/M/m/m queue is considered. Asymptotic expansions...
On the transient behavior of the repairman problem
On the transient behavior of the repairman problem
1991
The paper considers the repairman problem which corresponds to the finite population...
Refinements to heavy traffic limit theorems in queueing theory
Refinements to heavy traffic limit theorems in queueing theory
1990
The paper considers single server M/G/1 and GI/G/1 queues in the limit of heavy...
Papers per page: