Accession Number:

ADA461672

Title:

Unidirectional Link-State Routing With Propagation Control

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING

Report Date:

2000-01-01

Pagination or Media Count:

7.0

Abstract:

Abstract Unidirectional links can occur in wireless networks and mixed-media networks. However, the vast majority of routing algorithms proposed to date require bidirectional links to operate. We present an efficient link-state routing algorithm, which we call ULPC, that operates with unidirectional links. ULPC is based on the concept of inclusive cycle of a link, which is the distance that link-state updates about the link must propagate to ensure correct routing within the network. ULPC incrementally disseminates and selectively utilizes unidirectional link-state information to build correct routing tables. ULPC is verified to be correct. Simulations on a 20-node network with unidirectional links show that ULPC is superior over the traditional link-state routing algorithms relying on topology broadcast.

Subject Categories:

  • Numerical Mathematics
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE