Queue lengths and departures at single-server resources
By: Neil O'Connell.
Contributors: Hewlett-Packard Laboratories.
Series: [Technical report] / HP Laboratories Bristol. Basic Research Institute in the Mathematical Sciences -- HPL-BRIMS-96-04.; BRIMS technical report -- HPL-BRIMS-96-04.
Publisher: Hewlett Packard
Published: 1996
Place of publication: Bristol [England]
Language: eng
Number of pages: 17
Subjects: Queuing theory; Computer networks -- Workload
Description: Abstract: "In this paper I will review and illustrate some large deviation results for queues with interacting traffic, both for shared buffer and shared capacity models. These results are examples of a general scheme which can be applied to an endless variety of network problems where the goal is to establish probability approximations for aspects of a system (such as queue lengths) under very general ergodicity and mixing assumptions about the network inputs."
Notes: Cover title.

"To appear in the Proceedings of the Royal Statistical Society Research Workshop on Stochastic Networks, Edinburgh, 1995."--P. 1.

"February, 1996."

Includes bibliographical references.