基于并行分支的故障超立方体组播路由算法

EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439) Pub Date : 2001-07-04 DOI:10.1109/EURCON.2001.937765

S. Gunes, N. Yilmaz, N. Allahverdi

{"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}

引用次数: 3

摘要

针对故障超立方体并行处理系统，提出了一种基于并行分支方法的组播路由算法。该算法可以保证在最短的时间内从源节点路由到目的节点。从源到目的地的每一步都是一个并行的过程。与以往的研究相比，该算法的优点是在不受故障节点数量限制的情况下，以最小的步数实现从源到目的的路由。这意味着算法的运行与故障节点的数量无关。利用超立方体路由模拟器对该算法进行了仿真。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)

自引率

0.00%

发文量