The performance of single-buffered banyan networks under certain nonuniform traffic patterns had been studied by Garg and Huang. However, the models used are over simplified and the results obtained may deviate from exact values significantly. Alternative models to achieve more accurate performance estimates are presented. In our models, the destinations of blocked packets residing in the buffers of nodes at stage 1 (and perhaps stage 2, depending on the traffic matrix) are memorised. Compared with those adopted by Garg and Huang, our models are only slightly more complicated. By viewing banyan networks as queueing systems, we apply Little's formula to compute the average packet delays.
|Number of pages||7|
|Journal||IEE Proceedings E: Computers and Digital Techniques|
|State||Published - 1 Jan 1991|