Bounding the locality of distributed routing algorithms

d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada [e-mail] Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-Sheva, Israel [e-mail] Stephane Durocher Dept. of Computer Science University of Manitoba Winnipeg, Canada [e-mail] 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 a) the subgraph corresponding to all network nodes within k hops of itself, for some value of k, b) the node from which the message originated, and c) which of its neighbours last forwarded the message. Our objective is to determine which of these parameters are necessary and/or sufficient to permit local routing as k varies on a network modelled by a connected undirected graph. ...

• Type: Conference
• Year: 2009
• Where: PODC
• Authors: Prosenjit Bose, Paz Carmi, Stephane Durocher
• Keywords: Computer Science Ben-Gurion, Deterministic K-local Routing, Local Routing Algorithm, Parallel Computing, PODC 2009