.png){kind=icon}
.png){kind=icon}
Return
Scalable self-stabilization
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.2001.1824.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 0(k(2)). Apart from its applicability to a wide class of problems, the proposed method achieves scalability with a low space complexity of O(Delta.(Delta.k + log(2) n)) per process, where A is the maximum degree of a node. (C) 2002 Elsevier Science (USA).
Keywords:
ALGORITHM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available