TL;DR
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.
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...
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.
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.
This paper presents a method for graph simplification that aims to improve routing efficiency in large-scale communication networks. The approach identifies rings—linear chains of degree-2 vertices decorated with pendant trees and attached to the rest of the network via two connection points. In the simplified represen...
Resource placement is a problem with several applications in communications networks, from the placement of caches, proxies, or even servers to the allocation of controllers in software-defined networks, among others. This work introduces the problem of placing the minimum number of resources that maximizes the number...
Johnson graphs $J(n,k)$ are a classical family of highly symmetric networks known to be Hamiltonian-connected in the fault-free setting. In this paper, we investigate their Hamiltonian connectivity under three failure models, namely general edge faults, matching faults, and vertex faults. For general edge faults, we pr...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
