Abstract
Routing messages in a network is often based on the assumption that each link, and so each path, in the network is bidirectional. The two directions of a path are employed in routing messages as follows. One direction is used by the nodes in the path to forward messages to their destination at the end of the path, and the other direction is used by the destination to inform the nodes in the path that this path does lead to the destination. Clearly, routing messages is more difficult in directed networks where links are unidirectional. (Examples of such networks are mobile ad-hoc networks and satellite networks.) In this paper, we present the first stabilizing protocol for routing messages in directed networks. We keep our presentation manageable by dividing it into three (relatively simple) steps. In the first step, we develop an arbitrary directed network where each node broadcasts to every reachable node in the network. In the second step, we enhance the network such that each node broadcasts its shortest distance to the destination. In the third step, we enhance the network further such that each node can determine its best neighbor for reaching the destination.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cobb J., Waris M.: Propagated Timestamps: A Scheme for the Stabilization of Maximum-Flow Routing Protocols. In: Proceedings of the Third Workshop on Self-Stabilizing Systems (1997) pp. 185–200
Dolev S.: Self-Stabilization. MIT press, Cambridge, MA (2000)
Duros E., Dabbous W.: Supporting Unidirectional Links in the Internet. In: Proceedings of the First International Workshop on Satellite-Based Information Services (1996)
Duros E., Dabbous W., Izumiyama H., Fujii N., and Zhang Y.: A Link Layer Tunneling Mechanism for Unidirectional Links. Internet Request for Comments (RFC) 3077 (2001)
Garcia-Luna-Aceves, J.J.: Loop-Free Routing Using Diffusing Computations. IEEE/ACM Transactions on Networking. Vol 1 No. 1 (Feb. 1993)
Hedrick C.: Routing Information Protocol. Internet Request for Comments (RFC) 1058 (1988)
Moy J: OSPF Version 2. Internet Request for Comments (RFC) 1247 (1991)
Perkins C., Bhagwat P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: Proceedings of the ACM SIGCOMM Conference on Communication Architectures, Protocols and Applications (1994)
Prakash R.: Unidirectional Links Prove Costly in Wireless Ad Hoc Networks. In: Proceedings of the ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M for Mobility) (1999)
Prakash R., Singhal M.: Impact of Unidirectional Links in Wireless Ad Hoc Networks. DIMACS Series in Discrete Mathematics and Computer Science, Vol. 52 (2000)
Schneider M.: Self-Stabilization. In: ACM Computing Surveys Vol. 25 No. 1 (1983)
Schneider M., Gouda M.: Stabilization of Maximal Metric Trees. In: Proceedings of the International Conference on Distributed Computing Systems, Workshop on Self-Stabilizing Systems (1999)
Tanenbaum A.: Computer Networks (3rd edition). Prentice Hall (1996)
Vutukury S., Garcia-Luna-Aceves J.J.: A Simple Approximation to Minimum Delay Routing. In: Proceedings of the ACM SIGCOMM Conference on Communication Architectures, Protocols and Applications (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cobb, J.A., Gouda, M.G. (2001). Stabilization of Routing in Directed Networks. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-45438-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42653-0
Online ISBN: 978-3-540-45438-0
eBook Packages: Springer Book Archive