Compact name-independent routing with minimum stretch-Reference-Cited by-同舟云学术

Compact name-independent routing with minimum stretch

Published:2008-06 Issue:3 Volume:4 Page:1-12
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Abraham Ittai¹,Gavoille Cyril²,Malkhi Dahlia³,Nisan Noam¹,Thorup Mikkel⁴

Affiliation:

1. Hebrew University of Jerusalem, Jerusalem, Israel

2. University of Bordeaux, Bordeaux, France

3. Hebrew University of Jerusalem, Jerusalem, Israel & Microsoft Research

4. AT&T Labs - Research, Florham Park, NJ

Abstract

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 optimal in a very strong sense. It is known that no compact routing using o ( n ) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(√ n ,)space per node.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1367064.1367077

Reference20 articles.

1. Compact routing with name independence

2. Compact distributed data structures for adaptive routing

3. Improved routing strategies with succinct tables

4. Sparse partitions

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces;IEEE/ACM Transactions on Networking;2020-06

2. Disconnected components detection and rooted shortest-path tree maintenance in networks;Journal of Parallel and Distributed Computing;2019-10

3. Routing Sets and Hint-Based Routing;Lecture Notes in Networks and Systems;2019-02-02

4. Near-Optimal Distributed Routing with Low Memory;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23

5. Solving the minimum edge-dilation k-center problem by genetic algorithms;Computers & Industrial Engineering;2017-11