Machine Learning Applications in the Routing in Computer Networks

• URL: http://arxiv.org/abs/2104.01946v1
• Date: Mon, 5 Apr 2021 15:08:35 GMT
• Title: Machine Learning Applications in the Routing in Computer Networks
• Authors: Ke Liang and Mitchel Myers
• Abstract summary: Development of routing algorithms is of clear importance as the volume of Internet traffic continues to increase. We surveyed both centralized and decentralized ML routing architectures. We implemented two routing protocols within 14 surveyed routing algorithms and verified the efficacy of their results.
• Score: 0.9020406183127511
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Development of routing algorithms is of clear importance as the volume of Internet traffic continues to increase. In this survey, there is much research into how Machine Learning techniques can be employed to improve the performance and scalability of routing algorithms. We surveyed both centralized and decentralized ML routing architectures and using a variety of ML techniques broadly divided into supervised learning and reinforcement learning. Many of the papers showed promise in their ability to optimize some aspect of network routing. We also implemented two routing protocols within 14 surveyed routing algorithms and verified the efficacy of their results. While the results of most of the papers showed promise, many of them are based on simulations of potentially unrealistic network configurations. To provide further efficacy to the results, more real-world results are necessary.

Related papers

• Learning Sub-Second Routing Optimization in Computer Networks requires Packet-Level Dynamics [15.018408728324887]
  Reinforcement Learning can help to learn network representations that provide routing decisions. We present $textitPackeRL$, the first packet-level Reinforcement Learning environment for routing in generic network topologies. We also introduce two new algorithms for learning sub-second Routing Optimization.
  arXiv  Detail & Related papers  (2024-10-14T11:03:46Z)
• Intelligent Routing Algorithm over SDN: Reusable Reinforcement Learning Approach [1.799933345199395]
  We develop a reusable RL-aware, reusable routing algorithm, RLSR-Routing over SDN. Our algorithm shows better performance in terms of load balancing than the traditional approaches. It also has faster convergence than the non-reusable RL approach when finding paths for multiple traffic demands.
  arXiv  Detail & Related papers  (2024-09-23T17:15:24Z)
• Online Network Source Optimization with Graph-Kernel MAB [62.6067511147939]
  We propose Grab-UCB, a graph- kernel multi-arms bandit algorithm to learn online the optimal source placement in large scale networks. We describe the network processes with an adaptive graph dictionary model, which typically leads to sparse spectral representations. We derive the performance guarantees that depend on network parameters, which further influence the learning curve of the sequential decision strategy.
  arXiv  Detail & Related papers  (2023-07-07T15:03:42Z)
• XRoute Environment: A Novel Reinforcement Learning Environment for Routing [8.797544401458476]
  We introduce the XRoute Environment, a new reinforcement learning environment. Agents are trained to select and route nets in an advanced, end-to-end routing framework. The resulting environment is challenging, easy to use, customize and add additional scenarios.
  arXiv  Detail & Related papers  (2023-05-23T08:46:25Z)
• MARLIN: Soft Actor-Critic based Reinforcement Learning for Congestion Control in Real Networks [63.24965775030673]
  We propose a novel Reinforcement Learning (RL) approach to design generic Congestion Control (CC) algorithms. Our solution, MARLIN, uses the Soft Actor-Critic algorithm to maximize both entropy and return. We trained MARLIN on a real network with varying background traffic patterns to overcome the sim-to-real mismatch.
  arXiv  Detail & Related papers  (2023-02-02T18:27:20Z)
• Learning Enhanced Optimisation for Routing Problems [3.747361228408185]
  "Learning to Guide Local Search" (L2GLS) is a learning-based approach for routing problems. L2GLS combines local search (LS) operators' strengths with penalty terms to escape local optimals. We show that L2GLS achieves the new state-of-the-art results on larger TSP and CVRP over other machine learning methods.
  arXiv  Detail & Related papers  (2021-09-17T04:47:26Z)
• Unsupervised Domain-adaptive Hash for Networks [81.49184987430333]
  Domain-adaptive hash learning has enjoyed considerable success in the computer vision community. We develop an unsupervised domain-adaptive hash learning method for networks, dubbed UDAH.
  arXiv  Detail & Related papers  (2021-08-20T12:09:38Z)
• A Tutorial on Ultra-Reliable and Low-Latency Communications in 6G: Integrating Domain Knowledge into Deep Learning [115.75967665222635]
  Ultra-reliable and low-latency communications (URLLC) will be central for the development of various emerging mission-critical applications. Deep learning algorithms have been considered as promising ways of developing enabling technologies for URLLC in future 6G networks. This tutorial illustrates how domain knowledge can be integrated into different kinds of deep learning algorithms for URLLC.
  arXiv  Detail & Related papers  (2020-09-13T14:53:01Z)
• A Survey on Large-scale Machine Learning [67.6997613600942]
  Machine learning can provide deep insights into data, allowing machines to make high-quality predictions. Most sophisticated machine learning approaches suffer from huge time costs when operating on large-scale data. Large-scale Machine Learning aims to learn patterns from big data with comparable performance efficiently.
  arXiv  Detail & Related papers  (2020-08-10T06:07:52Z)
• Fitting the Search Space of Weight-sharing NAS with Graph Convolutional Networks [100.14670789581811]
  We train a graph convolutional network to fit the performance of sampled sub-networks. With this strategy, we achieve a higher rank correlation coefficient in the selected set of candidates.
  arXiv  Detail & Related papers  (2020-04-17T19:12:39Z)
• Towards Cognitive Routing based on Deep Reinforcement Learning [17.637357380527583]
  We propose a definition of cognitive routing and an implementation approach based on Deep Reinforcement Learning (DRL) To facilitate the research of DRL-based cognitive routing, we introduce a simulator named RL4Net for DRL-based routing algorithm development and simulation. The simulation results on an example network topology show that the DDPG-based routing algorithm achieves better performance than OSPF and random weight algorithms.
  arXiv  Detail & Related papers  (2020-03-19T03:32:43Z)

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.