Brahms: byzantine resilient random membership sampling

Computer Networks: The International Journal of Computer and Telecommunications Networking, pp. 2340-2359, 2009.

Cited by: 113|Bibtex|Views25|Links
EI
Keywords:
Random samplingGossipMembershipByzantine faults

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments