This paper addresses point-to-point packet routing in undirected networks, which is the most important communication primitive in most networks. The main result proves the existence of routing tables that deterministically guarantee a polylog-competitive completion-time:
No takes yet. Share an insight, caveat, or question.
Haeupler et al. (2024) studied this question.