消息
loading
Scalable Self-Stabilization

Author: Ghosh S.   He X.  

Publisher: Academic Press

ISSN: 0743-7315

Source: Journal of Parallel and Distributed Computing, Vol.62, Iss.5, 2002-05, pp. : 945-960

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This paper presents a methodology for a synchronous non-reactive distributed system on a tree topology to stabilize from a k-faulty configuration in a time independent of the size n of the system. In the proposed methodology, processes first measure and compare the sizes of the faulty regions, and then use this information to schedule actions in such a way that the size of the faulty regions progressively shrink, until they completely disappear. We demonstrate that when k processes fail, the stabilization time is O(k2). Apart from its applicability to a wide class of problems, the proposed method achieves scalability with a low space complexity of O(Δ.(Δ.k+log2 n)) per process, where Δ is the maximum degree of a node. © 2002 Elsevier Science (USA).