DocumentCode
3349155
Title
Hierarchical interconnection networks: routing performance in the presence of faults
Author
Kim, Beomsu ; Youn, Hee Yong ; Kavi, Krishna M.
Author_Institution
Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
fYear
1992
fDate
1-4 Dec 1992
Firstpage
162
Lastpage
165
Abstract
The authors develop a Markov model which can effectively estimate the successful routing probability and internode distance of hierarchical interconnection networks in the presence of faults. A BH/BH (binary hypercube/binary hypercube) network is tested using the model and verified by computer simulations. Comparisons with computer simulation reveal that the proposed model is very accurate. The network performance, when all nodes generate messages, is also expected to be effectively evaluated with the model
Keywords
Markov processes; hypercube networks; performance evaluation; Markov model; binary hypercube/binary hypercube; computer simulations; hierarchical interconnection networks; internode distance; network performance; routing performance; routing probability; Computer networks; Computer science; Computer simulation; Concurrent computing; Delay; Fault tolerance; High performance computing; Intelligent networks; Multiprocessor interconnection networks; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location
Arlington, TX
Print_ISBN
0-8186-3200-3
Type
conf
DOI
10.1109/SPDP.1992.242749
Filename
242749
Link To Document