HOME INDEXING CALL FOR PAPERS JOURNAL POLICY MANUSCRIPT CURRENT ARCHIVES ONLINE SUBMISSION EDITORIAL TEAM
   
TITLE : PERFORMANCE STUDY OF BYZANTINE AGREEMENT PROBLEM IN DISTRIBUTED ENVIRONMENTS  
AUTHORS : Murugan S.      Ramachandran V.            
ABSTRACT :

A reliable computer system must be able to continue to exist when there is a failure in one or more of its components. A malfunctioning service component exhibits an abnormal behavior by sending extraneous information to other nodes. This kind of issue is termed as Byzantine Generals Problem. Byzantine fault tolerant algorithm is important in the current world of distributed computing environment of World Wide Web where malicious attacks and software errors are exponentially increasing and can cause faulty nodes exhibits arbitrary behavior. This paper is to test the execution behavior of Byzantine Agreement Algorithm proposed by Lamport et.al, [3] as a standalone application, Web application, Web service, Model View Controller Framework, Microsoft .NET Framework, and in the cloud platform. In all the above it is observed that the implementation in the cloud environment yields less execution time when compared with others. The execution time is faster of about 22% in the Web environment.
Keywords: Byzantine, Cloud, Struts, Web sen/ices, XML

 
 
  Download Full Paper
 
Copyrights ©Sathyabama Institute of Science and Technology (Deemed to be University).
Powered By: Infospace Technologies