In this paper, we propose a class of queueing network models, and a method for their
approximate solution, for computer networks with bursty traffic and finite buffer space. The …

Service time distributions at computer processing units are often nonexponential. Empirical
studies show that different programs may have markedly different processing time …

A general framework is provided to derive analytic error bounds for the effect of
perturbations and inaccuracies of nonexponential service or arrival distributions in single …

This paper presents new results concerning the use of information theoretic inference
techniques in system modeling and concerning the widespread applicability of certain …

In this paper, we study the buffer queueing behaviour in high-speed networks. Some limited
analytical derivations of queue models have been proposed in literature but their solutions …

We study P ({Q> x}), the tail of the steady state queue length distribution at a high-speed
multiplexer. The tail probability distribution P ({Q> x}) is a fundamental measure of network …

Closed queueing networks have been widely used to model many types of service networks.
For example, a closed queueing network model for multi-tier Internet services and …

In a previous issue of this journal, Prabhu [1] published a bibliography of books on queueing
systems which also includes books on computer performance and data communication …

The major impetus for the study of networks of queues is the relevance of such networks to
performance studies of computer systems. As the theory of networks of queues evolves …