.png){kind=icon}
返回
Self-stabilizing deterministic network decomposition
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2001.1811.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a simple and efficient self-stabilizing protocol for the network partitioning problem. Given a graph with k(2) nodes, our decomposition scheme partitions the network into connected and disjoint partitions, with k nodes per partition. The proposed algorithm starts with a spanning tree of the graph, but uses some links which do not belong to the tree, if necessary. The protocol is self-stabilizing meaning that starting from an arbitrary state, it is guaranteed to reach a state where the network is correctly partitioned. The protocol stabilizes in 3(h+1) rounds, where h is the height of the tree. We also propose solutions to the case where the network size is n not equal k(2). Hence our protocol works for dynamic systems in the sense that the protocol can adapt to changes of the network size. We discuss an important application of the proposed protocol. (C) 2002 Elsevier Science (USA).
Keyword:
network decomposition
quorum systems
self-stabilization
spanning tree
期刊
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
分享收藏REPORT UPON THE AUTUMN INFLUENZA EPIDEMIC (1918) AS IT AFFECTED THE N.Z.E.F. IN THE UNITED KINGDOM.The Lancet
OAAI
The LancetIF0
OAAI分享收藏
查看更多内容