Name independent routing for growth bounded networks

Authors:
Ittai Abraham;Dahlia Malkhi
Affiliations:
Hebrew University of Jerusalem, Jerusalem, Israel;Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2005

Citing 27
Cited 18

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Improved routing strategies with succinct tables

Journal of Algorithms
Routing with polynomial communication-space trade-off

SIAM Journal on Discrete Mathematics
Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Compact routing with minimum stretch

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Space-efficiency for routing schemes of stretch factor three

Journal of Parallel and Distributed Computing
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed object location in a dynamic network

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems

ACM SIGACT News
A Space Lower Bound for Routing in Trees

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact routing with name independence

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor

Journal of Algorithms
Bounded Geometries, Fractals, and Low-Distortion Embeddings

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Compact and localized distributed data structures

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
LAND: stretch (1 + ε) locality-aware networks for DHTs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the nearest neighbor in growth-restricted metrics

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compact name-independent routing with minimum stretch

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Object location in realistic networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: name-independent compact routing in trees

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast construction of nets in low dimensional metrics, and their applications

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Distributed approaches to triangulation and embedding

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance estimation and object location via rings of neighbors

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Distance estimation and object location via rings of neighbors

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Local approximation schemes for ad hoc and sensor networks

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Optimal-stretch name-independent compact routing in doubling metrics

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards small world emergence

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A doubling dimension threshold θ(loglogn) for augmented graph navigability

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Towards fast decentralized construction of locality-aware overlay networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal scale-free compact routing schemes in networks of low doubling dimension

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Triangulation and embedding using small sets of beacons

Journal of the ACM (JACM)
Algorithms for sensor and ad hoc networks: advanced lectures

Algorithms for sensor and ad hoc networks: advanced lectures
A Lower Bound for Network Navigability

SIAM Journal on Discrete Mathematics
Randomized compact routing in decomposable metrics

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Resilient and low stretch routing through embedding into tree metrics

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Improved compact routing schemes for power-law networks

NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Distributed routing in tree networks with few landmarks

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Compact routing for graphs excluding a fixed minor

DISC'05 Proceedings of the 19th international conference on Distributed Computing
HDLBR: A name-independent compact routing scheme for power-law networks

Computer Communications
Distributed and compact routing using spatial distributions in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A weighted undirected network is Δ growth-bounded if the number of nodes at distance 2r around any given node is at most Δ times the number of nodes at distance r around the node. Given a weighted undirected network with arbitrary node names and ε 0, we present a routing scheme that routes along paths of stretch 1+ε and uses with high probability only O(1/εO (log Δ)log5n) bit routing tables per node.