Brahms: byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking, pp. 2340-2359, 2009.
Random samplingGossipMembershipByzantine faults
We present Brahms, an algorithm for sampling random nodes in a large dynamic system prone to malicious behavior. Brahms stores small membership views at each node, and yet overcomes Byzantine attacks by a linear portion of the system. Brahms is composed of two components. The first one is a resilient gossip-based membership protocol. The ...More
Full Text (Upload PDF)
PPT (Upload PPT)