Team-partitioned, opaque-transition reinforcement learning (TPOT-RL) is a distributed reinforcement learning technique that allows a team of independent agents to learn a collaborative task. TPOT-RL was first successfully applied to simulated robotic soccer (Stone & Veloso, 1999). This paper demonstrates that TPOT-RL is general enough to apply to a completely different domain, namely network packet routing. Empirical results in an abstract network routing simulator indicate that agents situated at individual nodes can learn to efficiently route packets through a network that exhibits changing traffic patterns, based on locally observable sensations. 1
Efficient routing of information packets in dynamically changing communication networks requires rou...
Packet routing problem most commonly emerges in the context of computer networks, thus the majority ...
We investigate two new distributed routing algorithms for data networks based on simple biological "...
Team-partitioned, opaque-transition reinforcement learning (TPOT-RL) is a distributed reinforcement ...
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-tran...
International audienceIn this paper, we present PRISMA: Packet Routing Simulator for Multi-Agent Rei...
International audienceReinforcement learning (RL), which is a class of machine learning, provides a ...
In this paper we describe a self-adjusting algorithm for packet routing in which a reinforcement lea...
In a packet network, the routes taken by traffic can be determined according to predefined objective...
In this paper we describe a self-adjusting algorithm for packet routing, in which a reinforcement le...
International audienceIn recent years, several works have studied Multi-Agent Deep Reinforcement Lea...
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning m...
In a packet network, the routes taken by traffic can be determined according to predefined objective...
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning m...
Traffic signal control (TSC) is an established yet challenging engineering solution that alleviates ...
Efficient routing of information packets in dynamically changing communication networks requires rou...
Packet routing problem most commonly emerges in the context of computer networks, thus the majority ...
We investigate two new distributed routing algorithms for data networks based on simple biological "...
Team-partitioned, opaque-transition reinforcement learning (TPOT-RL) is a distributed reinforcement ...
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-tran...
International audienceIn this paper, we present PRISMA: Packet Routing Simulator for Multi-Agent Rei...
International audienceReinforcement learning (RL), which is a class of machine learning, provides a ...
In this paper we describe a self-adjusting algorithm for packet routing in which a reinforcement lea...
In a packet network, the routes taken by traffic can be determined according to predefined objective...
In this paper we describe a self-adjusting algorithm for packet routing, in which a reinforcement le...
International audienceIn recent years, several works have studied Multi-Agent Deep Reinforcement Lea...
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning m...
In a packet network, the routes taken by traffic can be determined according to predefined objective...
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning m...
Traffic signal control (TSC) is an established yet challenging engineering solution that alleviates ...
Efficient routing of information packets in dynamically changing communication networks requires rou...
Packet routing problem most commonly emerges in the context of computer networks, thus the majority ...
We investigate two new distributed routing algorithms for data networks based on simple biological "...