Self-stabilizing maxima finding on general graphs

Self-stabilization is an approach for fault tolerance in presence of transientfaults in distributed systems. Leader election in distributed systems is ofinterest because a leader is used for many key tasks like co-ordination,check-pointing, and acting as servers. In this paper, we consider the problemof electing a leader in networks of any topology in a self-stabilizing manner.We do not make any assumptions about the nature of transient faults, andeffectively deal with faults like corrupted messages, transmission errors, andfake ids. The robustness of our protocol is demonstrated by the fact that we donot make assumptions about knowledge of diameter of the network, or channelproperties. Our protocol also constructs a minimum depth spanning tree of thenetwork rooted at the leader. This is a desirable property in applicationswhere communication between a node and the leader takes place along the path inthe spanning tree.

By: Vinayaka Pandit, D.M. Dhamdhere

Published in: RI02009 in 2002


RI02009.pdf

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

RI02009.pdf


Questions about this service can be mailed to reports@us.ibm.com .