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/97
DC FieldValueLanguage
dc.contributor.authorH.K. Daien_US
dc.contributor.authorMichel Toulouseen_US
dc.date.accessioned2020-03-12T16:55:02Z-
dc.date.available2020-03-12T16:55:02Z-
dc.date.issued2019-
dc.identifier.urihttp://epub.vgu.edu.vn/handle/dlibvgu/97-
dc.description.abstractDistributed computing network-systems are modeled as graphs with vertices representing compute elements and adjacencyedges capturing their uni- or bi-directional communication. Distributed function computation has a wide spectrum of major applications in distributed systems. 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 fnite 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 in a graph-theoretic framework. We also address lower bounds on vertex-eccentricity and its maximum version in terms of common graphparameters such as maximum degree, and order and size. p.1-10en_US
dc.language.isoenen_US
dc.publisherSpringer Linken_US
dc.relation.ispartofSN Computer Scienceen_US
dc.relation.ispartofseriesSN Computer Science;-
dc.subjectDistributed function computationen_US
dc.subjectLinear iterative schemesen_US
dc.subjectInformation disseminationen_US
dc.subjectFinite convergenceen_US
dc.subjectVertex-eccentricityen_US
dc.titleLower-Bound study for function computation in distributed networks via vertex-eccentricityen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s42979-019-0002-3-
dc.relation.journaltypeInternational Journalen_US
item.grantfulltextopen-
item.fulltextWith Fulltext-
item.languageiso639-1other-
Appears in Collections:ARTICLE/BOOK PUBLICATION
Files in This Item:
File SizeFormat
Lower-Bound study for function computation in distributed networks via vertex-eccentricity.pdf3.18 MBAdobe PDFView/Open
Show simple item record

Page view(s)

77
checked on Nov 13, 2025

Download(s)

74
checked on Nov 13, 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