Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein--Jacobi Networks

Abstract: Dense Gaussian and Eisenstein--Jacobi (EJ) networks are algebraic interconnection networks with compact coordinate balls, fixed degree, and simple modular addressing. A source-centered coordinate-reduction tree gives a non-redundant one-to-all broadcast in the fault-free network, but processor faults can split the tree into multiple healthy components. Unlike search-based repair methods that require a linear scan of the network to select the repair plan, the certificate selectors introduced here operate in $O(1)$ time and $O(1)$ memory, consulting only the fault coordinates. This paper develops this stronger formulation for the one- and two-fault regime: a constant-time certificate selector. Given only the faulty coordinates, the selector classifies the relative fault geometry, chooses a coordinate-reduction orientation, and returns a bounded ordered set of component-crossing repair edges. For dense Gaussian networks $G_k$, every source-free fault set with $|F|\le2$ is repaired with depth at most $k+2$ and with exactly $c-1$ external component-crossing edges for the selected fault-pruned orientation. For dense EJ networks $H_t$, every one-fault placement is repaired within depth $t+1$, and every two-fault placement is repaired within depth $t+2$, again with exactly $c-1$ external repair edges. Exhaustive strict validation confirms the Gaussian selector over $146{,}156$ one- and two-fault cases for $k=5,\ldots,12$ and the EJ selector over $52{,}395$ cases for $t=2,\ldots,8$, with zero failures in connectivity, acyclicity, exact repair count, or depth bound.

• The paper presents a constant-time, certificate-based repair plan that computes optimal external edges for reconnecting fragmented broadcast trees in dense networks with up to two faults.
• It employs explicit algebraic case tables and symmetry normalization techniques for both Manhattan and hexagonal coordinate models to ensure non-redundant broadcast paths.
• Extensive validation confirms tight depth bounds and robust connectivity restoration, demonstrating zero failures in the tested Gaussian and Eisenstein–Jacobi network configurations.

Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein–Jacobi Networks

Introduction and Motivation

The paper "Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein--Jacobi Networks" (2606.21132) addresses the challenge of fault-tolerant, non-redundant one-to-all broadcast in algebraic network topologies—specifically, dense Gaussian and Eisenstein-Jacobi (EJ) networks. These networks are modeled as Cayley graphs with compact coordinate balls, fixed degrees, and modular addressability, which enable efficient broadcast routing. Traditional local repair approaches after processor faults rely on linear-time scans to identify and reconnect fragmented tree components, which can be computationally prohibitive for large networks. The paper introduces a constant-time, certificate-based method for selecting repair plans in the presence of up to two faults, relying solely on coordinate information of the faults.

Algebraic Network Models and Broadcast Tree Fragmentation

Dense Gaussian networks ($G_k$) use Manhattan balls in $\mathbb{Z}^2$ as their coordinate space, with degree-four connectivity. Dense EJ networks ($H_t$) utilize hexagonal coordinate balls with degree-six connectivity, leveraging complex arithmetic and Cayley graph symmetries. Broadcast in both networks follows a coordinate-reduction spanning tree, ensuring each healthy node receives the broadcast exactly once (non-redundant).

Fault-induced fragmentation splits the broadcast tree into $c$ healthy components; the minimum necessary repair plan must introduce exactly $c-1$ external component-crossing edges to restore connectivity without redundant transmissions. The theoretical lower bound for repairs is derived from graph contraction arguments.

Certificate Selector Construction and Operation

The paper establishes a certificate-selection framework leveraging explicit algebraic case tables, symmetry normalization, and modular edge adjacency tests. The repair plan is computed by a selector using:

• Fault geometry classification (e.g., axis membership, sector/ray relations)
• Selection of a broadcast tree orientation suited to fault placement
• Constant-size repair edge formula tables for candidate reconnections

Each repair edge is evaluated for validity based on healthy/non-faulty status, adjacency, and component separation. The selector operates in $O(1)$ time and memory regardless of network size, providing only the repair plan; materializing the full broadcast tree remains $O(N)$ due to output linearity.

