Hierarchical Routing Using Link Vectors

Abstract

An area-based link-vector algorithm (ALVA) is introduced for the distributed maintenance of routing information in very large internetworks. According to ALVA, destinations in an internetwork are aggregated in areas in multiple levels of hierarchy. Routers maintain a database that contains a subset of the topology at each level of the hierarchy. This subset corresponds to those links used in preferred paths to reach destinations (nodes inside the same immediate area or remote areas). ALVA is the first hierarchical routing algorithm based on link-state information that does not require complete topology information at each level in the hierarchy. The correctness of ALVA is verified. Simulation results are presented showing that ALVA outperforms OSPF in terms of communication and storage overhead.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1998
Accession Number
ADA461749

Entities

People

  • J. J. Garcia-luna-aceves
  • Jochen Behrens

Organizations

  • Sun Microsystems

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Boundaries
  • California
  • Classification
  • Engineering
  • Hierarchies
  • Information Operations
  • Internet
  • Networks
  • Simulations
  • Specifications
  • Spine
  • Standards
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking