Possibility and complexity of probabilistic reliable communication in directed networks

  • Authors:
  • Kannan Srinathan;C. Pandu Rangan

  • Affiliations:
  • International Institute of Information Technology, Hyderabad, India;Indian Institute of Technology, Madras, India

  • Venue:
  • Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.