Optimal scale-free compact routing schemes in networks of low doubling dimension

Goran Konjevod, Andrea Richa, Donglin Xia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

We present optimal-stretch scale-free compact routing schemes for networks of low doubling dimension, in both the name-independent and name-dependent models. Our name-independent algorithm is the first scale-free name-independent compact routing scheme to achieve asymptotically optimal stretch, closing the gaps left by the work of Abraham et al. (ICDCS'06) and Konjevod et al. (PODC'06). Our name-dependent algorithm is the first scale-free optimal-stretch name-dependent compact routing scheme that uses optimal ⌈log n⌉-bit routing labels, in spite of the limited routing label information. We define a simple hierarchical decomposition technique based on ball-packings. Our algorithms rely on a novel combination of ball-packings and hierarchical r-nets, which we see as a contribution in its own right.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
PublisherAssociation for Computing Machinery
Pages939-948
Number of pages10
Volume07-09-January-2007
ISBN (Print)9780898716245
StatePublished - 2007
Event18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States
Duration: Jan 7 2007Jan 9 2007

Other

Other18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
CountryUnited States
CityNew Orleans
Period1/7/071/9/07

Fingerprint

Doubling
Routing
Stretch
Labels
Packing
Dependent
Ball
Decomposition
Decomposition Techniques
Asymptotically Optimal

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Konjevod, G., Richa, A., & Xia, D. (2007). Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 07-09-January-2007, pp. 939-948). Association for Computing Machinery.

Optimal scale-free compact routing schemes in networks of low doubling dimension. / Konjevod, Goran; Richa, Andrea; Xia, Donglin.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 07-09-January-2007 Association for Computing Machinery, 2007. p. 939-948.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Konjevod, G, Richa, A & Xia, D 2007, Optimal scale-free compact routing schemes in networks of low doubling dimension. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. vol. 07-09-January-2007, Association for Computing Machinery, pp. 939-948, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, United States, 1/7/07.
Konjevod G, Richa A, Xia D. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 07-09-January-2007. Association for Computing Machinery. 2007. p. 939-948
Konjevod, Goran ; Richa, Andrea ; Xia, Donglin. / Optimal scale-free compact routing schemes in networks of low doubling dimension. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 07-09-January-2007 Association for Computing Machinery, 2007. pp. 939-948
@inproceedings{dd41e302910d480788d329ee56d51cae,
title = "Optimal scale-free compact routing schemes in networks of low doubling dimension",
abstract = "We present optimal-stretch scale-free compact routing schemes for networks of low doubling dimension, in both the name-independent and name-dependent models. Our name-independent algorithm is the first scale-free name-independent compact routing scheme to achieve asymptotically optimal stretch, closing the gaps left by the work of Abraham et al. (ICDCS'06) and Konjevod et al. (PODC'06). Our name-dependent algorithm is the first scale-free optimal-stretch name-dependent compact routing scheme that uses optimal ⌈log n⌉-bit routing labels, in spite of the limited routing label information. We define a simple hierarchical decomposition technique based on ball-packings. Our algorithms rely on a novel combination of ball-packings and hierarchical r-nets, which we see as a contribution in its own right.",
author = "Goran Konjevod and Andrea Richa and Donglin Xia",
year = "2007",
language = "English (US)",
isbn = "9780898716245",
volume = "07-09-January-2007",
pages = "939--948",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Optimal scale-free compact routing schemes in networks of low doubling dimension

AU - Konjevod, Goran

AU - Richa, Andrea

AU - Xia, Donglin

PY - 2007

Y1 - 2007

N2 - We present optimal-stretch scale-free compact routing schemes for networks of low doubling dimension, in both the name-independent and name-dependent models. Our name-independent algorithm is the first scale-free name-independent compact routing scheme to achieve asymptotically optimal stretch, closing the gaps left by the work of Abraham et al. (ICDCS'06) and Konjevod et al. (PODC'06). Our name-dependent algorithm is the first scale-free optimal-stretch name-dependent compact routing scheme that uses optimal ⌈log n⌉-bit routing labels, in spite of the limited routing label information. We define a simple hierarchical decomposition technique based on ball-packings. Our algorithms rely on a novel combination of ball-packings and hierarchical r-nets, which we see as a contribution in its own right.

AB - We present optimal-stretch scale-free compact routing schemes for networks of low doubling dimension, in both the name-independent and name-dependent models. Our name-independent algorithm is the first scale-free name-independent compact routing scheme to achieve asymptotically optimal stretch, closing the gaps left by the work of Abraham et al. (ICDCS'06) and Konjevod et al. (PODC'06). Our name-dependent algorithm is the first scale-free optimal-stretch name-dependent compact routing scheme that uses optimal ⌈log n⌉-bit routing labels, in spite of the limited routing label information. We define a simple hierarchical decomposition technique based on ball-packings. Our algorithms rely on a novel combination of ball-packings and hierarchical r-nets, which we see as a contribution in its own right.

UR - http://www.scopus.com/inward/record.url?scp=84969165560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969165560&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84969165560

SN - 9780898716245

VL - 07-09-January-2007

SP - 939

EP - 948

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

PB - Association for Computing Machinery

ER -