Cluster fault-tolerant routing in star graphs

Gu, Qian-Ping; Peng, Shietung

doi:10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-d

Cited by 14 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, fault-tolerant routing with an additional constraint regarding the nodes that can be selected has been discussed, for instance, in hypercubes [26]. Finally, routing algorithms based on the cluster-fault tolerant model have been proposed for burnt pancake graphs with a unicast algorithm [27], hypercubes with a unicast algorithm [28], a node-to-set and set-to-set disjoint paths routing algorithm [29] and a pairwise disjoint paths routing algorithm [30], and star graphs with a unicast algorithm [31] and a node-to-set and pairwise disjoint paths routing algorithm [32], amongst others.…”

Section: Previous and Related Workmentioning

confidence: 99%

Cluster-Fault Tolerant Routing in a Torus

Bossard

Kaneko

2020

Sensors

View full text Add to dashboard Cite

The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n -dimensional k -ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ⌊ k / 2 ⌋ − 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.

show abstract

Section: Previous and Related Workmentioning

confidence: 99%

Cluster-Fault Tolerant Routing in a Torus

Bossard

Kaneko

2020

Sensors

View full text Add to dashboard Cite

show abstract

“…. , d k } in a k-connected graph G(V, E) so that the paths P i are node-disjoint, or disjoint in short, except for s. The node-to-set disjoint paths problem [10]- [17] is as important as the node-to-node disjoint paths problem [18]- [22] and the set-to-set disjoint paths problem [23]- [28]. If an algorithm can solve the node-toset disjoint paths problem efficiently in a topology, it can be applied to improve the performance of the systems with networks based on the topology.…”

Section: Introductionmentioning

confidence: 99%

Node-to-Set Disjoint Paths Problem in Cross-Cubes

SASAKI,

ICHIDA,

KYAW

et al. 2024

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

The increasing demand for high-performance computing in recent years has led to active research on massively parallel systems. The interconnection network in a massively parallel system interconnects hundreds of thousands of processing elements so that they can process large tasks while communicating among others. By regarding the processing elements as nodes and the links between processing elements as edges, respectively, we can discuss various problems of interconnection networks in the framework of the graph theory. Many topologies have been proposed for interconnection networks of massively parallel systems. The hypercube is a very popular topology and it has many variants. The cross-cube is such a topology, which can be obtained by adding one extra edge to each node of the hypercube. The cross-cube reduces the diameter of the hypercube, and allows cycles of odd lengths. Therefore, we focus on the cross-cube and propose an algorithm that constructs disjoint paths from a node to a set of nodes. We give a proof of correctness of the algorithm. Also, we show that the time complexity and the maximum path length of the algorithm are O(n 3 log n) and 2n − 3, respectively. Moreover, we estimate that the average execution time of the algorithm is O(n 2 ) based on a computer experiment.

show abstract

“…One-to-many disjoint paths were designed on hypercubes [8,9] and star graphs [10]. For the generation of many-tomany disjoint paths some work has been done [11,12].…”

Section: Introductionmentioning

confidence: 99%

Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks

Chung¹

2013

Journal of Korea Multimedia Society

View full text Add to dashboard Cite

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping d i , where 0 ≤ i ≤ ⌈logd N⌉− 1. In this paper, we investigate the routing of a message on G(2 m ,4), a special kind of RCN, that is key to the performance of this network. On G(2 m ,4) we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the i th packet will be transmitted along the i th path, where 1≤k≤m−1, 0≤i

show abstract

Cluster fault-tolerant routing in star graphs

Cited by 14 publications

References 25 publications

Cluster-Fault Tolerant Routing in a Torus

Cluster-Fault Tolerant Routing in a Torus

Node-to-Set Disjoint Paths Problem in Cross-Cubes

Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks

Contact Info

Product

Resources

About