Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2017, Volume 53, Issue 2, Pages 91–111 (Mi ppi2237)  
This article is cited in 1 scientific paper (total in 1 paper)

Communication Network Theory

Fast protocols for leader election and spanning tree construction in a distributed network

M. N. Vyalyiabc, I. M. Khuzievb

a Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, Russia
b Moscow Institute of Physics and Technology (State University), Moscow, Russia
c National Research University — Higher School of Economics, Moscow, Russia
Full-text PDF (264 kB) Citations (1)
References:
PDF
HTML
Abstract: 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.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation
Russian Foundation for Basic Research 14-01-00641
The research was made under the 5-100 Russian Academic Excellence Project.
Supported in part by the Russian Foundation for Basic Research, project no. 14-01-00641.
Received: 03.05.2016
Revised: 27.01.2017
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 2, Pages 183–201
DOI: https://doi.org/10.1134/S0032946017020065
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.1
Language: Russian
Citation: M. N. Vyalyi, I. M. Khuziev, “Fast protocols for leader election and spanning tree construction in a distributed network”, Probl. Peredachi Inf., 53:2 (2017), 91–111; Problems Inform. Transmission, 53:2 (2017), 183–201
Citation in format AMSBIB
\Bibitem{VyaKhu17}
\by M.~N.~Vyalyi, I.~M.~Khuziev
\paper Fast protocols for leader election and spanning tree construction in a~distributed network
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 2
\pages 91--111
\mathnet{http://mi.mathnet.ru/ppi2237}
\elib{https://elibrary.ru/item.asp?id=29202070}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 2
\pages 183--201
\crossref{https://doi.org/10.1134/S0032946017020065}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000405581700006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85023773335}
Linking options:
  • https://www.mathnet.ru/eng/ppi2237
  • https://www.mathnet.ru/eng/ppi/v53/i2/p91
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025