Routing in Trees

  • Pierre Fraigniaud
  • Cyril Gavoille
Conference paper

DOI: 10.1007/3-540-48224-5_62

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2076)
Cite this paper as:
Fraigniaud P., Gavoille C. (2001) Routing in Trees. In: Orejas F., Spirakis P.G., van Leeuwen J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg

Abstract

This article focuses on routing messages along shortest paths in tree networks, using compact distributed data structures. We mainly prove that n-node trees support routing schemes with message headers, node addresses, and local memory space of size O(log n) bits, and such that every local routing decision is taken in constant time. This improves the best known routing scheme by a factor of O(log n) in term of both memory requirements and routing time. Our routing scheme requires headers and addresses of size slightly larger than log n, motivated by an inherent trade-off between address-size and memory space, i.e., any routing scheme with addresses on log n bits requires Ω(√n) bits of local memory-space. This shows that a little variation of the address size, e.g., by an additive O(log n) bits factor, has a significant impact on the local memory space.

Keywords

compact routing trees routing algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Pierre Fraigniaud
    • 1
  • Cyril Gavoille
    • 2
  1. 1.CNRS, Laboratoire de Recherche en InformatiqueUniversité Paris-SudOrsayFrance
  2. 2.Laboratoire Bordelais de Recherche en InformatiqueUniversité Bordeaux ITalenceFrance

Personalised recommendations