Gaussian Network Results

For $|F| \leq 2$ in $G_k$, the selector finds a repair achieving:

• Depth at most $k + 2$ (tight bound)
• Exact $\mathbb{Z}^2$0 external repair edges for each produced component
• Robust handling of hard fragmentation cases (e.g., orthogonal-axis cuts yielding up to five components via the O6 certificate)
• Resolution of blocking and boundary wraparound through algebraic quotient operations

The mathematical proofs are certificate-based, relying on combinatorial layer-suffix inequalities and case-specific analysis. Exhaustive validation spans $\mathbb{Z}^2$1 to $\mathbb{Z}^2$2 with over $\mathbb{Z}^2$3 cases and zero failures in connectivity, acyclicity, repair count, or depth.

Eisenstein-Jacobi Network Results

For $\mathbb{Z}^2$4 in $\mathbb{Z}^2$5, the selector achieves:

• Depth at most $\mathbb{Z}^2$6 for one-fault cases, $\mathbb{Z}^2$7 for two-fault cases
• Exact $\mathbb{Z}^2$8 external repair edges, with $\mathbb{Z}^2$9
• Handling of ray, sector, and mixed fault signatures with tailored cyclic/alternating tree orientations
• Use of sector and tail operators for explicit edge selection in hexagonal symmetry

Validation covers $H_t$0 to $H_t$1, with over $H_t$2 cases and zero failures. The proof structure is parallel to the Gaussian case, exploiting the properties of hexagonal geometry and coordinate modularity.

Complexity, Validation, and Reproducibility

The selector’s complexity and correctness are formally stated:

• Repair plan selection: $H_t$3 time and memory for $H_t$4
• Full tree materialization: $H_t$5, due to required output size

Strict exhaustive validation is provided, leveraging programmatic enumeration of all possible one- and two-fault placements, recording orientation, repair plan, and verifying structural invariants. No case fails, confirming the symbolic selector’s correctness for all possible placements within the tested ranges.

Validation scripts and datasets are fully reproducible, intended for deposition in a public repository, with CSV outputs detailing every case.

Theoretical and Practical Implications

This work establishes that, for algebraic interconnection networks with fixed degree and compact addressability, local broadcast repair for up to two faults can be reduced to constant-time algebraic decision-making. This stands in contrast to prior approaches that required linear scans, substantially improving practical reconfiguration efficiency for large-scale parallel and distributed systems.

Numerical results are unambiguous: exhaustive validation in the tested parameter regimes exhibits zero failures, confirming strict structural invariants. The certificate selector achieves exact minimum repair edge count and optimal depth bounds for all enumerated cases.

The methodology is limited to the two-fault regime; extension to more faults requires advanced combinatorial blocking classification and potentially a library of interacting-cap certificates.

Practically, the selector is applicable to on-chip interconnection networks, parallel processor architectures, and networking scenarios favoring rapid localized repair without full network scans. The ability to separate repair-plan selection from tree materialization is consistent with controller-centric reconfiguration.

Future Directions

The extension to fault sets with $H_t$6 remains an open problem due to increased entry blocking and component interactions. Further research may address fault-linear or multi-cap certificate selection, aiming to retain constant (or bounded) repair-plan complexity in broader fault regimes. The algebraic framework provided here sets the stage for future advances in fault-tolerant, low-latency reconfiguration in symmetric algebraic network topologies.

Conclusion

The paper demonstrates that constant-time certificate selection for local broadcast repair in dense Gaussian and Eisenstein-Jacobi networks is achievable for up to two processor faults, with mathematically precise repair plans and strong numerical validation. The formal case partitioning, explicit algebraic construction, and reproducible programmatic validation substantiate the claims for both network families, with practical implications for scalable, fault-tolerant communication in algebraic interconnection structures. The theoretical challenge of higher fault regimes remains for subsequent investigation.