Article ID Journal Published Year Pages File Type
485192 Procedia Computer Science 2016 5 Pages PDF
Abstract

With the evolution of new technologies, the growing reliance on networks has increased immensely. Such an advancement induces malicious attacks and software errors to occur frequently. Building robust network services that can tolerate a wide range of failure types is a fundamental problem in distributed systems. The most fundamental approach, called Byzantine fault tolerance, helps mask arbitrary failures exhibited by failing nodes. Here, the problem of reliably broadcasting messages in a mutli hop network is dealt, where some nodes are likely to fail. Most of the existing solutions require high network connectivity and these requirements become difficult to satisfy when the network grows large. In this paper, a study on various Byzantine fault tolerant methods has been carried out which has been developed and implemented by research experts in this field. These solutions are particularly customized to adapt to sparsely connected networks.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , ,