Fault-tolerant routing algorithms for unidirectional networks

Abstract

We present an improved version of a distance-vector protocol for routing in networks with unidirectional links, which has the added capabilities of handling link and node faults as well as addition and deletion of nodes. Because of the unidirectional nature of links, the design of a correct and efficient protocol for such networks is nontrivial. We discuss the behavior and performance of the proposed protocol.