{"title":"基于并行分支的故障超立方体组播路由算法","authors":"S. Gunes, N. Yilmaz, N. Allahverdi","doi":"10.1109/EURCON.2001.937765","DOIUrl":null,"url":null,"abstract":"In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"242 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A multicast routing algorithm based on parallel branching method for faulty hypercubes\",\"authors\":\"S. Gunes, N. Yilmaz, N. Allahverdi\",\"doi\":\"10.1109/EURCON.2001.937765\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.\",\"PeriodicalId\":205662,\"journal\":{\"name\":\"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)\",\"volume\":\"242 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURCON.2001.937765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2001.937765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multicast routing algorithm based on parallel branching method for faulty hypercubes
In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
