We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
We describe a reliable broadcast protocol for mobile multihop packet radio networks. The reliable broadcast service ensures that all the hosts in a group deliver the same set of m...
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
Based on existing reliable broadcast protocols in MANETs, we propose a novel reliable broadcast protocol that uses clustering technique and gossip methodology. We combine local ret...
Abstract. Many to many reliable broadcast is useful while building distributed services like group membership and agreement in a MANET. Efforts in implementing reliable broadcast ...
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
— We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nod...
Mansoor Mohsin, David Cavin, Yoav Sasson, Ravi Pra...
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...