Byzantine Fault Tolerance In The Distributed Environment Using Markov Chain Technique
ABSTRACT: The abstract of this paper is to tolerate the byzantine fault by providing the predefined constraints of the Nodes in the distributed environment. The nodes in the distributed environment automatically generated their constraints using Markov chain. The distributed environment predefined constraints and the member nodes predefined constraints can be updated periodically. According to this update, if the member nodes predefined constraints may not matches with the distributed system predefined constraints then using Breadth First Search technique the membership service discards the service of the node in the distributed environment . The new node having constraints wants to communicate with the distributed environment. These constraints can be compared with the distributed system constraints using probability of random matching technique.
 L.Lamport,R.Shostak and M.Pease. The Byzantine Generals Problem.ACM Transactions on Programming Languages and Systems,4(3),1982.
 R.Kalaivani. Byzantine Fault Tolerance using distributed Quorum Systems. Proceedings of National Conference on Recent Trends in Advanced Computing in Manonmaniam SundaranarUniversity,Tamilnadu,India,2013.
 3.Eduardo A.P.Alchieri,Alysson Neves Bessani,Fernado Carlos Pereira and Jonida Silva Fraga. Proactive Byzantine Quorum Systems. Brazil University of Lisban.
 M. Castro and B. Liskov, “Practical Byzantine Fault Tolerance,”Proc. Third Symp. Operating Systems Design and Implementation(OSDI ’99), Feb. 1999.
 George Couloris,Jean Dollimore and Tim Kinderberg. Distributed Systems, Fourth Edition, pg.no.51,461-466.
 Barbara Liskov and Moses Liskov. Automatic Reconfiguration for Large Scale Reliable Storage Systems. IEEE Transactions on dependable and secure computing, VOL. 9, NO. 2, MARCH/APRIL 2012.
 Sheldon M.Ross. Introduction to Probability Models, Fourth Edition, pg.no.135-140.
 Feller. An Introduction to Probability Theory and its Applications, Third Edition,VOL.1, pg.no.107-109.
 Dr.A.Singaravelu and Dr.S.Sivasubramanian. Probability and Queueing Theory, pg.no.3.36-3.39.
 P.Revathy,S.Poonkuzhali. Data Structures, Pg.No.7.10-7.13.
 G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A.Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W.Vogels, “Dynamo: Amazon’s Highly Available Key-Value Store,”Proc. 21st ACM Symp. Operating Systems Principles, pp. 205-220,2007.
 J. Dean,, “Designs, Lessons and Advice from Building LargeDistributed Systems,”Proc.Third ACM SIGOPS Int’l WorkshopLarge Scale Distributed Systems and Middleware (LADIS ’09), Keynotetalk, 2009.
 Amazon S3 Availability Event, http://status.aws.amazon.com/s3-20080720.html, July 2008.
 K. Birman and T. Joseph, “Exploiting Virtual Synchrony inDistributed Systems,” Proc. 11th ACM Symp. Operating SystemsPrinciples, pp. 123-138, Nov. 1987.
 I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H.Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Servicefor Internet 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. Cowling, D.R.K. Ports, B. Liskov, R.A. Popa, and A. Gaikwad,“Census: Location-Aware Membership Management for Large-Scale Distributed Systems,” Proc. Ann. Technical Conf. (USENIX’09), June 2009.
 D. Oppenheimer, A. Ganapathi, and D.A. Patterson, “Why DoInternet Services Fail, and What Can Be Done About It?” Proc.Fourth USENIX Symp. Internet Technologies and Systems (USITS ’03),Mar. 2003.