TY - GEN

T1 - Bounding the locality of distributed routing algorithms

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Durocher, Stephane

PY - 2009/11/9

Y1 - 2009/11/9

N2 - 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. 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).

AB - 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. 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).

KW - Dilation

KW - Distributed algorithms

KW - Local routing

UR - http://www.scopus.com/inward/record.url?scp=70350641360&partnerID=8YFLogxK

U2 - 10.1145/1582716.1582756

DO - 10.1145/1582716.1582756

M3 - Conference contribution

AN - SCOPUS:70350641360

SN - 9781605583969

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 250

EP - 259

BT - PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing

T2 - 2009 ACM Symposium on Principles of Distributed Computing, PODC'09

Y2 - 10 August 2009 through 12 August 2009

ER -