In the design and operation of service systems, it is important to determine an appropriate level of server utilization (the proportion of time each server should be working). In a multi-server queue with unlimited waiting space, the appropriate server utilization typically increases as the...

S. L. Albin has described extensive simulations of queue behavior for a system with a single server and an arrival process that is a superposition of n renewal processes. The simulations show, among other things, that as n increases for a fixed traffic intensity \rho, the queue behavior...

We propose using a modification of the simple peak hour approximation (SPHA) for estimating peak congestion in multiserver queueing systems with exponential service times and time-varying periodic Poisson arrivals. This lagged pointwise stationary approximation (lagged PSA) is obtained by first...

Some sharp bounds and simple approximations are obtained for the Erlang delay formula and for the Erlang loss formula. One of the results is then used to get a simple analytical solution for the Server Allocation Problem.

We empirically explore the accuracy of the simple stationary peak hour approximation (SPHA) for estimating peak hour performance in multiserver queuing systems with exponential service times and periodic (sinusoidal) Poisson arrival processes. We show that the SPHA is very good for a range of...

In this paper we describe the mean number of busy servers as a function of time in an M_t/G/\infty queue (having a nonhomogeneous Poisson arrival process) with a sinusoidal arrival rate function. For an M_t/G/\infty model with appropriate initial conditions, it is known that the number of busy...