Abstract
Abstract Banyan networks are applicable for interconnecting memory and processor modules in multiprocessor systems as well as for packet switching in communication networks. This paper develops a queueing model for analyzing asynchronous buffered multistage networks. We assume that message inputs form a Poisson process. Each message consists of a geometrically‐distributed number of packets. The transmission time for each packet is generally distributed. Closed‐form expressions for the mean and variance of the number of packets stored at each node and the average time for a packet to traverse a network are obtained. It is shown that under light and medium traffic conditions, analytic and simulation results are in close agreement.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
