Possibility and complexity of probabilistic reliable communication in directed networks

Date Issued
01-01-2006
Author(s)
Srinathan, Kannan
Indian Institute of Technology, Madras
DOI
Abstract
We provide a complete characterization of directed networks in which probabilistic reliable communication is possible. We also outline a round optimal protocol for the same. Copyright 2006 ACM.
Volume
2006
Subjects