Article

A space lower bound for name-independent compact routing in trees

Authors:

Kofi A. Laing,

Rajmohan RajaramanAuthors Info & Claims

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

Page 216

https://doi.org/10.1145/1073970.1074005

Published: 18 July 2005 Publication History

Get Access

Abstract

No abstract available.

References

[1]

I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. In Proc. 18th Int'l. Symp. on Distrib. Computing (DISC), Oct 2004.

Crossref

Google Scholar

[2]

P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In 19th STACS. LNCS-Springer, 2002.

Digital Library

Google Scholar

[3]

C. Gavoille and M. Gengler. Space-efficiency of routing schemes of stretch factor three. In 4th (SIROCCO), pages 162--175, July 1997.

Google Scholar

[4]

M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1997.

Digital Library

Google Scholar

[5]

M. Thorup and U. Zwick. Approximate distance oracles. In 33rd ACM STOC, pages 183--192, 2001.

Digital Library

Google Scholar

Cited By

View all

Krioukov Dclaffy kFall KBrady A(2007)On compact routing for the internetACM SIGCOMM Computer Communication Review10.1145/1273445.127345037:3(41-52)Online publication date: 20-Jul-2007
https://dl.acm.org/doi/10.1145/1273445.1273450
Abraham IGavoille CMalkhi DGibbons PVishkin U(2006)On space-stretch trade-offsProceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1148109.1148144(217-224)Online publication date: 30-Jul-2006
https://dl.acm.org/doi/10.1145/1148109.1148144
Abraham IGavoille CMalkhi DGibbons PVishkin U(2006)On space-stretch trade-offsProceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1148109.1148143(207-216)Online publication date: 30-Jul-2006
https://dl.acm.org/doi/10.1145/1148109.1148143

Index Terms

A space lower bound for name-independent compact routing in trees
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

Compact name-independent routing with minimum stretch

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using aÕ(√n,) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the minimum cost paths. This is ...
Compact name-independent routing with minimum stretch
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a Õ(√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-stretch name-independent compact routing in doubling metrics
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

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 of a metric space is the least value α such that any ball of radius r can ...

Comments

Information & Contributors

Information

Published In

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

July 2005

346 pages

ISBN:1581139861

DOI:10.1145/1073970

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Paul Spirakis
Research and Academic Computer Technology Institute, Greece

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA05

Sponsor:

SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005

July 18 - 20, 2005

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
188
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)2

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Krioukov Dclaffy kFall KBrady A(2007)On compact routing for the internetACM SIGCOMM Computer Communication Review10.1145/1273445.127345037:3(41-52)Online publication date: 20-Jul-2007
https://dl.acm.org/doi/10.1145/1273445.1273450
Abraham IGavoille CMalkhi DGibbons PVishkin U(2006)On space-stretch trade-offsProceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1148109.1148144(217-224)Online publication date: 30-Jul-2006
https://dl.acm.org/doi/10.1145/1148109.1148144
Abraham IGavoille CMalkhi DGibbons PVishkin U(2006)On space-stretch trade-offsProceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1148109.1148143(207-216)Online publication date: 30-Jul-2006
https://dl.acm.org/doi/10.1145/1148109.1148143

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Compact name-independent routing with minimum stretch

Compact name-independent routing with minimum stretch

Optimal-stretch name-independent compact routing in doubling metrics