Dynamic membership In byzantine fault tolerant system

Miss.Rupali Mahadev Awate, Prof.Rashmi Deshpande


We present an application that provides a solution for tolerating byzantine faults in distributed system. Reliability of data at very large scale is one of the highest challenges we have to face in distributed systems. Also for availability the data is stored on multiple machines at different locations. To increase the storing capacity we need to scale the system and replace the failed node with new nodes. The existing byzantine fault tolerance systems have a limitation on scalability as well as consistency. In this paper we provide a solution for dynamic system membership change. The system provides membership service, and a change in membership is updated at every site. To avoid the human configuration errors, the membership service is automatic. We stored all the semantics using a hash table dbs to maintain the atomicity. dbs extends the existing byzantine quorum protocol to manage the replication .the theoretical analysis shows that the system is dynamically reconfigurable and byzantine faults tolerant system.


Byzantine fault tolerance, dynamic system membership, membership service, replication


Rodrigo Rodrigues, Barbara liskov, member, ieee, Kathryn chen, Moses liskov, and David Schultz. March/april2012 ,“Automatic reconfiguration for large-scale reliable storage systems.” ieee transactions on dependable and secure computing, vol. 9, no. 2

j. Cowling, d.r.k. ports, b. Liskov, r.a. popa, and a. Gaikwad, june 2009 “census: location-aware membership management for large-scale distributed systems,” proc. Ann. Technical conf. (usenix’09),

C. Y. Lin, M. Wu, J. A. Bloom, I. J. Cox, and M. Miller, “Rotation, scale, and translation resilient public watermarking for images,” IEEE Trans. Image Process., vol. 10, no. 5, pp. 767-782, May 2001.

g. Decandia, d. Hastorun, m. Jampani, g. Kakulapati, a.lakshman, a. Pilchin, s. Siva Subramanian, p. Vosshall, and w.vogels, ,2007 “dynamo: amazon’s highly available key-value store,”proc. 21st acm symp. Operating systems principles, pp. 205-220.

m. Castro and b. Liskov, february 1999 “practical byzantine fault tolerance,” proc. Third symp. Operating systems design and implementation(osdi ’99), Feb. 1999.

b. Liskov and r. Rodrigues, 2006 ,“tolerating byzantine faulty clients in a quorum system,” proc. 26th ieee int’l conf. Distribute computing systems (icdcs ’06).

I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H.Balakrishnan, “Chord: A Scalable Applications,” Proc. ACM SIGCOMM, 2001.

M. Reiter, “A Secure Group Membership Protocol,” IEEE Trans.Software Eng., vol. 22, no. 1, pp. 31-42, Jan. 1996.

H.D. Johansen, A. Allavena, and R. van Renesse, “Fireflies:Scalable Support for Intrusion-Tolerant Network Overlays,” Proc.European Conf. Computer Systems (EuroSys ’06) , pp. 3-13, 2006.

J. Douceur, “The Sybil Attack,” Proc. First Int’l Workshop Peer-to-Peer Systems (IPTPS ’02), 2002.

J. Li and D. Mazieres, Beyond one-third faulty replicas in byzantine fault tolerant systems," in Proc. NSDI, 2007.

A study of Byzantine fault-tolerant algorithms Vasileios Papadopoulos University of Ioannina { Computer Science department}

Full Text: PDF


  • There are currently no refbacks.


All Rights Reserved © 2012 IJARCSEE

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.