RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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


Probl. Peredachi Inf., 2017, Volume 53, Issue 2, Pages 91–111 (Mi ppi2237)  

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

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.


Full text: PDF file (264 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2017, 53:2, 183–201

Bibliographic databases:

UDC: 621.391.1+519.1
Received: 03.05.2016
Revised: 27.01.2017

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{http://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{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000405581700006}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85023773335}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2237
  • http://mi.mathnet.ru/eng/ppi/v53/i2/p91

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:1695
    References:18
    First page:26

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020