We present the results of a parametric study of the buffer size needed to prevent overflow or
loss in single and multiple server systems where data arrivals or service times are" bursty"," …

We present the results of a parametric study of the bu er size needed to prevent over ow or
loss in single and multiple server systems where data arrivals or service times …

We present new exact formulas for calculating bu er over ow probabilities for various single
server queues. We then present the results of a parametric study of the bu er size needed to …

Measurements of file sizes transported on the World-Wide-Web have led some researchers
to propose describing them by probability distributions with infinite variance. The M/G/1 …

This paper studies the tail of the buffer occupancy distribution of a queueing system with c
parallel deterministic servers, infinite buffer capacity and an input process with consists of a …

This paper presents the large-buffer asymptotics for a multiplexer which serves N types of
heterogeneous sessions which have long-tailed session lengths. Specifically, the model …

While the warnings given to designers of telecommunications networks are no doubt correct,
the statistical analyses have not revealed how either simulation or analytic techniques can …

In this paper we have considered several queueing systems with finite buffers and long-
tailed arrivals. For these queueing systems we have derived explicit asymptotic formulas for …

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

The behavior of buffers in computer communication systems is studied under the following
conditions:(i) infinite buffer size;(ii) periodic opportunities for service (synchronous …