Results 1 
4 of
4
Scalable Routing on Flat Names
"... We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting. 1. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting. 1.
Approximate Distance Queries and Compact Routing in Sparse Graphs
"... Abstract—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data structure that retrieves stretch 2k−1 paths must require spaceΩ(n 1+1/k) for graphs of n nodes. The hard cases th ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data structure that retrieves stretch 2k−1 paths must require spaceΩ(n 1+1/k) for graphs of n nodes. The hard cases that enforce this lower bound are, however, rather dense graphs with average degreeΩ(n 1/k). We present data structures that, for sparse graphs, substantially break that lower bound barrier at the expense of higher query time. For instance, general graphs require O(n 3/2) space and constant query time for stretch 3 paths. For the realistic scenario of a graph with average degreeΘ(log n), special cases of our data structures retrieve stretch 2 paths with Õ(n 3/2) space and stretch 3 paths with Õ(n) space, albeit at the cost of Õ ( � n) query time. Moreover, supported by largescale simulations on graphs including the ASlevel Internet graph, we argue that our stretch2 scheme would be simple and efficient to implement as a distributed compact routing protocol. I.
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
, 2012
"... A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any pair of vertices. A lower bound, due to Thorup and Zwick, shows that a distance oracle that returns paths of worstcase st ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any pair of vertices. A lower bound, due to Thorup and Zwick, shows that a distance oracle that returns paths of worstcase stretch (2k−1) must require spaceΩ(n 1+1/k) for graphs over n nodes. The hard cases that enforce this lower bound are, however, rather dense graphs with average degreeΩ(n 1/k). We present distance oracles that, for sparse graphs, substantially break the lower bound barrier at the expense of higher query time. For any 1≤α ≤ n, our distance oracles can return stretch 2 paths using O(m+ n 2 /α) space and stretch 3 paths using O(m+n 2 /α 2) space, at the expense of O(αm/n) query time. By setting appropriate values ofα, we get the first distance oracles that have size linear in the size of the graph, and return constant stretch paths in nontrivial query time. The query time can be further reduced to O(α), by using an additional O(mα) space for all our distance oracles, or at the cost of a small constant additive stretch. We use our stretch 2 distance oracle to design a compact routing scheme that requires Õ(n 1/2) memory at each node and, after a handshaking phase, routes along paths with worstcase stretch 2. Moreover, supported by largescale simulations on graphs including the ASlevel Internet graph, we argue that our stretch2 scheme would be simple and efficient to implement as a distributed compact routing protocol. An earlier version of this paper appeared in INFOCOM 2011[1]. The extended version presents results that improve upon the results presented in the conference version; significantly more simplified presentation and proofs for the results in the conference version; and in addition, distance oracles for unweighted graphs.
Kevin Fall, Gianluca Iannaccone,
"... We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting. 1. ..."
Abstract
 Add to MetaCart
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting. 1.