## Interval Routing Schemes allow Broadcasting with Linear Message-Complexity (2000)

### Cached

### Download Links

- [dept-info.labri.u-bordeaux.fr]
- [dept-info.labri.u-bordeaux.fr]
- [dept-info.labri.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 11 - 4 self |

### BibTeX

@MISC{Fraigniaud00intervalrouting,

author = {Pierre Fraigniaud and Cyril Gavoille and Bernard Mans},

title = {Interval Routing Schemes allow Broadcasting with Linear Message-Complexity},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

The purpose of compact routing is to provide a labeling of the nodes of a network, and a way to encode the routing tables so that routing can be performed eciently (e.g., on shortest paths) while keeping the memory-space required to store the routing tables as small as possible. In this paper, we answer a long-standing conjecture by showing that compact routing can also help to perform distributed computations. In particular, we show that a network supporting a shortest path interval routing scheme allows to broadcast with an O(n) message-complexity, where n is the number of nodes of the network. As a consequence, we prove that O(n) messages suce to solve leader-election for any graph labeled by a shortest path interval routing scheme, improving therefore the O(m + n) previous known bound.