Distance-vector routing protocols for networks with unidirectionallink

摘要

We first introduce a simple distance-vector protocol for routingin networks having unidirectional links. The protocol can be seen as anadaptation for these networks of the strategy as used in the popular RIPprotocol. The protocol comprises two main algorithms, one for collecting“from” information, and the other one for generating andpropagating “to” information. However, the traditional RIPapproach has been a “busy” one because of the periodicsending of routing information even after the network has reached astable state. We make further improvements on the simple protocol to geta message-thrifty variant. A routing information message is sent onlywhen there is a change to the topology or when a link changes cost andonly those affected entries need to be sent around