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., 2015, Volume 51, Issue 1, Pages 54–71 (Mi ppi2162)  

This article is cited in 1 scientific paper (total in 1 paper)

Communication Network Theory

Distributed communication complexity of spanning tree construction

M. N. Vyalyiabc, I. M. Khuzieva

a Moscow Institute of Physics and Technology (State University), Moscow, Russia
b Dorodnitsyn Computing Center of the Russian Academy of Sciences, Moscow, Russia
c National Research University-Higher School of Economics, Moscow, Russia

Abstract: We consider the problem of constructing a spanning tree in a synchronized network with an unknown topology. We give lower and upper bounds on the complexity of protocols for spanning tree constriction in various settings: for deterministic and probabilistic protocols, networks with distinguishable nodes, and anonymous networks. We present suboptimal protocols for which the multiplicative gap from the lower bound can be an arbitrarily slowly growing function of the number of vertices in the network.

Full text: PDF file (252 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2015, 51:1, 49–65

Bibliographic databases:

UDC: 621.391.1+519.1
Received: 24.07.2014
Revised: 27.10.2014

Citation: M. N. Vyalyi, I. M. Khuziev, “Distributed communication complexity of spanning tree construction”, Probl. Peredachi Inf., 51:1 (2015), 54–71; Problems Inform. Transmission, 51:1 (2015), 49–65

Citation in format AMSBIB
\Bibitem{VyaKhu15}
\by M.~N.~Vyalyi, I.~M.~Khuziev
\paper Distributed communication complexity of spanning tree construction
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 1
\pages 54--71
\mathnet{http://mi.mathnet.ru/ppi2162}
\elib{http://elibrary.ru/item.asp?id=27042335}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 1
\pages 49--65
\crossref{https://doi.org/10.1134/S0032946015010068}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000352985900006}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84957953081}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2162
  • http://mi.mathnet.ru/eng/ppi/v51/i1/p54

    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

    This publication is cited in the following articles:
    1. M. N. Vyalyi, I. M. Khuziev, “Fast protocols for leader election and spanning tree construction in a distributed network”, Problems Inform. Transmission, 53:2 (2017), 183–201  mathnet  crossref  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:217
    Full text:29
    References:26
    First page:24

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