Bounding the locality of distributed routing algorithms
Proceedings of the 28th ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We show that face routing, the well-known local routing algorithm for plane graphs introduced by Kranakis and Urrutia, does not in fact succeed for embedded graphs on the torus or higher genus surfaces (contrary to conjecture). We then describe a generalization of face routing, and prove that this algorithm does provide a local routing algorithm for arbitrary graphs embedded in the torus. Finally we discuss extension of this type of algorithm to surfaces of genus g, describing the problems encountered in this setting.