On a Space-Optimal Distributed Traversal Algorithm

• Authors: Sébastien Tixeuil
• Venue: WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
• Year: 2001

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(m2) 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.