Decomposing Banyan Networks for Performance Analysis

Authors:
U. Garg;Y. -P. Huang
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 0
Cited 4

The representation of multistage interconnection networks in queuing models of parallel systems

Journal of the ACM (JACM)
Traffic studies of unbuffered Delta networks

IBM Journal of Research and Development
Correction to "Decomposing Banyan Networks for Performance Analysis"

IEEE Transactions on Computers
A modular growth architecture for an ATM switch

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

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 to increase significantly; also the reduction in network size at successive stages is utilized to increase the computational efficiency.