Towards Cognitive Routing based on Deep Reinforcement Learning
- URL: http://arxiv.org/abs/2003.12439v1
- Date: Thu, 19 Mar 2020 03:32:43 GMT
- Title: Towards Cognitive Routing based on Deep Reinforcement Learning
- Authors: Jiawei Wu, Jianxue Li, Yang Xiao, Jun Liu
- Abstract summary: 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.
- Score: 17.637357380527583
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Routing is one of the key functions for stable operation of network
infrastructure. Nowadays, the rapid growth of network traffic volume and
changing of service requirements call for more intelligent routing methods than
before. Towards this end, 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. Then, we design and implement a DDPG-based routing algorithm. The
simulation results on an example network topology show that the DDPG-based
routing algorithm achieves better performance than OSPF and random weight
algorithms. It demonstrate the preliminary feasibility and potential advantage
of cognitive routing for future network.
Related papers
- 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) - A Deep Reinforcement Learning Approach for Adaptive Traffic Routing in
Next-gen Networks [1.1586742546971471]
Next-gen networks require automation and adaptively adjust network configuration based on traffic dynamics.
Traditional techniques that decide traffic policies are usually based on hand-crafted programming optimization and algorithms.
We develop a deep reinforcement learning (DRL) approach for adaptive traffic routing.
arXiv Detail & Related papers (2024-02-07T01:48:29Z) - Learning State-Augmented Policies for Information Routing in
Communication Networks [92.59624401684083]
We develop a novel State Augmentation (SA) strategy to maximize the aggregate information at source nodes using graph neural network (GNN) architectures.
We leverage an unsupervised learning procedure to convert the output of the GNN architecture to optimal information routing strategies.
In the experiments, we perform the evaluation on real-time network topologies to validate our algorithms.
arXiv Detail & Related papers (2023-09-30T04:34: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) - Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
Entanglement routing establishes remote entanglement connection between two arbitrary nodes.
We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
arXiv Detail & Related papers (2021-11-15T14:07:22Z) - Deep Reinforcement Learning Aided Packet-Routing For Aeronautical Ad-Hoc
Networks Formed by Passenger Planes [99.54065757867554]
We invoke deep reinforcement learning for routing in AANETs aiming at minimizing the end-to-end (E2E) delay.
A deep Q-network (DQN) is conceived for capturing the relationship between the optimal routing decision and the local geographic information observed by the forwarding node.
We further exploit the knowledge concerning the system's dynamics by using a deep value network (DVN) conceived with a feedback mechanism.
arXiv Detail & Related papers (2021-10-28T14:18:56Z) - Packet Routing with Graph Attention Multi-agent Reinforcement Learning [4.78921052969006]
We develop a model-free and data-driven routing strategy by leveraging reinforcement learning (RL)
Considering the graph nature of the network topology, we design a multi-agent RL framework in combination with Graph Neural Network (GNN)
arXiv Detail & Related papers (2021-07-28T06:20:34Z) - Machine Learning Applications in the Routing in Computer Networks [0.9020406183127511]
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.
arXiv Detail & Related papers (2021-04-05T15:08:35Z) - Deep Policy Dynamic Programming for Vehicle Routing Problems [89.96386273895985]
We propose Deep Policy Dynamic Programming (D PDP) to combine the strengths of learned neurals with those of dynamic programming algorithms.
D PDP prioritizes and restricts the DP state space using a policy derived from a deep neural network, which is trained to predict edges from example solutions.
We evaluate our framework on the travelling salesman problem (TSP) and the vehicle routing problem (VRP) and show that the neural policy improves the performance of (restricted) DP algorithms.
arXiv Detail & Related papers (2021-02-23T15:33:57Z) - Reinforcement Learning for Datacenter Congestion Control [50.225885814524304]
Successful congestion control algorithms can dramatically improve latency and overall network throughput.
Until today, no such learning-based algorithms have shown practical potential in this domain.
We devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks.
We show that this scheme outperforms alternative popular RL approaches, and generalizes to scenarios that were not seen during training.
arXiv Detail & Related papers (2021-02-18T13:49:28Z) - Track-Assignment Detailed Routing Using Attention-based Policy Model
With Supervision [0.27998963147546135]
We propose a machine learning driven method for solving the track-assignment detailed routing problem.
Our approach adopts an attention-based reinforcement learning (RL) policy model.
We show that especially for complex problems, our supervised RL method provides good quality solution.
arXiv Detail & Related papers (2020-10-26T16:40:11Z)
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.