Title :
Link-state routing in networks with unidirectional links
Author :
Bao, Lichun ; Garcia-Luna-Aceves, J.J.
Author_Institution :
Comput. Sci. Dept., California Univ., Santa Cruz, CA, USA
Abstract :
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
Keywords :
computational complexity; protocols; radio links; telecommunication network routing; complexity; inclusive cycle; link-state routing; routing updates; simulations; unidirectional links; unidirectional network; verification; Algorithm design and analysis; Circuits; Computer science; Intelligent networks; Network topology; Radio broadcasting; Routing protocols; Satellite broadcasting; Tail; Wireless networks;
Conference_Titel :
Computer Communications and Networks, 1999. Proceedings. Eight International Conference on
Conference_Location :
Boston, MA
Print_ISBN :
0-7803-5794-9
DOI :
10.1109/ICCCN.1999.805543
