An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph

An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph
复制标题

星图自适应分布式容错路由算法

DOI：
10.1007/3-540-63890-3_8
复制
发表时间：
1997
期刊：
--
影响因子：
--
通讯作者：
Hajime Maeda
Hajime Maeda
中科院分区：
--
文献类型：
--
作者：
Leqiang Bai;H. Ebara;Hideo Nakano;Hajime Maeda

文献摘要

被引文献

相似文献

提出了一种适用于n星图的自适应分布式容错路由算法。该算法基于局部故障信息和星图的特性，可以在没有死锁和活锁的情况下做出路由决策。在遇到故障后，该算法通过查找无故障1星图将消息路由到给定的目的地。只要故障数（节点故障和/或边缘故障）小于星图的degreen - 1，算法就能自适应地找到一条长度不超过+ 6f的路径，将消息从一个源路由到一个目标，其中为两个节点之间的距离。
This paper presents an adaptive distributed fault-tolerant routing algorithm for the n-star graph. Based on the local failure information and the properties of the star graph, the algorithm can make routing decisions without deadlock and livelock. After faults are encountered, the algorithm routes messages to a given destination by finding a fault-freen—1-star graph. As long as the numberfof faults (node faults and/or edge faults) is less than the degreen− 1 of then-star graph, the algorithm can adaptively find a path of length at mostd+ 6fto route messages from a source to a destination, wheredis the distance between tow nodes.