This paper investigates the asymptotic behavior of a single server queue with truncated
heavy-tailed arrival sequences. We have discovered and explicitly asymptotically …

In studying or designing parallel and distributed systems one should have available a robust
analytical model that includes the major parameters that determine the system performance …

We develop a numerically exact method for evaluating the time-dependent mean, variance,
and higher-order moments of the number of entities in a Pht/Pht/∞ queueing system. We …

Analytical lower and upper bounds for the throughput of closed queueing networks with
single and delay (infinite) servers are studied in this paper. The numerical evaluation of …

We consider two simple models of overhead in batch computer systems and demand access
communications systems. The first, termed “modified M/M/1/K,” is an exponential, single …

Single server queues with hyperexponential service times<link href='#fn1'></link> Page 1
SINGLE SERVER QUEUES WITH HYPEREXPONENTIAL SERVICE TIi\IES* Irwin …

Queueing networks are known to provide a useful modelling and evaluation tool in computer
and telecommunications. Unfortunately, realistic features like finite capacities, link failures …

In this paper, a discrete-time multiserver queueing system with infinite buffer size and
general independent arrivals is considered. The service times of packets are assumed to be …

We consider a model of an open exponential queuing network where each node comprises
several multi-class MR/M/1 queues that share a common waiting space (a buffer) of limited …