This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximate analysis of open networks of queues with blocking: Tandem configurations
March 1986 (vol. 12 no. 3)
pp. 450-461
H. G. Perros, Department of Computer Science, North Carolina State University, Raleigh, NC 27695
Tayfur Altiok, Department of Industrial Engineering, Rutgers University, Piscataway, NJ 08854
An approximation procedure is developed for the analysis of tandem configurations consisting of single server finite queues linked in series. External arrivals occur at the first queue which may be either finite or infinite. Departures from the queueing network may only occur from the last queue. All service times and interarrivai times are assumed to be exponentially distributed. The approximation algorithm gives results in the form of the marginal probability distribution of the number of units in each queue of the tandem configuration. Other performance measures, such as mean queue-length and throughput, can be readily obtained. The approximation procedure was validated using exact and simulation data. The approximate results seem to have an acceptable error level.
Index Terms:
Servers,Approximation methods,Approximation algorithms,Queueing analysis,Throughput,Algorithm design and analysis,Delay,queues in tandem,Approximations,blocking,Coxian queues,exponential distribution,finite queues
Citation:
H. G. Perros, Tayfur Altiok, "Approximate analysis of open networks of queues with blocking: Tandem configurations," IEEE Transactions on Software Engineering, vol. 12, no. 3, pp. 450-461, March 1986, doi:10.1109/TSE.1986.6312886
Usage of this product signifies your acceptance of the Terms of Use.