{"title":"互联网络中的自适应容错路由研究进展","authors":"B. Kumar, Dr. M. Venkata Rao, M. Prasad","doi":"10.18000/IJISAC.50090","DOIUrl":null,"url":null,"abstract":"A multi-processor / computer systems are connected by varieties of interconnection networks. To enable any non-faulty component (Node / Link) to communicate with any other non-faulty component in an injured interconnection network, the information on component failure is to be made available to non-faulty components, so as to route messages around the faulty components. In this paper we have reviewed to adaptive routing schemes proposed by Dally and Aloki, Glass and Ni, and also the implementation details of reliable router. Moreover, it is proved that these schemes of routing messages via shortest paths with high probability and the expected length of routing path is very close to that of shortest path.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"ADAPTIVE FAULT TOLERANT ROUTING IN INTERCONNECTION NETWORKS: A REVIEW\",\"authors\":\"B. Kumar, Dr. M. Venkata Rao, M. Prasad\",\"doi\":\"10.18000/IJISAC.50090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A multi-processor / computer systems are connected by varieties of interconnection networks. To enable any non-faulty component (Node / Link) to communicate with any other non-faulty component in an injured interconnection network, the information on component failure is to be made available to non-faulty components, so as to route messages around the faulty components. In this paper we have reviewed to adaptive routing schemes proposed by Dally and Aloki, Glass and Ni, and also the implementation details of reliable router. Moreover, it is proved that these schemes of routing messages via shortest paths with high probability and the expected length of routing path is very close to that of shortest path.\",\"PeriodicalId\":121456,\"journal\":{\"name\":\"International Journal on Information Sciences and Computing\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal on Information Sciences and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18000/IJISAC.50090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Information Sciences and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18000/IJISAC.50090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ADAPTIVE FAULT TOLERANT ROUTING IN INTERCONNECTION NETWORKS: A REVIEW
A multi-processor / computer systems are connected by varieties of interconnection networks. To enable any non-faulty component (Node / Link) to communicate with any other non-faulty component in an injured interconnection network, the information on component failure is to be made available to non-faulty components, so as to route messages around the faulty components. In this paper we have reviewed to adaptive routing schemes proposed by Dally and Aloki, Glass and Ni, and also the implementation details of reliable router. Moreover, it is proved that these schemes of routing messages via shortest paths with high probability and the expected length of routing path is very close to that of shortest path.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
