Online Multi-Path Routing in a Maze

Abstract

We consider the problem of routing a message in a mesh network with faulty nodes. The number and positions of faulty nodes is unknown. It is known that a flooding strategy like expanding ring search can route a message linear in the minimum number of steps h while it causes a traffic (i.e