A Multipath Routing Protocol For Unidirectoinal Networks

摘要

Most of the routing protocols designed for Internet nowadays are for networks with bidirectional links. These protocols cannot be easily extended to networks with unidirectoinal links without cost increase. In [1], Chen et al. presented a distance-vector-based routing protocol for unidirectoinal networks where a routing table is derived for each node in the network. In this paper, we extend the protocol in [1] by keeping one path for each outgoing link of a node to maintain multiple paths in the corresponding routing table. The path for a specific outgoing link is the shortest path from the node to the destination through that outgoing link. Thus, the protocol provides alternative paths that are vital in the dynamic network environment.