Automatic Membership Service For Large-Scale Dependable Storage Systems
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2013, Vol 2, Issue 8
Abstract
Byzantine-fault-tolerant replication increases the reliability and availability of Internet services that store significant state and protect it in spite of attacks or software errors. Existing Byzantine-fault-tolerant storage systems either imagine a static set of replicas, or have restrictions in how they handle reconfigurations and it represented in terms of the consistency and levels they provide the scalability of the solutions. This can be difficult in large-scale, long-lived systems where system connection is likely to change during the system existence. Here present a service that follows system membership and from time to time reports other system nodes of membership vary. The membership service runs typically repeatedly, to avoid human configuration errors and is itself Byzantine fault- tolerant and reconfigurable and provides appliances with a sequence of consistent views of the system membership. The practical result demonstrates that the membership service works well and the membership service is able to manage large system and the cost to maintain the service is low. The solution for dynamically changing system membership in a largescale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. To avoid human configuration errors; is itself Byzantine faulttolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. dBQS is exciting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from preceding DHTs by providing Byzantine fault tolerance and offering strong semantics.
Authors and Affiliations
P. Rajitha, D Anil, M. Kanchana
Keywords
Related Articles
- EP ID EP27621
- DOI -
- Views 339
- Downloads 4
Iris Data Hiding, Encoding By Using Huffman Coding DWT, SVD Scheme Authenticated By Multi SVM
As the technology advances in day to day life, the process of illegal data copies are producing by miscreants with ease. Various techniques are introducing to protect the copy right data from the miscreants. One such...
COMPARISON AND STATISTICAL ANALYSIS OF NAM AND NORMAL SPEECH PROCESSING USING WAVELET TRANSFORM
In this, we present statistical approaches to enhance body-conducted unvoiced speech for silent speech communication using wavelet transform. So far Analysis of NAM speech has been made only using HMM (Hidden Markov...
Security in Web Application
Internet services and applications have become a part of daily life, enabling communications from anywhere. To accommodate this increase in applications and data complexity, web services has moved to multi-tiered desi...
Monte-Carlo simulation of a 10T Full adder for propagation delay optimizations
Monte Carlo analysis generates random variations in parameter values by drawing them probabilistically from a defined distribution. Monte Carlo simulations were performed for full adders to find out the reliability a...
Fake Currency Detection Using Image Processing and Other Standard Methods
Counterfeit money is imitation currency produced without the legal sanction of the state or government. Producing or using this fake money is a form of fraud or forgery. Counterfeiting is as old as money itself, and...