Different interconnection structures exert a significant impact on network communication ability, directly influencing system performance. The half hypercube Network has an excellent topology that can provide high network fault tolerance and communication efficiency while maintaining a low node degree. In this paper, we investigate efficient and reliable communication algorithms for half hypercube networks in distributed system. Firstly, we design a disjoint path construction algorithm for a half hypercube, which enables reliable communication of the optimal number of disjoint paths between any two nodes in the network. Secondly, we present a fault-tolerant path embedding algorithm for a half hypercube. When the number of faulty nodes does not exceed ⌈n/2⌉, this algorithm can obtain a fault-tolerant unicast path between any two non-faulty nodes in ann-dimensional half hypercube network. Finally, we evaluate the performance of communication algorithms through simulation experiments and real testbed. Experimental results demonstrate that the efficiency and buffer utilization rate of the proposed algorithms can be improved by at least 21.8% and 15.6%, respectively. Testbed results show that the data delivery rate increased by 21.8%, and the path interference degree decreased by 32.5%.

ABSTRACT With the increasingly widespread application of multiprocessor systems, some processors in multiprocessor systems are inevitably prone to malfunctions. The reliability and effectiveness of the system are key issues. As a standard for measuring system fault tolerance, connectivity, and edge connectivity have many drawbacks. Therefore, Haray proposed conditional connectivity by restricting the connected components in disconnected subgraphs to satisfy certain properties, where and represent the interconnection network and its set of faulty vertices, respectively. Restricted connectivity is a special type of conditional connectivity. Exchanged crossed cube, as a deformation of hypercube, has more favorable properties, such as smaller diameter, smaller link size, and lower cost. We prove that the 2‐restricted connectivity of the exchanged crossed cubes is for .

The design and optimization of network topologies play a critical role in ensuring the performance and efficiency of high-performance computing (HPC) systems. Traditional topology designs often fall short in satisfying the stringent requirements of HPC environments, particularly with respect to fault tolerance, latency, and bandwidth. To address these limitations, we propose a novel class of hierarchical networks, termed Hypercube-Structured Hierarchical Networks (HHNs). This architecture generalizes and extends existing architectures such as half hypercube networks and complete cubic networks, while also introducing previously unexplored hierarchical designs. HHNs exhibit several advantages, particularly in high-performance computing. Most notably, their high connectivity enables efficient parallel data processing, and their hierarchical structure supports scalability to accommodate growing computational demands. Furthermore, we present a unicast routing strategy and a broadcast algorithm for HHNs. A fault-tolerant algorithm is also designed based on the construction of disjoint paths. Experimental evaluations demonstrate that HHNs consistently outperform mainstream architectures in critical performance metrics, including scalability, latency, and robustness to failures.

Malicious attackers frequently aim to partition the network into disjointed segments to facilitate specific attacks. Consequently, enhancing network reliability stands as an effective preventive measure. Connectivity serves as a crucial metric for gauging network reliability, yet classical connectivity inadequately captures a network's fault tolerance in the face of such attacks. To address this, cluster connectivity has been proposed, considering the faults within clusters to improve fault tolerance assessment. In this paper, we establish the cluster connectivity of the half hypercube network HHn. In detail, we show that the K1,1-cluster connectivity of HHnis $\left\lfloor {n/2} \right\rfloor + 1$, where n ≥ 3, and the K1,r- cluster connectivity of HHnis $\left\lceil {\frac{{\left\lceil {n/2} \right\rceil }}{2}} \right\rceil + 1$, where n ≥ 5 and 2 ≤ r ≤ 4, which is almost r times the classical connectivity. This indicates that the network possesses an enhanced capacity to accommodate a greater number of faulty nodes, potentially enabling more effective orchestration of attacks.