On Hierarchical Routing in Doubling Metrics

Abstract

This paper studies the problem of routing in doubling metrics, and shows how to perform hierarchical routing in such metrics with small stretch and compact routing tables (i.e., with a small amount of routing information stored at each vertex).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 2004
Accession Number
ADA490222

Entities

People

  • Anupam K. Gupta
  • Bruce M. Maggs
  • Shuheng Zhou

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Clustering
  • Computer Science
  • Decomposition
  • Diameters
  • Guarantees
  • Inequalities
  • Network Protocols
  • Probability
  • Probability Distributions
  • Specifications
  • Standards
  • Theoretical Computer Science
  • Topology
  • Triangles
  • Urban Areas

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Operations Research