Self-stabilising protocols on oriented chains with joins and leaves Online publication date: Fri, 05-Dec-2014
by Doina Bein; Hirotsugu Kakugawa; Toshimitsu Masuzawa
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 5, No. 2, 2012
Abstract: A key problem in designing self-stabilising algorithm is to minimise the stabilisation time (also called convergence time), that is, the maximum time necessary to bring a system into a legitimate configuration after an arbitrary initialisation or after a fault; this process is called stabilisation. Except for Masuzawa and Kakugawa (2005); Nakaminami et al. (2006), it was always measured either from the initial configuration or the configuration after the fault. When a fault has only a local effect, this measure overestimates the time to stabilise, since a system may recover much faster after a fault than after an arbitrary initialisation. We measure the stabilisation time only from the initial configuration. We show the efficiency of this measure that includes as parameter the number of faults, for a consensus algorithm on an oriented chain where processes can join or leave at will.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook