Simulation experiments are conducted to validate the fault tolerance and communication reliability of the complete cubic network, demonstrating that the cluster connectivity metrics provide a more appropriate characterization of network resilience under cluster fault scenarios than traditional measures.
A general lower bound for arbitrary r is established and a conjecture for the general case based on this result is proposed and an evolutionary search algorithm is developed to construct h-extra r-component cuts and independently verify their validity.
Li-Li Tian, Xiao-Wang Li, Le-Yi Jia et al.· Journal of Supercomputing· 0 citations
Processor interconnection networks provide the communication infrastructure for parallel computing, multiprocessor systems, many-core architectures, distributed computing, and high-performance computing. Their topology directly influences processor connectivity, communication distance, structural redundancy, fault tole...
Sushil Kumar Dwivedi, R. Katare· Advanced International Journ...· 0 citations
The results support HON as a simple low-degree construction for structured inter-group communication, whereas higher-radix, adaptive, or more richly connected fabrics remain better suited to less structured traffic and larger bandwidth demand.
Han Ni Soe, Yao Zhang, Zhi-Peng Xu· Parallel Processing Letters· 0 citations
Identifying critical satellites in Low Earth Orbit (LEO) communication constellations is important for understanding network resilience. Classical centrality measures often do not account for two characteristics of LEO inter-satellite link topologies: the frequent presence of cut-vertices due to sparse connectivity, an...
Zheng-Nan Liu, Zhong-Hua Li, Xiao-Lian Gao et al.· 2026 8th International Confe...· 0 citations
Networks are often modeled using graphs, and within this setting we introduce the notion of ‐fault‐tolerant mutual visibility. Informally, a set of vertices in a graph is a ‐fault‐tolerant mutual‐visibility set (‐ftmv set) if any two non‐adjacent vertices in are connected by a bundle of shortest paths such that: () e...
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar et al.· Networks· 0 citations
Smart cities rely on resilient network topologies for reliable service delivery, yet tools for analyzing them remain limited. This study evaluates our Smart City Network Topology Graph Generator (SCGG), which creates pseudo‐random topologies with the multilayered, clustered structure of smart city networks. SCGG is c...
Nouf A. S. Alsowaygh, I. Alablani, Maazen S. Alsabaan et al.· Concurrency and Computation· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.