.png){kind=icon}
返回
Silent self-stabilizing BFS tree algorithms revisited
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2016.06.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al. algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps). (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Self-stabilization
BFS spanning tree
Composite atomicity model
Distributed unfair daemon
Stabilization time
Round and step complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
分享收藏Use of cross correlation in studying the response of lightly damped structures to random forces..png)
AIAA Journal
AIAA JournalIF0
PREAI
分享收藏Evaluation of Outpatient Anticoagulation Bridging After Left Ventricular Assist Device Implantation
OAAI
OAAI分享收藏
查看更多内容