This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decomposing Banyan Networks for Performance Analysis
March 1988 (vol. 37 no. 3)
pp. 371-376
A general form of input-destination distribution matrix increases state space exorbitantly, thus making any buffer at every state statistically different from another. Certain specific forms of input-destination distribution matrix to which many real-life cases may conform, are analyzed. The idea called decomposition is applied here for specific nonhomogeneous flows. State space is not allowed

[1] Y. C. Jenq, "Performance analysis of a packet switch based on single-buffered banyan network,"IEEE J. Select. Areas Commun., vol. SAC-1, no. 6, pp. 1014-1021, Dec. 1983.
[2] S. Cheemalavagu and M. Malek, "Analysis and simulation of banyan interconnection networks with 2×2, 4×4 and 8×8 switching elements," inProc. 1982 Real-Time Syst. Symp., Los Angeles, CA, Dec. 1982.
[3] U. Garg and Y. P. Huang, "Performance analysis of multibuffer banyan networks," submitted for presentation inThirteenth IASTED Int. Conf., Lugano, Switzerland, June 24-26, 1985.
[4] U. Garg and Y. P. Huang, "Multi-destination flow banyan networks-Modelling and performance analysis," submitted for presentation inThirteenth IASTED Int. Conf., Lugano, Switzerland, June 24-26, 1985.

Index Terms:
banyan networks decomposing; performance analysis; input-destination distribution matrix; nonhomogeneous flows; computational efficiency; computer networks; packet switching.
Citation:
U. Garg, Y.-P. Huang, "Decomposing Banyan Networks for Performance Analysis," IEEE Transactions on Computers, vol. 37, no. 3, pp. 371-376, March 1988, doi:10.1109/12.2177
Usage of this product signifies your acceptance of the Terms of Use.