Full mesh networking technology with peer to peer grid topology based on variable parameter full dimensional space

• URL: http://arxiv.org/abs/2309.11903v1
• Date: Thu, 21 Sep 2023 09:14:31 GMT
• Title: Full mesh networking technology with peer to peer grid topology based on variable parameter full dimensional space
• Authors: Wenqiang Song, Chuan He, Zhaoyang Xie, Yuanyuan Chai,
• Abstract summary: The security of VPN is based on the division of geographical boundaries. The granularity is relatively coarse, which is difficult to cope with the dynamic changes of the security situation. This paper proposes a full mesh networking mechanism with variable parameter full-dimensional spatial peer-to-peer grid topology.
• Score: 2.6832339683065056
• License: http://creativecommons.org/licenses/by/4.0/
• 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 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.

Related papers

• All Nodes are created Not Equal: Node-Specific Layer Aggregation and Filtration for GNN [61.28174338723467]
  We propose a Node-Specific Layer Aggregation and filtration architecture, termed NoSAF, for Graph Neural Networks. NoSAF provides a reliable information filter for each layer's nodes to sieve out information beneficial for the subsequent layer. NoSAF also incorporates a compensation mechanism that replenishes information in every layer of the model, allowing NoSAF to perform meaningful computations even in very deep layers.
  arXiv  Detail & Related papers  (2024-05-13T16:27:12Z)
• Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes [7.53305437064932]
  Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. We show that multipartite entanglement allows to generate an inter-QLAN artificial topology, by means of local operations only. Our contribution aims at providing the network engineering community with a hands-on guideline towards the concept of artificial topology and artificial neighborhood.
  arXiv  Detail & Related papers  (2024-04-24T20:58:50Z)
• A Novel Reinforcement Learning Routing Algorithm for Congestion Control in Complex Networks [0.0]
  This article introduces a routing algorithm leveraging reinforcement learning to address two primary objectives: congestion control and optimizing path length based on the shortest path algorithm. Notably, the proposed method proves effective not only in Barab'asi-Albert scale-free networks but also in other network models such as Watts-Strogatz (small-world) and Erd"os-R'enyi (random network)
  arXiv  Detail & Related papers  (2023-12-30T18:21:13Z)
• Hierarchical Multi-Marginal Optimal Transport for Network Alignment [52.206006379563306]
  Multi-network alignment is an essential prerequisite for joint learning on multiple networks. We propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. Our proposed HOT achieves significant improvements over the state-of-the-art in both effectiveness and scalability.
  arXiv  Detail & Related papers  (2023-10-06T02:35:35Z)
• Intelligent multicast routing method based on multi-agent deep reinforcement learning in SDWN [4.521033397097599]
  Multicast communication technology is widely applied in wireless environments with a high device density. This paper proposes a new multicast routing method based on multiagent deep reinforcement learning (MADRL-MR) in a software-defined wireless networking (SDWN) environment. Simulation experiments show that MADRL-MR outperforms existing algorithms in terms of throughput, delay, packet loss rate, etc.
  arXiv  Detail & Related papers  (2023-05-12T14:05:03Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
  This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
  arXiv  Detail & Related papers  (2021-06-15T09:03:28Z)
• On Topology Optimization and Routing in Integrated Access and Backhaul Networks: A Genetic Algorithm-based Approach [70.85399600288737]
  We study the problem of topology optimization and routing in IAB networks. We develop efficient genetic algorithm-based schemes for both IAB node placement and non-IAB backhaul link distribution. We discuss the main challenges for enabling mesh-based IAB networks.
  arXiv  Detail & Related papers  (2021-02-14T21:52:05Z)
• Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer [12.018165291620164]
  We propose a novel reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. A single agent makes all routing and spectrum access decisions as it moves along the frontier nodes of each flow. The proposed deep reinforcement learning strategy is capable of accounting for the mutual interference between the links.
  arXiv  Detail & Related papers  (2020-12-22T01:47:20Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• Machine Learning based Anomaly Detection for 5G Networks [0.0]
  This paper proposes SDS (Software Defined Security) as a means to provide an automated, flexible and scalable network defence system. SDS will harness current advances in machine learning to design a CNN (Convolutional Neural Network) using NAS (Neural Architecture Search) to detect anomalous network traffic.
  arXiv  Detail & Related papers  (2020-03-07T00:17:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.