Skip navigation


  • DSpace logo
  • Home
  • Collections
  • Researcher Profile
  • Explore by
    • Researcher Profile
  • VGU library
  • Help
  • User Guide
  • Sign on to:
    • My DSpace
    • Receive email
      updates
    • Edit Account details

VGU RESEARCH REPOSITORY


Please use this identifier to cite or link to this item: https://epub.vgu.edu.vn/handle/dlibvgu/56
Title: Lower bound for function computation in distributed networks
Authors: H.K. Dai 
Michel Toulouse 
Keywords: Distributed function computation;Linear iterative schemes;Information dissemination;Finite convergence;Vertex-eccentricity
Issue Date: 2018
Publisher: Springer Link
Series/Report no.: Lecture Notes in Computer Science;Vol. 11251
Abstract: 
Distributed computing network systems are modeled as graphs with which vertices represent compute elements and adjacency-edges capture their uni- or bi-directional communication. Distributed computation over a network system proceeds in a sequence of time-steps in which vertices update and/or exchange their values based on the underlying algorithm constrained by the time-(in)variant network topology. For finite convergence of distributed information dissemination and function computation in the model, we present a lower bound on the number of time-steps for vertices to receive (initial) vertex-values of all vertices regardless of underlying protocol or algorithmics in time-invariant networks via the notion of vertex-eccentricity.
Index & Ranking: Scopus Q2
URI(1): http://epub.vgu.edu.vn/handle/dlibvgu/56
DOI: 10.1007/978-3-030-03192-3_28
Appears in Collections:ARTICLE/BOOK PUBLICATION

Show full item record

Page view(s)

56
checked on Aug 23, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items are protected by © Copyright of Vietnamese - German University Library

© Copyright 2020 by Vietnamese - German University Library.
Add: Ring road 4, Quarter 4, Thoi Hoa Ward, Ben Cat City, Binh Duong Province
Tel.:(0274) 222 0990. Ext.: 70206