Results 1  10
of
41
Distributed Object Location in a Dynamic Network
, 2004
"... Modern networking applications replicate data and services widely, leading to a need for locationindependent routingthe ability to route queries to objects using names independent of the objects' physical locations. Two important properties of such a routing infrastructure are routing locality a ..."
Abstract

Cited by 167 (16 self)
 Add to MetaCart
Modern networking applications replicate data and services widely, leading to a need for locationindependent routingthe ability to route queries to objects using names independent of the objects' physical locations. Two important properties of such a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be efficiently achieved for certain network topologies. To do this, we present a new distributed algorithm that can solve the nearestneighbor problem for these networks. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton et al. [24].
Topology Control and Routing in Ad hoc Networks: A Survey
 SIGACT News
, 2002
"... this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. T ..."
Abstract

Cited by 115 (0 self)
 Add to MetaCart
this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. This article is not intended to be a comprehensive survey on ad hoc networking. The choice of the problems discussed in this article are somewhat biased by the research interests of the author
Compact and Localized Distributed Data Structures
 JOURNAL OF DISTRIBUTED COMPUTING
, 2001
"... This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sou ..."
Abstract

Cited by 72 (25 self)
 Add to MetaCart
This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels, selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey focuses on combinatorial and algorithmic techniques, and covers complexity results on various applications, including compact localized schemes for message routing in communication networks, and adjacency and distance labeling schemes.
Compact NameIndependent Routing with Minimum Stretch
 In Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004
, 2004
"... Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a O(√n) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the shortest paths. This is optimal in a very strong sense. It is known t ..."
Abstract

Cited by 64 (12 self)
 Add to MetaCart
Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a O(√n) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the shortest paths. This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(√n) space per node.
Routing in networks with low doubling dimension
 In 26 th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer
, 2006
"... This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, nameindependent routing and labeled routing. The key results obtained for this model are the following. First, we provide the first nameindependent solution. Specifically, we achieve con ..."
Abstract

Cited by 63 (8 self)
 Add to MetaCart
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, nameindependent routing and labeled routing. The key results obtained for this model are the following. First, we provide the first nameindependent solution. Specifically, we achieve constant stretch and polylogarithmic storage. Second, we obtain the first truly scalefree solutions, namely, the network’s aspect ratio is not a factor in the stretch. Scalefree schemes are given for three problem models: nameindependent routing on graphs, labeled routing on metric spaces, and labeled routing on graphs. Third, we prove a lower bound requiring linear storage for stretch < 3 schemes. This has the important ramification of separating for the first time the nameindependent problem model from the labeled model for these networks, since compact stretch1+ε labeled schemes are known to be possible.
On Hierarchical Routing in Doubling Metrics
, 2005
"... We study the problem of routing in doubling metrics, and show how to perform hierarchical routing in such metrics with small stretch and compact routing tables (i.e., with small amount of routing information stored at each vertex). We say that a metric (X, d) has doubling dimension dim(X) at most α ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
We study the problem of routing in doubling metrics, and show how to perform hierarchical routing in such metrics with small stretch and compact routing tables (i.e., with small amount of routing information stored at each vertex). We say that a metric (X, d) has doubling dimension dim(X) at most α if every set of diameter D can be covered by 2 α sets of diameter D/2. (A doubling metric is one whose doubling dimension dim(X) is a constant.) We show how to perform (1 + τ)stretch routing on metrics for any 0 < τ ≤ 1 with routing tables of size at most (α/τ) O(α) log 2 ∆ bits with only (α/τ) O(α) log ∆ entries, where ∆ is the diameter of the graph; hence the number of routing table entries is just τ −O(1) log ∆ for doubling metrics. These results extend and improve on those of Talwar (2004). We also give better constructions of sparse spanners for doubling metrics than those obtained from the routing tables above; for τ> 0, we give algorithms to construct (1 + τ)stretch spanners for a metric (X, d) with maximum degree at most (2 + 1/τ) O(dim(X)) , matching the results of Das et al. for Euclidean metrics.
Compact Routing on Euclidian Metrics
, 2004
"... We consider the problem of designing a compact communication network that supports e#cient routing in an Euclidean plane. Our network design and routing scheme achieves 1+# stretch, logarithmic diameter, and constant out degree. This improves upon the best known result so far that requires a logari ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
We consider the problem of designing a compact communication network that supports e#cient routing in an Euclidean plane. Our network design and routing scheme achieves 1+# stretch, logarithmic diameter, and constant out degree. This improves upon the best known result so far that requires a logarithmic outdegree. Furthermore, our scheme is asymptotically optimal in Euclidean metrics whose diameter is polynomial.
Compact Routing for Graphs Excluding a Fixed Minor (Extended Abstract)
, 2005
"... This paper concerns compact routing schemes with arbitrary node names. We present a compact nameindependent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routin ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
This paper concerns compact routing schemes with arbitrary node names. We present a compact nameindependent routing scheme for unweighted networks with n nodes excluding a fixed minor. For any fixed minor, the scheme, constructible in polynomial time, has constant stretch factor and requires routing tables with polylogarithmic number of bits at each node. For shortestpath labeled routing scheme in planar graphs, we prove an Ω(n ɛ) space lower bound for some constant ɛ>0. This lower bound holds even for bounded degree triangulations, and is optimal for polynomially weighted planar graphs (ɛ =1/2).
On spacestretch tradeoffs: upper bounds
 In SPAA
, 2006
"... One of the fundamental tradeoffs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – the maximum ratio over all pairs between the cost of the route induced by the scheme and the cost of a minimum cost path betwe ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
One of the fundamental tradeoffs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – the maximum ratio over all pairs between the cost of the route induced by the scheme and the cost of a minimum cost path between the same pair. All previous routing schemes required storage that is dependent on the diameter of the network. We present a new scalefree routing scheme, whose storage and header sizes are independent of the aspect ratio of the network. Our scheme is based on a decomposition into sparse and dense neighborhoods. Given an undirected network with arbitrary weights and n arbitrary node names, for any integer k ≥ 1 we present the first scalefree routing scheme with asymptotically optimal spacestretch tradeoff that does not require edge weights to be polynomially bounded. The scheme uses e O(n 1/k) space routing table at each node, and routes along paths of asymptotically optimal linear stretch O(k).
Distributed Data Location in a Dynamic Network
 IN PROC. OF ACM SPAA
, 2002
"... Modern networking applications replicate data and services widely, leading to a need for locationindependent routing  the ability to route queries directly to objects using names that are independent of the objects' physical locations. Two important properties of a routing infrastructure are routi ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
Modern networking applications replicate data and services widely, leading to a need for locationindependent routing  the ability to route queries directly to objects using names that are independent of the objects' physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be achieved with an efficient solution to the nearestneighbor problem. We present a new distributed algorithm that can solve the nearestneighbor problem for a restricted metric space. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa [16].