Proximity-based Networking: Small world overlays optimized with particle swarm optimization

• URL: http://arxiv.org/abs/2006.02006v2
• Date: Sun, 7 Jun 2020 00:07:12 GMT
• Title: Proximity-based Networking: Small world overlays optimized with particle swarm optimization
• Authors: Chase Smith, Alex Rusnak
• Abstract summary: Small world networks can be incredibly useful in the dissemination and lookup of information within an internet network. We propose a networking scheme that incorporates geographic location in chord for the organization of peers within each node's partitioned key space. The flexibility of our proposed schemes enables a variety of swarm models, and agents.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Information dissemination is a fundamental and frequently occurring problem in large, dynamic, distributed systems. In order to solve this, there has been an increased interest in creating efficient overlay networks that can maintain decentralized peer-to-peer networks. Within these overlay networks nodes take the patterns of small world networks, whose connections are based on proximity. These small-world systems can be incredibly useful in the dissemination and lookup of information within an internet network. The data can be efficiently transferred and routing with minimal information loss through forward error correct (FEC) and the User Datagram Protocol (UDP). We propose a networking scheme that incorporates geographic location in chord for the organization of peers within each node's partitioned key space. When we combine this with a proximity-based neighborhood set {based on the small world structure} we can mimic the efficient of solutions designed to solve traditional small-world problems, with the additional benefit of resilience and fault-tolerance. Furthermore, the routing and address book can be updated based on the neighborhood requirements. The flexibility of our proposed schemes enables a variety of swarm models, and agents. This enables our network to as an underlying networking model that can be applied to file-sharing, streaming, and synchronization of networks.

Related papers

• NetDiff: Deep Graph Denoising Diffusion for Ad Hoc Network Topology Generation [1.6768151308423371]
  We introduce NetDiff, a graph denoising diffusion probabilistic architecture that generates wireless ad hoc network link topologies. Our results show that the generated links are realistic, present structural properties similar to the dataset graphs', and require only minor corrections and verification steps to be operational.
  arXiv  Detail & Related papers  (2024-10-09T15:39:49Z)
• Unsupervised Graph Attention Autoencoder for Attributed Networks using K-means Loss [0.0]
  We introduce a simple, efficient, and clustering-oriented model based on unsupervised textbfGraph Attention textbfAutotextbfEncoder for community detection in attributed networks. The proposed model adeptly learns representations from both the network's topology and attribute information, simultaneously addressing dual objectives: reconstruction and community discovery.
  arXiv  Detail & Related papers  (2023-11-21T20:45:55Z)
• 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)
• DeHIN: A Decentralized Framework for Embedding Large-scale Heterogeneous Information Networks [64.62314068155997]
  We present textitDecentralized Embedding Framework for Heterogeneous Information Network (DeHIN) in this paper. DeHIN presents a context preserving partition mechanism that innovatively formulates a large HIN as a hypergraph. Our framework then adopts a decentralized strategy to efficiently partition HINs by adopting a tree-like pipeline.
  arXiv  Detail & Related papers  (2022-01-08T04:08:36Z)
• 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)
• Planning Spatial Networks [4.499055111059408]
  We tackle the problem of goal-directed graph construction. Given a starting graph, a global objective function, and a budget of modifications, the aim is to find a set of edges whose addition to the graph maximally improves the objective. This problem emerges in many networks of great importance for society such as transportation and critical infrastructure networks.
  arXiv  Detail & Related papers  (2021-06-12T13:01:11Z)
• Clustered Federated Learning via Generalized Total Variation Minimization [83.26141667853057]
  We study optimization methods to train local (or personalized) models for local datasets with a decentralized network structure. Our main conceptual contribution is to formulate federated learning as total variation minimization (GTV) Our main algorithmic contribution is a fully decentralized federated learning algorithm.
  arXiv  Detail & Related papers  (2021-05-26T18:07:19Z)
• Firefly Neural Architecture Descent: a General Approach for Growing Neural Networks [50.684661759340145]
  Firefly neural architecture descent is a general framework for progressively and dynamically growing neural networks. We show that firefly descent can flexibly grow networks both wider and deeper, and can be applied to learn accurate but resource-efficient neural architectures. In particular, it learns networks that are smaller in size but have higher average accuracy than those learned by the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-17T04:47:18Z)
• Distributed Scheduling using Graph Neural Networks [38.74504118887024]
  A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. We propose a distributed MWIS solver based on graph convolutional networks (GCNs) In a nutshell, a trainable GCN module learns topology-aware node embeddings that are combined with the network weights before calling a greedy solver.
  arXiv  Detail & Related papers  (2020-11-18T18:00:45Z)
• Multi-Agent Reinforcement Learning for Adaptive User Association in Dynamic mmWave Networks [17.295158818748188]
  We propose a scalable and flexible algorithm for user association based on multi-agent reinforcement learning. Users act as independent agents that, based on their local observations only, learn to autonomously coordinate their actions in order to optimize the network sum-rate. Simulation results show that the proposed algorithm is able to adapt to (fast) changes of radio environment, thus providing large sum-rate gain in comparison to state-of-the-art solutions.
  arXiv  Detail & Related papers  (2020-06-16T10:51:27Z)

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.