On the performance of a retransmission-based synchronizer

DOI10.1016/j.tcs.2012.04.035zbMath1358.68042OpenAlexW2177999128WikidataQ38810083 ScholiaQ38810083MaRDI QIDQ392190

Thomas Nowak, Alexander Kößler, Matthias Függer

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.035

zbMATH Keywords

simulationMarkov theoryprobabilistic environmentround-based algorithmssynchronizer

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14)

Related Items (1)

Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss

Cites Work

• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Upper and lower bounds for stochastic marked graphs
• Analytic expansions of max-plus Lyapunov exponents.
• The Heard-Of model: computing in distributed systems with benign faults
• Asymptotic behavior of random discrete event systems
• Max-Plus Linear Stochastic Systems and Perturbation Analysis
• Automatically increasing the fault-tolerance of distributed algorithms
• Asynchronous consensus and broadcast protocols
• Complexity of network synchronization
• The Byzantine Generals Problem
• Evaluating the running time of a communication round over the internet

This page was built for publication: On the performance of a retransmission-based synchronizer