{"title":"A Method for Evaluating Message Communication in Faulty Hypercubes","authors":"M. Peercy, P. Banerjee","doi":"10.1109/DMCC.1990.556407","DOIUrl":null,"url":null,"abstract":"In this paper we present an evaluation of communication in the network of a faulty hypercube using an approximate analytical model and a detailed simulation model. We asume the hypercube has a deterministic routing strategy. Consequently, we are able to use simple models to derive the traffic on each link. Additionally, we develop a theory with which we find the message delay not only in packet-switched hypercube networks, but in the more current circuit-switched networks as well. Thus we can examine the degradation from ideal communication performance due to different fault patterns and different reroute strategies we may use to compensate for faults. We next describe a program, EASY, which implements our approximate analysis along with simulation for detailed evaluation of message communication. We include a comparison of our theoretical evaluation with simulation. We also include a brief comparison of reroute techniques for faulty hypercubes.","PeriodicalId":204431,"journal":{"name":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth Distributed Memory Computing Conference, 1990.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1990.556407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper we present an evaluation of communication in the network of a faulty hypercube using an approximate analytical model and a detailed simulation model. We asume the hypercube has a deterministic routing strategy. Consequently, we are able to use simple models to derive the traffic on each link. Additionally, we develop a theory with which we find the message delay not only in packet-switched hypercube networks, but in the more current circuit-switched networks as well. Thus we can examine the degradation from ideal communication performance due to different fault patterns and different reroute strategies we may use to compensate for faults. We next describe a program, EASY, which implements our approximate analysis along with simulation for detailed evaluation of message communication. We include a comparison of our theoretical evaluation with simulation. We also include a brief comparison of reroute techniques for faulty hypercubes.