On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
A BV, A Patra, A Choudhary, K Srinathan… - Proceedings of the …, 2008 - dl.acm.org
Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008•dl.acm.org
In this paper, we study the inherent tradeoff between the network connectivity, phase
complexity and communication complexity of perfectly reliable message transmission
(PRMT) problem in undirected synchronous network, tolerating a mixed adversary A (tb, tf),
who has unbounded computing power and can corrupt tb and tf nodes in the network in
Byzantine and fail-stop fashion respectively.
complexity and communication complexity of perfectly reliable message transmission
(PRMT) problem in undirected synchronous network, tolerating a mixed adversary A (tb, tf),
who has unbounded computing power and can corrupt tb and tf nodes in the network in
Byzantine and fail-stop fashion respectively.
In this paper, we study the inherent tradeoff between the network connectivity, phase complexity and communication complexity of perfectly reliable message transmission (PRMT) problem in undirected synchronous network, tolerating a mixed adversary A(tb,tf), who has unbounded computing power and can corrupt tb and tf nodes in the network in Byzantine and fail-stop fashion respectively.