DocumentCode
909680
Title
Decomposing banyan networks for performance analysis
Author
Garg, Udai ; Huang, Yo-Ping
Author_Institution
Dept. of Electr. Eng., Tatung Inst. of Technol., Taipei, Taiwan
Volume
37
Issue
3
fYear
1988
fDate
3/1/1988 12:00:00 AM
Firstpage
371
Lastpage
376
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
Keywords
computer networks; packet switching; banyan networks decomposing; computational efficiency; input-destination distribution matrix; nonhomogeneous flows; performance analysis; Associative memory; Computational efficiency; Content based retrieval; Couplings; Design methodology; Matrix decomposition; Performance analysis; State-space methods; Stochastic processes; Switches;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.2177
Filename
2177
Link To Document