Fault-tolerant distributed trigger counting

In this paper, we address the Fault-Tolerant Distributed Trigger Counting (FTDTC) problem under the presence of crash faults, exploring both explicit and implicit settings. In the explicit setting, we aim to count all triggers across the entire network, whereas, in the implicit setting, we consider a subset of nodes ¹ 1 The terms “node” and “processor” are used interchangeably throughout the paper, as appropriate to the context. for trigger counting. We investigated the message complexity of FTDTC problem in the crash fault synchronous and fully-connected distributed network. We present randomized (Monte Carlo) algorithms that achieve sublinear and subquadratic message complexity in the socalled implicit version and explicit version, respectively, when tolerating more than a constant fraction of the faulty nodes. Our fault-tolerant distributed trigger counting algorithms are resilient to any number of faulty nodes, up to ( n − polylog n ) .