The continuous development of computer network technology has accelerated the pace of informatization, and at the same time, network security issues are becoming increasingly prominent. Networking technology with different network topologies is one of the important means to solve network security problems. The security of VPN is based on the division of geographical boundaries, but the granularity is relatively coarse, which is difficult to cope with the dynamic changes of the security situation. Zero trust network solves the VPN problem through peer to peer authorization and continuous verification, but most of the solutions use a central proxy device, resulting in the central node becoming the bottleneck of the network. This paper put forward the hard-Nat traversal formula based on the birthday paradox, which solves the long-standing problem of hard NAT traversal. A full mesh networking mechanism with variable parameter full-dimensional spatial peer-to-peer grid topology was proposed, which covers all types of networking schemes and achieve peer-2-peer resource interconnection on both methodological and engineering level.

翻译：计算机网络技术的持续发展加速了信息化的进程，与此同时网络安全问题也日益凸显。不同网络拓扑结构的组网技术是解决网络安全问题的重要手段之一。VPN的安全性基于地理边界的划分，但粒度较粗，难以应对安全态势的动态变化。零信任网络通过对等授权和持续验证解决了VPN问题，但大多数方案采用中心代理设备，导致中心节点成为网络瓶颈。本文提出了基于生日悖论的硬NAT穿透公式，解决了长期存在的硬NAT穿透问题。提出了具有变参全维空间对等网格拓扑的全互联组网机制，该机制涵盖了所有类型的组网方案，并在方法论和工程层面实现了对等资源互联。