Link-State Routing in Networks with Unidirectional Links
CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING
Pagination or Media Count:
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.
- Computer Systems
- Radio Communications