Abstract
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore, there is a distinguished process, called root, that may be reached from any other process by following the successor relation at each hop. Thus, under the successor relation, the processes are arranged as a directed acyclic graph that converges on the root process, i.e., a converging DAG (c-DAG). We present a network where each process may dynamically change its choice of successors, and during this change, the following two nice properties are satisfied. First, if the initial state of the network forms a c-DAG, then a c-DAG is preserved at all times. Second, if the protocol is started from an arbitrary state (i.e., where each variable has an arbitrary value), then a c-DAG is automatically restored.
This is a preview of subscription content, log in via an institution to check access.
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
Hedrick, C.: Routing information protocol. RFC 1058 (1988)
Moy, J.: Ospf version 2. RFC 1247 (August 1991)
Cobb, J.A., Gouda, M.G.: The request-reply family of group routing protocols. IEEE Transactions on Computers 46(6), 659–672 (1997)
Deering, S., Cheriton, D.: Multicast routing in datagram networks and extended lans. ACM Transactions on Computer Systems 8(2) (May 1990)
Garcia-Luna-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE/ACM Transactions on Networking 1(1) (February 1993)
Garcia-Luna-Aceves, J.J., S., M.: A path-finding algorithm for loop-free routing. IEEE/ACM Transactions on Networking 5(1) (February 1997)
Segall, A.: Distributed network protocols. IEEE Transactions on Information Theory IT-29(1), 23–35 (1983)
Garcia-Luna-Aceves, J., Soumya, R.: On-demand loop-free routing with link vectors. In: Proceedings of the 12th IEEE International Conference on Network Protocols, IEEE Computer Society Press, Los Alamitos (2004)
Johnson, D.B., Maltz, D.A., Hu, Y.C.: The dynamic source routing protocol for mobile ad hoc networks (dsr). draft-ietf-manet-dsr-09.txt (work in progress)
Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100. IEEE Computer Society Press, Los Alamitos (1999)
Vutukury, S., Garcia-Luna-Aceves, J.J.: An algorithm for multi-path computation using distance-vectors with predecessor information. In: Proceedings of the ICCCN Conference (1999)
Vutukury, S., Garcia-Luna-Aceves, J.J.: A distributed algorithm for multi-path computation. In: Proceedings of the IEEE GLOBECOM Conference, IEEE Computer Society Press, Los Alamitos (1999)
Zaumen, W., Garcia-Luna-Aceves, J.J.: Loop-free multi-path routing using generalized diffusing computations. In: Proc. of the INFOCOM Conference (1998)
Gouda, M.G.: The triumph and tribulation of system stabilization. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 1–18. Springer, Heidelberg (1995)
Arora, A., Gouda, M.G., Herman, T.: Composite routing protocols. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos (1990)
Cobb, J.A., Gouda, M.G.: Stabilization of general loop-free routing. Journal of Parallel and Distributed Computing 62, 922–944 (2002)
Cobb, J.A., Waris, M.: Propagated timestamps: A scheme for the stabilization of maximum-flow routing protocols. In: Proceedings of the Third Workshop on Self-Stabilizing Systems, pp. 185–200 (1997)
Gouda, M.G., Schneider, M.: Maximum flow routing. In: Proceedings of the Second Workshop on Self-Stabilizing Systems (1995)
Cobb, J.A.: Convergent multipath routing. In: Proceedings of the International Conference on Network Protocols (2002)
Gouda, M.: The Elements of Network Protocols. Wyley (1997)
Gouda, M.G., Schneider, M.: Maximizable routing metrics. In: Proceedings of the IEEE International Conference on Network Protocols, pp. 71–78. IEEE Computer Society Press, Los Alamitos (1998)
Gouda, M., Schneider, M.: Stabilization of maximal metric trees. In: Proceedings of the Workshop on Self-Stabilizing Systems at the International Conference on Distributed Computing Systems (June 1999)
Cobb, J.A.: Stabilization of loop-free redundant routing. The University of Texas at Dallas technical report (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cobb, J.A. (2007). Stabilization of Loop-Free Redundant Routing. In: Masuzawa, T., Tixeuil, S. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2007. Lecture Notes in Computer Science, vol 4838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76627-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-76627-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76626-1
Online ISBN: 978-3-540-76627-8
eBook Packages: Computer ScienceComputer Science (R0)