Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

  • Authors:

  • Pierre Fraigniaud;Cyril Gavoille;Bernard Mans

  • Affiliations:

  • Laboratoire de Recherche en Informatique, Bât. 490, Univ. Paris-Sud, 91405 Orsay cedex, France;Laboratoire Bordelais de Recherche en Informatique, Univ. Bordeaux I, 33405 Talence cedex, France;Department of Computing, Division of ICS, Macquarie Univ., Sydney, NSW 2109, Australia

  • Venue:
  • Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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 efficiently (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 suffice to solve leader-election for any graph labeled by a shortest path interval routing scheme, improving therefore the O(m + n) previous known bound.