Sciweavers

25 search results - page 1 / 5
» Routing in Networks with Low Doubling Dimension
Sort
View
ICDCS
2006
IEEE
14 years 5 days ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 9 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
PODC
2006
ACM
14 years 2 days ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 6 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ALGOSENSORS
2009
Springer
13 years 4 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...