Enviar artigo por via de e-mail Fast protocols for leader election and spanning tree construction in a distributed network
- Autores: Vyalyi M.N.1,2,3, Khuziev I.M.3
-
Afiliações:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- National Research University—Higher School of Economics
- Moscow Institute of Physics and Technology (State University)
- Edição: Volume 53, Nº 2 (2017)
- Páginas: 183-201
- Seção: Communication Network Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166388
- DOI: https://doi.org/10.1134/S0032946017020065
- ID: 166388
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
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)
Autor responsável pela correspondência
Email: vyalyi@gmail.com
Rússia, Moscow; Moscow; Moscow
I. Khuziev
Moscow Institute of Physics and Technology (State University)
Email: vyalyi@gmail.com
Rússia, Moscow
Arquivos suplementares
