Abstract
A traversal algorithm is a systematic procedure for exploring a graph by examining all of its vertices and edges. A traversal is Eulerian if every edge is examined exactly once. We present a simple deterministic distributed algorithm for the Eulerian traversal problem that is space-optimal: each node has exactly d states, where d is the outgoing degree of the node, yet may require O(m 2) message exchanges before it performs an Eulerian traversal, where m is the total number of edges in the network. In addition, our solution has failure tolerance properties: (i) messages that are exchanged may have their contents corrupted during the execution of the algorithm, and (ii) the initial state of the nodes may be arbitrary.
Then we discuss applications of this algorithm in the context of self- stabilizing virtual circuit construction and cut-through routing. Self- stabilization [8,9] guarantees that a system eventually satisfies its specification, regardless of the initial configuration of the system. In the cutthrough routing scheme, a message must be forwarded by intermediate nodes before it has been received in its entirety. We propose a transformation of our algorithm by means of randomization so that the resulting protocol is self-stabilizing for the virtual circuit construction specification. Unlike several previous self-stabilizing virtual circuit construction algorithms, our approach has a small memory footprint, does not require central preprocessing or identifiers, and is compatible with cut-through routing.
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
D. Alstein, J. H. Hoepman, B.E. Olivier, and P.I.A. van der Put. Self-stabilizing mutual exclusion on directed graphs. Technical Report CS-R9513, CWI, 1994. Published in Computer Science in the Netherlands (CSN 94), pp. 45–53.
J. Beauquier, A.K. Datta, and S. Tixeuil. Self-stabilizing Census with Cut-through Constraints. In Proceedings of the Fourth Workshop on Self-stabilizing Systems (WSS’99), Austin, Texas. pp. 70–77, May 1999.
J. Beauquier, J. Duran-Lose, M. Gradinariu, and C. Johnen. Token Based Self-Stabilizing Uniform Algorithms. LRI Research Report no. 1250, March, 2000.
J. Beauquier, M. Gradinariu, and C. Johnen. Memory Space Requirements for Self-stabilizing Leader Election Protocols. In Proceedings of the International Conference on Principles of Distributed Computing (PODC’99), Atlanta, pp. 199–208, 1999.
J. Beauquier, T. Herault, and E. Schiller. Easy Self-stabilization with an Agent. LRI Research Report no. 1280, April, 2001.
A.M. Costello and G. Varghese. The FDDI MAC meets self-stabilization. In Proceedings of the Fourth Workshop on Self-stabilizing Systems (WSS’99), Austin, Texas. pp. 1–9, May 1999.
X. Deng and C.H. Papadimitriou. Exploring an unkown graph. In Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, Vol. I, pp. 355–361, 1990.
E.W. Dijkstra. Self-stabilization in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643–644, 1974.
S. Dolev. Self-stabilization. The MIT Press. 2000.
M. G. Gouda and T. Herman. Adaptive programming. IEEE Transactions on Software Engineering, 17:911–921, 1991.
M.G. Gouda and N. Multari. Stabilizing communication protocols. IEEE Transactions on Computers, 40:448–458, 1991.
M. Hadim M. and A. Bouabdallah. A distributed algorithm for constructing an Eulerian cycle in networks. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’99), Las Vegas, USA, June 28th–July 1st, 1999.
T. Herman. A Comprehensive Bibliography on Self-Stabilization. A Working Paper in the Chicago Journal of Theoretical Computer Science. Available at http://www.cs.uiowa.edu/ftp/selfstab/bibliography/.
M. Tchuente. Sur l’auto-stabilisation dans un réseau d’ordinateurs. RAIRO Informatique Thé;orique, 15:47–66, 1981.
S. Tixeuil. Algorithmes Auto-stabilisants à Délai Borné. Paris-Orsay-Cachan Seminar, Dec. 17, 1996.
S. Tixeuil. Auto-stabilisation Efficace. Ph.D. Thesis, Université de Paris Sud, France. Jan. 2000. Available at http://www.lri.fr/~tixeuil.
S. Tixeuil and J. Beauquier. Self-stabilizing Token Ring. In Proceedings of International Conference on System Engineering (ICSE’;96), Las Vegas, Nevada. Jul. 1996.
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
Tixeuil, S. (2001). On a Space-Optimal Distributed Traversal Algorithm. 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_15
Download citation
DOI: https://doi.org/10.1007/3-540-45438-1_15
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