Multi-Agent Meta Reinforcement Learning for Packet Routing in Dynamic Network Environments
ACM Student Research Competition: Graduate Poster
ACM Student Research Competition: Undergraduate Poster
TimeWednesday, 18 November 20208:30am - 5pm EDT
DescriptionTraffic optimization challenges, such as flow scheduling and completion time reducing, are difficult online decision-making problems in wide area networks. Previous works apply heuristics that rely on full knowledge of the system to design optimization algorithms. In this work, we explore building a model-free approach, applying multi-agent meta reinforcement learning to solve complex online control problem that generates optimal paths to reroute traffic. Focusing on decentralized solutions, our experiment aims to efficiently minimize the average packet completion time while reducing packet loss across complex network topologies. To evaluate, we test with a static topology and dynamically changing network topologies and compare results to the classical shorted path algorithm.