Full mesh networking technology with peer to peer grid topology based on variable parameter full dimensional space
Wenqiang Song, Chuan He, Zhaoyang Xie, Yuanyuan Chai

TL;DR
This paper introduces a novel full mesh peer-to-peer networking topology based on variable parameter full-dimensional space, enhancing security and resource interconnection without central bottlenecks.
Contribution
It proposes a new hard-NAT traversal formula and a comprehensive mesh topology covering all networking schemes for improved security and connectivity.
Findings
Successfully solves hard NAT traversal problem.
Achieves peer-to-peer resource interconnection across various schemes.
Enhances network security through decentralized topology.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies
