Los generadores de circulación optimizados alcanzan la tolerancia de error dentro de 1.63x del límite inferior

Optimized circulant interconnection networks achieve fault-tolerant two-hop communication within a factor of 1.16 to 1.63 of the counting lower bound, based on a sweep of 526,539 generator sets. That gap is tight enough that you can design a network knowing almost exactly how many alternative relays you need to survive f simultaneous failures.

The Degree-Redundancy Landscape

Given n nodes and a degree budget m, the paper defines R(n,m) as the worst-case number of shared relays for any ordered terminal pair. A shared relay is a node with outgoing links to both terminals, and an f-relay-fault-tolerant circulant demands at least f+1 such relays per pair. The underlying feasibility condition reduces to a cyclic difference-multiplicity condition, which the authors use as a mathematical scalpel rather than a new formalism.

The key result: optimized threshold designs hit f-relay-fault tolerance within 1.16 - 1.63x the counting lower bound. That number comes from an exhaustive sweep of 526,539 generator sets across various n and m, paired with a microbenchmark to compare software lookup versus search for relay-table precomputation.

Why Interval Generators Fail

Standard interval generators (the typical construction where each node connects to a contiguous range of offsets) do not just perform worse, they fail structurally. The paper proves a negative theorem: interval circulants can lose all shared relays for some terminal pairs even when the degree budget is much larger than the counting lower bound. That is a concrete warning for anyone building circulant topologies from textbook templates without checking the redundancy landscape.

The 526,539-Generator Sweep

The reproducible study covers exact calibration for small n, certified upper bounds on heuristic designs, and adversarial versus random failure guarantees. The authors also provide relay-table preprocessing algorithms that turn the mathematical condition into practical lookup, with a microbenchmark showing the search-vs-lookup tradeoff. Load-balance scope is discussed as a secondary concern: you can distribute relay load across the available shared relays without breaking the fault-tolerance bound.

For network architects designing fault-tolerant topologies with symmetric addressing and uniform local connectivity, this paper gives you a principled way to choose generators instead of guessing. The next step is extending the two-hop primitive to longer paths and verifying that the 1.16 - 1.63 ratio holds under those constraints.

Source: Fault-Tolerant Shared-Relay Communication in Circulant Interconnection Networks
Domain: arxiv.org