Accession Number:

ADA461742

Title:

Link-State Routing in Networks with Unidirectional Links

Descriptive Note:

Conference paper

Corporate Author:

CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING

Report Date:

1999-01-01

Pagination or Media Count:

7.0

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.

Subject Categories:

  • Computer Systems
  • Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE