This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
November 1979 (vol. 5 no. 6)
pp. 631-642
P. Caseau, Service Informatique et Mathematiques Appliquees, Direction des Etudes et Recherches, Electricite de France
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.
Index Terms:
virtual memories, Computer communication, operating systems, queueing systems
Citation:
P. Caseau, G. Pujolle, "Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room," IEEE Transactions on Software Engineering, vol. 5, no. 6, pp. 631-642, Nov. 1979, doi:10.1109/TSE.1979.230199
Usage of this product signifies your acceptance of the Terms of Use.