Fault-Tolerant Adaptive Routing in Dragonfly Networks

Xiang, Dong; Li, Bing; Fu, Yi

doi:10.1109/tdsc.2017.2693372

Cited by 27 publications

(4 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Penaranda et al [15] presented a fault-tolerant routing methodology for the KNS topology that degrades performance gracefully in the presence of faults and tolerates a reasonably large number of faults without disabling any healthy node. Xiang et al [16] used limited global safety information to study fault-tolerant routing in 2D tori or meshes, and then they [17] studied fault-tolerant efficient routing in dragonfly networks which have been widely used in the current high-performance computers or high-end servers. Robert et al [18] investigated a fault-tolerant routing strategy for k-ary n-direct s-indirect topologies based on intermediate nodes.…”

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Zhang

2021

Security and Communication Networks

View full text Add to dashboard Cite

As the core infrastructure of cloud computing, a large scale of the data center networks (DCNs), which consist of millions of servers with high capacity, suffer from node failure such that the reliability is deteriorated. Malicious group could inevitably compromise the quality and reliability of data; thus, how to ensure the security routing of data is an urgent practical problem. As models for large-scale DCNs, it is worth mentioning the balanced hypercube, which is well-known for its strong connectivity, regularity, and a smaller diameter. Each of which makes a balanced hypercube a trustworthy model to deal with data traffic and provides a certain degree of fault-tolerance as well. In this paper, we use the balanced hypercube as a model for the data center networks and design a reliable safety level by referring to different safety levels of related subgraph. This subgraph contains the source and destination nodes, and the shortest feasible paths are located so that the reliable transmission is achieved. Then, we get that the length of fault-tolerant safety routing of data center networks based on balanced hypercube is always no greater than the Hamming distance plus two. Experiment shows that our fault-tolerant security routing scheme is more effective in the same reliable network environment of DCNs.

show abstract

Section: Introductionmentioning

confidence: 99%

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Zhang

2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Zhang et al (2008) proposed a reconfigurable routing algorithm by adapting to the modification of the micro-network topology caused by a faulty router. Xiang et al (2019) proposed a new fault-tolerant routing algorithm for dragonfly networks by mapping the router groups and routers in a single group to hypercubes, therefore, the proposed fault-tolerant routing algorithm makes a packet avoids the faulty routers and link failures. Xiang and Liu (2016) proposed two different unicast-based broadcast algorithms for dragonfly networks in order to minimize the number of global link traversals.…”

Section: Related Workmentioning

confidence: 99%

Low-power and high-performance adaptive routing in on-chip networks

Xiang

Pan

2019

CCF Trans. HPC

Self Cite

View full text Add to dashboard Cite

Performance and power are two conflict requirements in a NoC. It is attractive to propose a low-power and high-performance routing scheme. A new low-power fully adaptive routing algorithm is proposed for virtual cut-through or wormhole switched networks-on-chip. The following new techniques are proposed: (1) multiple packets can be delivered across the same physical channel via different bypassing channels, (2) a low-power bypassing hop can include both x and y channels, (3) a new lowpower routing selection function is defined for more power reduction, (4) a new limited-global control signaling scheme is proposed, (5) a new cycle-accurate system-level power estimation model is proposed, and (6) bypassing hops of any lengths and the normal hops in the original network can share the same virtual channels. Simulation results are presented to evaluate the performance and power by comparison with some previous methods. Keywords Express virtual channels • Low-power routing • On-chip networks • System-level power estimation

show abstract

“…Considerable research efforts have been devoted to investigating a range of efficient network topologies for HPC systems, including Flattened Butterfly [9][10][11], Dragonfly [12][13][14], HyperX [15], Skywalk [16], and SlimFly [17]. These structures are capable of delivering low diameters for HPC systems while also ensuring scalability through the port numbers (radixes) of the construction blocks (routers) [18].…”

Section: Introductionmentioning

confidence: 99%

All-to-All Broadcast Algorithm in Galaxyfly Networks

Zhuang

Chang

et al. 2023

Mathematics

View full text Add to dashboard Cite

The design of interconnection networks is a fundamental aspect of high-performance computing (HPC) systems. Among the available topologies, the Galaxyfly network stands out as a low-diameter and flexible-radix network for HPC applications. Given the paramount importance of collective communication in HPC performance, in this paper, we present two different all-to-all broadcast algorithms for the Galaxyfly network, which adhere to the supernode-first rule and the router-first rule, respectively. Our performance evaluation validates their effectiveness and shows that the first algorithm has a higher degree of utilization of network channels, and that the second algorithm can significantly reduce the average time for routers to collect packets from the supernode.

show abstract

Fault-Tolerant Adaptive Routing in Dragonfly Networks

Cited by 27 publications

References 45 publications

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Low-power and high-performance adaptive routing in on-chip networks

All-to-All Broadcast Algorithm in Galaxyfly Networks

Contact Info

Product

Resources

About

Fault-Tolerant Adaptive Routing in Dragonfly Networks

Cited by 27 publications

References 45 publications

Fault-Tolerant Secure Routing of B H n -Based Data Center Networks

Fault-Tolerant Secure Routing of B H n -Based Data Center Networks

Low-power and high-performance adaptive routing in on-chip networks

All-to-All Broadcast Algorithm in Galaxyfly Networks

Contact Info

Product

Resources

About

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks

Fault-Tolerant Secure Routing of $B H_{n}$ -Based Data Center Networks