From the 1 of 14 linked papers with an AI index.
14 papers
Local Fault Repair of Perfect Resource Placements in Eisenstein--Jacobi Networks
Bader Albader
The paper studies how to locally replace failed resources in dense Eisenstein‑Jacobi network placements, establishing exact and upper bounds on the number of replacement resources…
Ratio-Independent Three-Cycle Decomposition with Optimal Ordered Local-Switch Cost in Six-Regular Non-Axis Eisenstein--Jacobi Networks
Bader Albader
Six-regular simple Eisenstein--Jacobi (EJ) networks are degree-six quotient-lattice interconnection networks. This paper gives a ratio-independent decomposition of every six-regula…
Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Gaussian Broadcast Networks
Bader Albader
Dense Gaussian networks are degree-four algebraic networks with compact diameter and coordinate-based routing. Their diameter-level broadcast trees are efficient but fragile under…
Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Eisenstein--Jacobi Broadcast Networks
Bader Albader
One-to-all broadcasting in dense Eisenstein--Jacobi (EJ) networks relies on diameter-level spanning trees that fragment when nodes or links fail. This paper introduces the selected…
Constant-Time Certificate Selection for Local Broadcast Repair in Dense Gaussian and Eisenstein--Jacobi Networks
Bader Albader
Dense Gaussian and Eisenstein--Jacobi (EJ) networks are algebraic interconnection networks with compact coordinate balls, fixed degree, and simple modular addressing. A source-cent…
Multi-Orientation Edge-Minimum Repair for Non-Redundant Fault-Tolerant Broadcasting in Dense Eisenstein--Jacobi Networks
Bader Albader
Dense Eisenstein--Jacobi (EJ) networks are degree-six algebraic interconnection networks whose finite quotient geometry is naturally represented by a hexagonal axial-coordinate bal…