Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A probabilistic characterization of a fault-tolerant gossiping algorithm

From MaRDI portal
Publication:1044771
Jump to:navigation, search

DOI10.1007/S11424-009-9149-7zbMath1178.93019OpenAlexW2033459027MaRDI QIDQ1044771

Shouhuai Xu, Xiaohu Li, Paul A. Parker

Publication date: 15 December 2009

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-009-9149-7


zbMATH Keywords

fault-tolerancereliable multicastgossipprobabilistic broadcast


Mathematics Subject Classification ID

Epidemiology (92D30) Communication networks in operations research (90B18) Stochastic systems in control theory (general) (93E03)


Related Items (1)

Competing between two groups of individuals following frailty models




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Spatial gossip and resource location protocols
  • Correctness of a gossip based membership protocol
  • Feasibility and complexity of broadcasting with random transmission failures
  • Fault-tolerant broadcasting and gossiping in communication networks




This page was built for publication: A probabilistic characterization of a fault-tolerant gossiping algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1044771&oldid=13052400"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki