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

Goran Konjevod; Andrea Richa; Donglin Xia

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

Goran Konjevod, Andrea Richa, Donglin Xia

IAFSE-CIDSE: Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

23 Scopus citations

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 language	English (US)
Title of host publication	Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Publisher	Association for Computing Machinery
Pages	939-948
Number of pages	10
ISBN (Electronic)	9780898716245
State	Published - 2007
Event	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States Duration: Jan 7 2007 → Jan 9 2007

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	07-09-January-2007

Other

Other	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Country	United States
City	New Orleans
Period	1/7/07 → 1/9/07

ASJC Scopus subject areas

Software
Mathematics(all)

Fingerprint Dive into the research topics of 'Optimal scale-free compact routing schemes in networks of low doubling dimension'. Together they form a unique fingerprint.

Cite this

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

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Konjevod, G, Richa, A & Xia, D 2007, Optimal scale-free compact routing schemes in networks of low doubling dimension. in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. 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.

@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",

note = "Funding Information: Supported in part by NSF grant CCR-0209138 and NSF CAREER grant CCR-9985284.; 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 ; Conference date: 07-01-2007 Through 09-01-2007",

year = "2007",

language = "English (US)",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "939--948",

booktitle = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007",

}

TY - GEN

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

AU - Konjevod, Goran

AU - Richa, Andrea

AU - Xia, Donglin

N1 - Funding Information: Supported in part by NSF grant CCR-0209138 and NSF CAREER grant CCR-9985284.

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

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

SP - 939

EP - 948

BT - Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

PB - Association for Computing Machinery

T2 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

Y2 - 7 January 2007 through 9 January 2007

ER -