### Abstract

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 be covered by at most 2^{α} balls of radius r/2. Given any δ > 0 and a weighted undirected network G whose shortest path metric d is a doubling metric with doubling dimension α, we present a name-independent routing scheme for G with (9+δ)-stretch, (2+ 1/δ)^{O(α)}(log Δ)^{2}(log n)-bit routing information at each node, and packet headers of size O(log n), where Δ is the ratio of the largest to the smallest shortest path distance in G. In addition, we prove that for any ε ∈. (0, 8), there is a doubling metric network G with n nodes, doubling dimension α ≤ 6 - log ε, and Δ = O(2^{1/ε}n) such that any name-independent routing scheme on G with routing information at each node of size o(n ^{(ε60)2})-bits has stretch larger than 9 - ε. Therefore assuming that Δ is bounded by a polynomial on n, our algorithm basically achieves optimal stretch for name-independent routing in doubling metrics with packet header size and routing information at each node both bounded by a polylogarithmic function of n.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006 |

Publisher | Association for Computing Machinery (ACM) |

Pages | 198-207 |

Number of pages | 10 |

ISBN (Print) | 1595933840, 9781595933843 |

DOIs | |

State | Published - Jan 1 2006 |

Event | 25th Annual ACM Symposium on Principles of Distributed Computing 2006 - Denver, CO, United States Duration: Jul 23 2006 → Jul 26 2006 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
---|---|

Volume | 2006 |

### Conference

Conference | 25th Annual ACM Symposium on Principles of Distributed Computing 2006 |
---|---|

Country | United States |

City | Denver, CO |

Period | 7/23/06 → 7/26/06 |

### Keywords

- Compact Routing
- Doubling Metrics
- Name-Independent Routing

### ASJC Scopus subject areas

- Software
- Hardware and Architecture
- Computer Networks and Communications

## Fingerprint Dive into the research topics of 'Optimal-stretch name-independent compact routing in doubling metrics'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006*(pp. 198-207). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 2006). Association for Computing Machinery (ACM). https://doi.org/10.1145/1146381.1146412