Possibility and complexity of probabilistic reliable communication in directed networks

DOI10.1145/1146381.1146421zbMath1314.68033OpenAlexW2083650689MaRDI QIDQ5177288

C. Pandu Rangan, Kannan Srinathan

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146421

zbMATH Keywords

directed networksreliable communication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission ⋮ Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ Probabilistic reliability and privacy of communication using multicast in general neighbor networks ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary ⋮ Secure Message Transmission in Asynchronous Directed Graphs

This page was built for publication: Possibility and complexity of probabilistic reliable communication in directed networks