To improve scalability with Boolean matrix using efficient gossip failure detection and consensus algorithm for PeerSim simulator in IoT environment

S Kumar, JK Samriya, AS Yadav, M Kumar - International Journal of …, 2022 - Springer
Recent years have seen a rise in interest in peer-to-peer applications because of their
scalability, fault tolerance, and other noteworthy benefits. The main benefit of P2P …

An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values

K Vargas, S Rajsbaum - 2019 49th Annual IEEE/IFIP …, 2019 - ieeexplore.ieee.org
We present an implementation of an eventually perfect failure detector in an arbitrarily
connected, partitionable network. We assume ADD channels: for each one there exist …

The lattice agreement problem in distributed systems

X Zheng - 2021 - repositories.lib.utexas.edu
The lattice agreement problem is an important decision problem in distributed systems. It
has applications in implementing atomic snapshot objects and building a special class of …

Brief announcement: leader election in the add communication model

S Rajsbaum, M Raynal, K Vargas - … on Stabilizing, Safety, and Security of …, 2020 - Springer
A channel from a process p to a process q satisfies the ADD property if there are two
constants K and D, unknown to the processes, such that in any sequence of K consecutive …

An Eventually Perfect Failure Detector on ADD Channels Using Clustering

L Rumreich, PAG Sivilotti - International Conference on Networked …, 2022 - Springer
We present an implementation of an eventually perfect failure detector,◊ P, in a partitionable
network with arbitrary topology. This network is built on weak assumptions using ADD …

Leader election in arbitrarily connected networks with process crashes and weak channel reliability

C López, S Rajsbaum, M Raynal, K Vargas - International Conference on …, 2021 - Springer
A channel from a process p to a process q satisfies the ADD property if there are constants K
and D, unknown to the processes, such that in any sequence of K consecutive messages …

Hierarchical Trust and Fault Tolerant Group Key Agreement for MANETs.

M Sadi, M Amad, N Badache - Adhoc & Sensor Wireless …, 2020 - search.ebscohost.com
Scalability and robustness are two basic factors that determine the efficiency of any group
key management protocol. Designing such protocols for Mobile Ad-Hoc Networks (MANETs) …

[PDF][PDF] Implementing failure detection algorithms on the ADD-model with small messages

KRV GODOY - 2021 - ru.dgb.unam.mx
A distributed system is a set of computers or processes, that cooperates and coordinates for
solving a common problem [46]. Typically, they exchange information and coordinate their …

[PDF][PDF] Simulación y Análisis de un Algoritmo de Elección de Líder Tolerante a Fallas en un Sistema Distribuido Empleando Canales ADD

CL Rodríguez - 2020 - ru.dgb.unam.mx
En la actualidad los sistemas de cómputo se encuentran en muchas de las actividades que
realizamos cotidianamente y cada vez en más campos con aplicaciones increíblemente …

[PDF][PDF] Brief Announcement: Leader Election for Arbitrarily Connected Networks in the Presence of Process Crashes and Weak Channel Reliability

S Rajsbaum, M Raynal, K Vargas - sirocco2020.cs.uni-paderborn.de
In the leader election problem each process pi has a local variable leaderi, and it is required
that all the local variables leaderi forever contain the same identity, which is the identity of …