We examine bounds on the locality of routing. A local routing algorithm makes a sequence of distributed forwarding decisions, each of which is made using only local information. Specifically, in addition to knowing the node for which a message is destined, an intermediate node might also know (1) its local neighbourhood (the subgraph corresponding to all network nodes within \(k\) hops of itself, for some fixed \(k\)), (2) the node from which the message originated, and (3) the incoming port (which of its neighbours last forwarded the message). Our objective is to determine, as \(k\) varies, which of these parameters are necessary and/or sufficient to permit local routing on a network modelled by a connected undirected graph. In particular, we establish tight bounds on \(k\) for the feasibility of deterministic \(k\)-local routing for various combinations of these parameters, as well as corresponding bounds on dilation (the worst-case ratio of actual route length to shortest path length).
Distributed algorithms Local routing Dilation
This is a preview of subscription content, log in to check access.
The authors wish to thank Therese Biedl who observed that our origin-oblivious and predecessor-oblivious \((n/2)\)-local routing algorithm (Algorithm 3) identifies a shortest path. Also, the authors thank the anonymous reviewers for their helpful suggestions. Some of these results appeared in preliminary form at the 28th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2009) . This research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).
Bose, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., López-Ortiz, A., Morin, P., Munro, I.: Online routing in convex subdivisions. Int. J. Comput. Geom. Appl. 12(4), 283–295 (2002)zbMATHCrossRefGoogle Scholar
Bose, P., Carmi, P., Durocher, S.: Bounding the locality of distributed routing algorithms. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), vol. 28, pp. 250–259. ACM (2009)Google Scholar
Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609–616 (2001)zbMATHCrossRefGoogle Scholar
Braverman, M.: On ad hoc routing with guaranteed delivery. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), vol 27, p. 418. ACM (2008)Google Scholar
Chávez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Local construction of planar spanners with irregular transmission ranges. In: Proceedings of the Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pp. 286–297. Springer, Berlin (2006)Google Scholar
Chávez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Route discovery with constant memory in oriented planar geometric networks. Networks 48(1), 7–15 (2006)Google Scholar
Chen, D., Devroye, L., Dujmović, V., Morin, P.: Memoryless routing in convex subdivisions: Random walks are optimal. In: Proceedings of the European Workshop on Computational Geometry (EuroCG), pp. 109–112 (2010) Google Scholar
Durocher, S., Kirkpatrick, D., Narayanan, L.: On routing with guaranteed delivery in three-dimensional ad hoc wireless networks. Wirel. Netw. 16, 227–235 (2010)Google Scholar
Durocher, S., Kranakis, E., Krizanc, D., Narayanan, L.: Balancing traffic load using one-turn rectilinear routing. J. Interconnect. Netw. 10(1–2), 93–120 (2009)Google Scholar
Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISI/RR-87-180. Information Sciences Institute (1987)Google Scholar
Flury, R., Wattenhofer, R.: Randomized 3D geographic routing. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pp. 834–842. IEEE (2008)Google Scholar
Fraigniaud, P., Gavoille, C.: Local memory requirement of universal routing schemes. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Parallel Algorithms and Architecture (SPAA), pp. 183–188. ACM (1996)Google Scholar
Fraigniaud, P., Gavoille, C.: A theoretical model for routing complexity. In: Proceedings of the International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 98–113. Carleton Scientific (1998)Google Scholar
Fraser, M.: Local routing on tori. Adhoc Sens. Wirel. Netw. 6, 179–196 (2008)Google Scholar
Fraser, M., Kranakis, E., Urrutia, J.: Memory requirements for local geometric routing and traversal in digraphs. In: Proceedings of the Canadian Conference on, Computational Geometry (CCCG). vol. 20 (2008)Google Scholar
Guan, X.: Face routing in wireless ad-hoc networks. PhD thesis, University of Toronto (2009)Google Scholar
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG), vol. 11, pp. 51–54 (1999)Google Scholar
Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Joint Workshop on Foundations of Mobile Computing, pp. 69–78. ACM (2003)Google Scholar
Li, X.-Y., Wang, Y., Song, W.-Z.: Applications of \(k\)-local MST for topology control and broadcasting in wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 15(12), 1057–1069 (2004)CrossRefGoogle Scholar