Exact Strong Radius and Diameter of 3-Dimensional Grid Networks.

Saved in:

Bibliographic Details
Title:	Exact Strong Radius and Diameter of 3-Dimensional Grid Networks.
Authors:	Zhou, Shikun¹ shikunzhou@163.com, Li, Feng² li2006369@126.com
Source:	Engineering Letters. Jul2026, Vol. 34 Issue 7, p2888-2896. 9p.
Subjects:	Mesh networks, Network performance, Algorithms, Routing systems
Abstract:	Building efficient strongly connected directed paths in three-dimensional (3D) grid networks is foundational for minimizing communication latencies and ensuring deterministic data routing in large-scale interconnected systems. This paper explores how to orient these networks to achieve the shortest possible distances across the entire structure. We first establish tight theoretical lower bounds for two key metrics: the minimum achievable worst-case strong distance from an optimal center to all nodes (orientable strong radius) and the minimum achievable worst-case strong distance between any pair of nodes (orientable strong diameter). To reach these limits, we propose two structured methods. The first algorithm, termed Convergent-Divergent Orientation, coordinates coordinate-driven flows to enhance reachability from the network center. The second algorithm, the Layer-Flip Checkerboard Orientation, removes unnecessary detours to shrink the overall network travel distance to its absolute physical limit. By replacing unpredictable random paths with our structured design, we eliminate performance spikes and hidden efficiency losses. This provides a reliable and scalable solution for high-performance 3D interconnected systems. [ABSTRACT FROM AUTHOR]
	Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Building efficient strongly connected directed paths in three-dimensional (3D) grid networks is foundational for minimizing communication latencies and ensuring deterministic data routing in large-scale interconnected systems. This paper explores how to orient these networks to achieve the shortest possible distances across the entire structure. We first establish tight theoretical lower bounds for two key metrics: the minimum achievable worst-case strong distance from an optimal center to all nodes (orientable strong radius) and the minimum achievable worst-case strong distance between any pair of nodes (orientable strong diameter). To reach these limits, we propose two structured methods. The first algorithm, termed Convergent-Divergent Orientation, coordinates coordinate-driven flows to enhance reachability from the network center. The second algorithm, the Layer-Flip Checkerboard Orientation, removes unnecessary detours to shrink the overall network travel distance to its absolute physical limit. By replacing unpredictable random paths with our structured design, we eliminate performance spikes and hidden efficiency losses. This provides a reliable and scalable solution for high-performance 3D interconnected systems. [ABSTRACT FROM AUTHOR]
ISSN:	1816093X