.png){kind=icon}
返回
Distributed council election
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2004.828945.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the problem of electing a small number of representatives (council) out of a (possible large) group of anonymous candidates. The problem arises in scenarios such as multicast where, to avoid feedback implosion, a small subset of the receivers is chosen to provide feedback on network conditions. We present several algorithms for this problem and analyze the expected number of messages and rounds required for their convergence. In particular, we present an algorithm that almost always converges in one round using a small number of messages (for typical council size) when the number of hosts is known. In the case where the number of hosts is unknown (and too large to be polled), our algorithms converge in a small number of rounds that improves previous results by Bolot et al. (1994).
Keyword:
leader election
multicast
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Contraindicated Drug Responses in Dravet Syndrome Brain Organoids Utilizing Micro Electrode Array Assessment Methods.png)
Organoids
OAAI
OrganoidsIF0
OAAI分享收藏Feeding stem–leaf–pod explants of pea (Pisum sativum L.) with d-chiro-inositol or d-pinitol modifies composition of α-d-galactosides in developing seeds用d-手性肌醇或d-松醇处理豌豆（Pisum sativum L.）的茎-叶-荚愈伤组织，会改变发育种子中α-d-半乳糖苷的组成。
PREAI
分享收藏
查看更多内容