电邮这篇文章 Fast protocols for leader election and spanning tree construction in a distributed network
- 作者: Vyalyi M.N.1,2,3, Khuziev I.M.3
-
隶属关系:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- National Research University—Higher School of Economics
- Moscow Institute of Physics and Technology (State University)
- 期: 卷 53, 编号 2 (2017)
- 页面: 183-201
- 栏目: Communication Network Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166388
- DOI: https://doi.org/10.1134/S0032946017020065
- ID: 166388
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
We consider leader election and spanning tree construction problems in a synchronous network. Protocols are designed under the assumption that nodes in the network have identifiers but the size of an identifier is unlimited. We present fast protocols with runtime O(D log L+L), where L is the size of the minimal identifier and D is the network diameter.
作者简介
M. Vyalyi
Dorodnitsyn Computing Center of the Russian Academy of Sciences; National Research University—Higher School of Economics; Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: vyalyi@gmail.com
俄罗斯联邦, Moscow; Moscow; Moscow
I. Khuziev
Moscow Institute of Physics and Technology (State University)
Email: vyalyi@gmail.com
俄罗斯联邦, Moscow
补充文件
