TY - GEN
T1 - Dynamic routing and location services in metrics of low doubling dimension
AU - Konjevod, Goran
AU - Richa, Andrea
AU - Xia, Donglin
N1 - Funding Information:
Work supported in part by NSF grant 0830791.
PY - 2008
Y1 - 2008
N2 - We consider dynamic compact routing in metrics of low doubling dimension. Given a set of nodes V in a metric space with nodes joining, leaving and moving, we show how to maintain a set of links E that allows compact routing on the graph G(V, E). Given a constant ε ∈ (0, 1) and a dynamic node set V with normalized diameter Δ in a metric of doubling dimension α ∈ O(loglog Δ), we achieve a dynamic graph G(V, E) with maximum degree 2O(α) log2 Δ, and an optimal (9 + ε)-stretch compact name-independent routing scheme on G with (1/ε) O(α)log4 Δ-bit storage at each node. Moreover, the amortized number of messages for a node joining, leaving and moving is polylogarithmic in the normalized diameter Δ; and the cost (total distance traversed by all messages generated) of a node move operation is proportional to the distance the node has traveled times a polylog factor. (We can also show similar bounds for a (1 + ε)-stretch compact dynamic labeled routing scheme.) One important application of our scheme is that it also provides a node location scheme for mobile ad-hoc networks with the same characteristics as our name-independent scheme above, namely optimal (9 + ε) stretch for lookup, polylogarithmic storage overhead (and degree) at the nodes, and locality-sensitive node move/join/leave operations. We also show how to extend our dynamic compact routing scheme to address the more general problem of devising locality-sensitive Distributed Hash Tables (DHTs) in dynamic networks of low doubling dimension. Our proposed DHT scheme also has optimal (9 + ε) stretch, polylogarithmic storage overhead (and degree) at the nodes, locality-sensitive publish/unpublish and node move/join/leave operations.
AB - We consider dynamic compact routing in metrics of low doubling dimension. Given a set of nodes V in a metric space with nodes joining, leaving and moving, we show how to maintain a set of links E that allows compact routing on the graph G(V, E). Given a constant ε ∈ (0, 1) and a dynamic node set V with normalized diameter Δ in a metric of doubling dimension α ∈ O(loglog Δ), we achieve a dynamic graph G(V, E) with maximum degree 2O(α) log2 Δ, and an optimal (9 + ε)-stretch compact name-independent routing scheme on G with (1/ε) O(α)log4 Δ-bit storage at each node. Moreover, the amortized number of messages for a node joining, leaving and moving is polylogarithmic in the normalized diameter Δ; and the cost (total distance traversed by all messages generated) of a node move operation is proportional to the distance the node has traveled times a polylog factor. (We can also show similar bounds for a (1 + ε)-stretch compact dynamic labeled routing scheme.) One important application of our scheme is that it also provides a node location scheme for mobile ad-hoc networks with the same characteristics as our name-independent scheme above, namely optimal (9 + ε) stretch for lookup, polylogarithmic storage overhead (and degree) at the nodes, and locality-sensitive node move/join/leave operations. We also show how to extend our dynamic compact routing scheme to address the more general problem of devising locality-sensitive Distributed Hash Tables (DHTs) in dynamic networks of low doubling dimension. Our proposed DHT scheme also has optimal (9 + ε) stretch, polylogarithmic storage overhead (and degree) at the nodes, locality-sensitive publish/unpublish and node move/join/leave operations.
UR - http://www.scopus.com/inward/record.url?scp=56449114290&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56449114290&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-87779-0_26
DO - 10.1007/978-3-540-87779-0_26
M3 - Conference contribution
AN - SCOPUS:56449114290
SN - 3540877789
SN - 9783540877783
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 379
EP - 393
BT - Distributed Computing - 22nd International Symposium, DISC 2008, Proceedings
T2 - 22nd International Symposium on Distributed Computing, DISC 2008
Y2 - 22 September 2008 through 24 September 2008
ER -