Dijkstra’s algorithm won’t be replaced in production routers any time soon

Dijkstra is a legend in computer science and his algorithm, which he published in 1959, predates packet switching by a few ...
GitHub

Urban Routing Benchmark: Benchmarking MARL algorithms on the fleet routing tasks

first learning of human drivers, which then 'mutate` to CAVs, are trained to optimize routing policies with the implemented algorithm. When the training is finished, it uses raw results to compute a ...
IEEE

Segment Routing Header (SRH)-Aware Traffic Engineering in Hybrid IP/SRv6 Networks With Deep Reinforcement Learning

Abstract: Segment Routing over IPv6 (SRv6) gives operators explicit path control and alleviates network congestion, making it a compelling technique for traffic engineering (TE). Yet two practical ...
IEEE

Reverse Engineering Segment Routing Policies and Link Costs With Inverse Reinforcement Learning and EM

Abstract: Network routing is a core functionality in computer networks that holds significant potential for integrating newly developed techniques with minimal software effort through the use of ...