Closed-Form and Constant-Time New-Source Selection for Fault-Tolerant Broadcasting in Dense Gaussian Networks

Abstract: Fault-tolerant broadcasting in dense Gaussian networks is recovered by re-rooting the broadcast at a new source at maximum graph distance from the faulty nodes. This paper extends the re-rooting framework by replacing its boundary-search source-selection step with a quotient-lattice-aware algebraic construction. The first contribution is a constant-time counting method for valid new sources, formulated as an intersection of two diameter-$k$ boundary sets in the Gaussian quotient. The exact count is obtained by a fixed union of side-pair intervals over nine quotient-lattice copies, giving a closed-form procedure without scanning the network or boundary. The second contribution is a shifted direct selector for two arbitrary faulty nodes. Given faulty nodes $A$ and $B$, the problem is translated to $C=\operatorname{mod}_{G_k}(B-A)$, and the selector finds $P$ satisfying $d(P,0)=d(P,C)=k$. For each of nine quotient-lattice shifts, sixteen signed linear systems are checked. Nonparallel systems are solved via Cramer's rule; parallel systems are handled by interval-endpoint selection. At most $9\times16=144$ shifted sign cases are evaluated, giving $O(1)$ selection under the word-RAM model. Validation reports zero count mismatches over $26{,}623$ tested nodes, $500{,}000$ valid outputs over $500{,}000$ sampled fault pairs, and $40{,}000$ successful re-rooted broadcast trials. The shifted selector achieves a $5.92\times$ speedup over boundary search at $k=200$, remaining stable as $k$ increases. These results make new-source selection algebraic, bounded, and independent of network size.

• The paper introduces an algebraic, closed-form approach for constant-time new source selection in fault-tolerant broadcasting.
• It leverages Gaussian quotient-lattice symmetries to transform the boundary-intersection problem into a fixed linear system solvable in constant time.
• Experimental results confirm zero mismatches and significant runtime improvements over traditional search-based methods, ensuring scalability and robustness.

Closed-Form, Constant-Time Source Selection for Fault-Tolerant Broadcasting in Dense Gaussian Networks

Introduction and Background

The paper "Closed-Form and Constant-Time New-Source Selection for Fault-Tolerant Broadcasting in Dense Gaussian Networks" (2606.18715) addresses the efficient recovery of broadcasting in dense Gaussian networks under node faults by advancing the mathematical and algorithmic structure of the re-rooting-based recovery paradigm. Dense Gaussian networks $G_k$ are degree-four interconnection topologies defined over Gaussian integers, with diameter $k$ and node count $N = k^2 + (k+1)^2$. Their regular algebraic structure enables efficient paths, compact node labeling, and maximal-diameter broadcasts. Fault-tolerant broadcasting requires dynamically avoiding failed nodes, prompting the need for precise and rapid selection of alternate source nodes capable of maximal coverage post-fault.

Existing approaches relied on search-based selection of new broadcast roots (sources), which incurred $O(k)$ complexity due to boundary traversal, or $O(N)$ by brute force. The present paper replaces these methods with closed-form algebraic constructions and constant-time selection mechanisms exploiting Gaussian quotient-lattice symmetries and piecewise combinatorial boundary intersection analysis.

Algebraic Formulation of Valid New Sources

Selection of a valid new source post-fault is framed as a boundary-intersection problem. For faulty nodes $A$ and $B$, the task is to find a node $NS$ with maximal graph distance ($k$) from both $A$ and $k$0:

$k$1

The problem is reduced by translation invariance: the difference node $k$2 allows formulation as selection of $k$3 satisfying $k$4, then reconstructing $k$5. This reduces the problem to a canonical intersection of boundary sets within the Gaussian quotient.

Figure 1: Boundary-intersection view in $k$6, visualizing valid new source candidates as the intersection of central and shifted boundary sets.

The paper rigorously partitions the $k$7-step boundary of the canonical diamond into four disjoint directed sides, analyzing all geometric overlap patterns between local and shifted boundaries. It provides a piecewise compact formula for the local (unshifted) intersection count and extends this to account for wrap-around intersections induced by lattice translations. The exact valid-source count utilizes a fixed union of side-pair intervals across the nine relevant quotient-lattice shifts, yielding a closed-form constant-size counting procedure.

Constant-Time Direct Algebraic Source Selection

Beyond enumeration, the paper establishes a direct selection algorithm for two arbitrary faults. By shifting $k$8 over nine quotient-lattice vectors, and considering all $k$9 sign combinations for the coordinates, the system $N = k^2 + (k+1)^2$0, $N = k^2 + (k+1)^2$1 (with $N = k^2 + (k+1)^2$2 shifted difference coordinates) is solved for integer candidates using linear algebra (Cramer's rule for nonparallel cases, interval-endpoint selection for parallel cases). Each candidate is verified for boundary membership. The method is independent of network parameters ($N = k^2 + (k+1)^2$3, $N = k^2 + (k+1)^2$4), requiring at most $N = k^2 + (k+1)^2$5 constant-time algebraic cases.

Figure 2: Translation of the two-fault new-source problem via difference node $N = k^2 + (k+1)^2$6, enabling reduction to a canonical boundary intersection.

Strong numerical results are reported: zero mismatches across 26,623 tested nodes for counting, 500,000/500,000 valid source selections for two-fault scenarios, and 40,000/40,000 successful re-rooted broadcast trials, confirming method correctness and coverage. The selector's runtime becomes increasingly superior with network size, achieving $N = k^2 + (k+1)^2$7 speedup over boundary search at $N = k^2 + (k+1)^2$8.

Practical and Theoretical Implications

This closed-form and constant-time re-rooting extension has several practical implications:

• Scalability: The algebraic approach maintains constant complexity, making it agnostic to network scaling, suitable for large $N = k^2 + (k+1)^2$9 and modern NoC architectures.
• Robustness: It guarantees at least four valid sources for any nonzero node, strengthening resilience claims for Gaussian networks.
• Implementation: Integer labeling and modular reduction integrate naturally into hardware/firmware, avoiding network scans or adaptive pathfinding.
• Algebraic Generalization: Future lattice-based interconnection topologies may inherit similar constant-time recovery paradigms, with direct construction replacing search.

Potential theoretical advancements include source ranking strategies among multiple valid candidates, adaptation to dynamic/link faults, and extension to more complex algebraic network types (e.g., Eisenstein--Jacobi lattices).

Conclusion

The paper delivers a significant step in fault-tolerant broadcasting in dense Gaussian networks by providing an algebraic, bounded, and network-size-independent source selection mechanism. The boundary-intersection count and shifted selector not only validate complete recovery for one- and two-fault cases but also establish constant-time complexity regardless of $O(k)$0, with rigorous computational corroboration across all tested scenarios. These results directly enhance the reliability and efficiency of interconnection network communication protocols and provide a mathematical foundation for future developments in algebraic network robustness and recovery algorithms.