### 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 Annual ACM-SIAM Symposium on Discrete Algorithms |

Publisher | Association for Computing Machinery |

Pages | 939-948 |

Number of pages | 10 |

Volume | 07-09-January-2007 |

ISBN (Print) | 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 |

### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Mathematics(all)

### Cite this

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