Link-state routing in networks with unidirectional links
Lichun Bao, Jose Joaquin Garcia-Luna-Aceves · 2003
It is shown that a unidirectional link of a network can be used for routing only if it has an inclusive cycle, which provides a path to carry routing updates from the downstream node to the upstream node joint 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.