Link-State Routing in Networks with Unidirectional Links

Abstract

It is shown that a unidirectional link of a network can be used for routing only if it has an inclusive cycle, which is a path that can carry routing updates from the downstream node to the upstream node joined by the unidirectional link. A new routing algorithm for networks with unidirectional links is then presented, which incrementally disseminates link state information and selectively utilizes unidirectional links in networks. The new algorithm is verified to be correct and its complexity is analyzed. Simulations on a 20-node unidirectional network show that the new algorithm is more efficient than topology broadcasting.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1999
Accession Number
ADA461742

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Lichun L. Bao

Organizations

  • University of California, Santa Cruz

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Cellular Networks
  • Computers
  • Control Systems
  • Efficiency
  • Engineering
  • Information Operations
  • Mobile Devices
  • Mobile Phones
  • Networks
  • Routing Protocols
  • Simulations
  • Topology
  • Unidirectional

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Atmospheric Science / Meteorology, specifically Wind Wave Turbulence.
  • Tactical Satellite Communications Systems Engineering.