Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
- 1 November 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-5 (6) , 631-642
- https://doi.org/10.1109/tse.1979.230199
Abstract
A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of computer systems. In particular, the maximum throughput for a virtual memory operating system and for a node-to-node protocol in a computer network are obtained.Keywords
This publication has 15 references indexed in Scilit:
- A Queueing Model with Finite Waiting Room and BlockingJournal of the ACM, 1976
- Probabilistic models of computer systems?Part I (exact results)Acta Informatica, 1976
- On Approximate Computer System ModelsJournal of the ACM, 1975
- Communication networks: Message path delaysIEEE Transactions on Information Theory, 1974
- Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue DistributionsJournal of the ACM, 1974
- Busy Period Analysis of a Time-Sharing System Modeled as a Semi-Markov ProcessJournal of the ACM, 1971
- Two queues in series with a finite, intermediate waitingroomJournal of Applied Probability, 1968
- On the Capacity of Tandem Server, Finite Queue, Service SystemsOperations Research, 1968
- A Sequence of Two Servers with No Intermediate QueueManagement Science, 1965
- Sequential Arrays of Waiting LinesOperations Research, 1956