𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An analysis of an approximation algorithm for queueing networks

✍ Scribed by Derek L Eager; Kenneth C Sevcik

Book ID
118396611
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
628 KB
Volume
4
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximate compositional approach to
An approximate compositional approach to the analysis of fluid queue networks
✍ A.J. Field; P.G. Harrison πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 413 KB

Fluid models have for some time been used to approximate stochastic networks with discrete state. These range from traditional 'heavy traffic' approximations to the recent advances in bio-chemical system models. Here we present a simple approximate compositional method for analysing a network of flu

An approximation for computing the throu
An approximation for computing the throughput of closed assembly-type queueing networks
✍ Hayriye Ayhan; Martin A. Wortman πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 225 KB

In this paper, we examine throughput (mean number of completed assemblies per unit time) of closed assembly type queueing networks where machine processing times are drawn from general distributions. The system dynamics are characterized via a set of stochastic dierence equations; it is shown that t