- 期刊
A Self-stabilizing Distributed Spanning Tree Construction Algorithm with a Distributed Demon
並列摘要
A distributed system is self-stabilizing if it can reach a legitimate global state regardless of its any initial global state. A self-stabilizing algorithm for the maximum finding problem in distributed systems is proposed. The proposed algorithm runs on systems with a distributed demon. The selfstabilizing maximum finding algorithm can be used as a building block in other self-stabilizing algorithms by compositional method such that these algorithms can be designed and verified more easily. In addition, using the method, the convergence speed of these algorithms can be increased by reducing the interference between variables. We illustrate the application of the basic algorithm by designing a self-stabilizing breadth first search spanning tree construction algorithm.
被引用紀錄
延伸閱讀
- 林永富（1998）。An Efficient Fault-Containing Self-Stabilizing Algorithm for Finding a Maximal Independent Set〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611325012
- 劉瑜琳（2000）。A fault-containing self-stabilizing algorithm〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611303953
- Su, Y. C. (2020). A Distributed QoS Constrained Broadcast Algorithm [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201902663
- Tsai, S. Y. (2011). An efficient self-stabilizing algorithm for the minimal dominating set problem under a distributed scheduler [master's thesis, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2011.00236
- Yu, C. Y. (2002). An efficient fault-containing self-stabilizing algorithm for the shortest path problem in a distributed system [master's thesis, Yuan Ze University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611345617