(Enter summary)
Abstract: This paper presents a family of memory-balanced routing schemes that use relatively
short paths while storing relatively little routing information. The hierarchical
schemes H k (for every integer k 1) guarantee a stretch factor of O(k
2
) on the length
of the routes and require storing at most O(kn
1
k
log n log D) bits of routing information
per vertex in an n-processor network with diameter D. The schemes are nameindependent
and applicable to general networks with arbitrary edge... (Update)
Cited by: More
On Hierarchical Routing in Doubling Metrics - Hubert Chan Anupam
(Correct)
Distance and Routing Labeling Schemes for Non-Poositively Curved.. - Chepoi (2003)
(Correct)
Distance and Routing Labeling Schemes for Non-positively Curved .. - Chepoi, al. (2004)
(Correct)
Similar documents (at the sentence level): More
30.6%: Sparse Partitions (Extended Abstract) - Awerbuch, Peleg (1990)
(Correct)
8.9%: Locality-Sensitive Resource Allocation - Awerbuch, Peleg (1990)
(Correct)
6.6%: Compact Distributed Data Structures for Adaptive Routing - Awerbuch, Bar-Noy, Linial, .. (1994)
(Correct)
Active bibliography (related documents): More All
0.6: Compact and Localized Distributed Data Structures - Gavoille, Peleg (2002)
(Correct)
0.3: Near-Linear Cost Sequential and Distributed.. - Awerbuch, Berger.. (1993)
(Correct)
0.3: Addressing in Internetwork Protocols - Francis (1994)
(Correct)
Similar documents based on text: More All
0.5: On Buffer-Economical Store-and-Forward Deadlock Prevention - Awerbuch, Kutten, Peleg (1996)
(Correct)
0.3: Effects of Multi-rate in Ad Hoc Wireless Networks - Awerbuch, Holmer, Rubens
(Correct)
0.2: Network Synchronization With Polylogarithmic Overhead - Awerbuch, Peleg (1990)
(Correct)
Related documents from co-citation: More All
19: Improved Routing Strategies with Succinct Tables (context) - Awerbuch, Bar-Noy et al. - 1990
19: Routing in distributed networks: Overview and open problems
- Gavoille - 2001
19: Compact routing with minimum stretch
- Cowen
BibTeX entry: (Update)
B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math., Vol. 5, No. 2, 1992, 151-162. http://citeseer.ist.psu.edu/awerbuch93routing.html More
@article{ awerbuch92routing,
author = "Baruch Awerbuch and David Peleg",
title = "Routing with Polynomial Communication-Space Trade-Off",
journal = "SIAM Journal on Discrete Mathematics",
volume = "5",
number = "2",
pages = "151-162",
year = "1992",
url = "citeseer.ist.psu.edu/awerbuch93routing.html" }
Citations (may not include all citations):
101
Labelling and implicit Routing in Networks (context) - Santoro, Khatib - 1985
61
Designing Networks with Compact Routing Tables (context) - Frederickson, Janardan - 1988
55
Online Tracking of Mobile Users
- Awerbuch, Peleg - 1989
47
Compact Distributed Data Structures for Adaptive Routing
- Awerbuch, Bar-Noy et al. - 1989
26
A Tradeoff between Size and Efficiency for Routing Tables (context) - Peleg, Upfal - 1989
15
Hierarchical Networks and the Subnetwork Partition Problem (context) - Perlman - 1982
12
Hierarchical Routing for Large Networks; Performance Evaluat.. (context) - Kleinrock, Kamoun - 1977
12
Distance-Dependent Distributed Directories (context) - Peleg - 1989
11
Routing with Compact Routing Tables (context) - van Leeuwen, Tan - 1986
9
Efficient Deadlock-Free Routing (context) - Awerbuch, Kutten et al. - 1990
7
Optimal Clustering Structures for Hierarchical Topological D.. (context) - Kleinrock, Kamoun - 1980
7
Separator-Based Strategies for Efficient Message Routing (context) - Frederickson, Janardan - 1986
6
Sparse Graph Partitions (context) - Peleg - 1989
6
Establishing Virtual Circuits in Large Computer Networks (context) - Baratz, Jaffe - 1986
6
The Computer Journal (context) - van Leeuwen, Tan et al. - 1987
4
Addressing Problems in Multi-Network Systems (context) - Sunshine - 1982
1
Local Synchronizers (context) - Awerbuch, Peleg - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/condor.cs.jhu.edu.html): More
Comparative Study of Electronic Mail Systems - Pop (1994)
(Correct)
Subtyping Constrained Types - Trifonov, Smith (1996)
(Correct)
Decision Tree Construction in Fixed Dimensions.. - Goodrich, Mirelli, .. (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC