Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks.
Lecture Notes in Computer Science(2019)
摘要
Many articles deal with the problem of maintaining a rooted shortest-path tree. However, after some edge deletions, some nodes can be disconnected from the connected component V-r of some distinguished node r. In this case, an additional objective is to ensure the detection of the disconnection by the nodes that no longer belong to V-r. Without any assumption on the asynchronous model (unfair daemon), with no knowledge of the network and within an anonymous network, we present a silent self-stabilizing algorithm solving this more demanding task and running in less than 2n + D rounds for a network of n nodes and hopdiameter D.
更多查看译文
关键词
Routing algorithm,Shortest-path,Disconnected network,Self-stabilization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络