Abstract: This paper presents and proves the correctness of a modified Dijkstra's algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of ...

Abstract: Communication networks are difficult to model and predict because they have become very sophisticated and dynamic. We develop a reinforcement learning routing algorithm (RLRouting) to solve ...