Making Asynchronous Distributed Computations Robust to Channel Noise

DOI10.4230/LIPICS.ITCS.2018.50MaRDI QIDQ4993319zbMATH OpenOpenAlexFDO

Authors Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler

Publication date 15 June 2021

Full work available at URL http://drops.dagstuhl.de/opus/volltexte/2018/8318/pdf/LIPIcs-ITCS-2018-50.pdf

zbMATH Keywords

coding for interactive communicationcoding theorydistributed computationnoise-resilient computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Making asynchronous distributed computations robust to noise
• Reliable communication across parallel asynchronous channels with glitches
• Distributed function calculation over noisy networks
• Reliable Communications Across Parallel Asynchronous Channels With Arbitrary Skews
• Communication efficient statistical asynchronous multiparty computation with optimal resilience
• Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
• Revisiting asynchronous fault tolerant computation with optimal resilience
• The adversarial noise threshold for distributed protocols
• An efficient algorithm for estimating noise covariances in distributed systems
• Communication complexity of secure distributed computation in the presence of noise

Cites work

• A coding theorem for distributed computation
• Agreement under faulty interfaces
• Breathe before speaking
• Coding for interactive communication
• Coding for interactive communication correcting insertions and deletions
• Coding for interactive communication: a survey
• Complexity of network synchronization
• Constant-rate coding for multiparty interactive communication is impossible
• Distributed Computing: A Locality-Sensitive Approach
• Efficient Coding for Interactive Communication
• Efficient perfectly secure message transmission in synchronous networks
• Fast interactive coding against adversarial noise
• Graph spanners
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1256711 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Interactive channel capacity
• Interactive coding for multiparty protocols
• Introduction to Distributed Algorithms
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
• Optimal Coding for Streaming Authentication and Interactive Communication
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
• Reliable communication in networks with Byzantine link failures
• Reliable communication over highly connected noisy networks
• Sublinear fully distributed partition with applications
• Synchronizing hypercube networks in the presence of faults
• The adversarial noise threshold for distributed protocols
• Toward coding for maximum errors in interactive communication
• Towards optimal deterministic coding for interactive communication

Cited in

(4)

• Making asynchronous distributed computations robust to noise
• A Note on Parallel Asynchronous Channels With Arbitrary Skews
• The adversarial noise threshold for distributed protocols
• Distributed CONGEST Algorithms against Mobile Adversaries

This page was built for publication: Making Asynchronous Distributed Computations Robust to Channel Noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993319)