Assigning labels in unknown anonymous networks (extended abstract)

  • Authors:

  • Pierre Fraigniaud;Andrzej Pelc;David Peleg;Stéphane Pérennes

  • Affiliations:

  • Laboratoire de Recherche en Informatique - CNRS, Université Paris-Sud, 91405 Orsay, France;Département d'Informatique, Université du Québec à Hull, Hull, Quéebec J8X 3X7, Canada;Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel;SLOOP I3S-CNRS/INRIA, Université de Nice-Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902 Sophia Antipolis Cedex, France

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the task of distributedly assigning distinct labels to nodes of an unknown anonymous network. A priori, nodes do not have any identities (anonymous network) and do not know the topology or the size of the network (unknown network). They execute identical algorithms, apart from a distinguished node, called the source, which starts the labeling process. Our goal is to assign short labels, as fast as possible. The quality of a labeling algorithm is measured by the range from which the algorithm picks the labels, or alternatively, the length of the assigned labels. Natural efficiency measures are the time, i.e., the number of rounds required for the label assignment, and the message and bit complexities of the label assignment protocol, i.e., the total number of messages (resp., bits) circulating in the network. We present label assignment algorithms whose time and message complexity are asymptotically optimal and which assign short labels. On the other hand, we establish inherent trade-offs between quality and efficiency for labeling algorithms.