Um Detector de Falhas Bizantinas Assíncrono Aplicada à Computação em Nuvem
Abstract
Modern distributed systems based on cloud computing are inherently dynamic, and the design of dependable services that can cope with the dynamics of this environment is a challenge. Byzantine failure detectors provide an elegant approach to implement fault tolerance; however, few works have been appeared. Thus, this paper aims at proposing an unreliable implementation for detecting byzantine faults in a dynamic and asynchronous environment, applying it in the cloud storage and data replication. The algorithm brings the interesting feature to propose weak time constraints of an asynchronous system to the cloud, not using time limits for fault detection.
References
Chandra T. and Toueg, S. (1996) “Unreliable failure detectors for reliable distributed systems”. J Journal of ACM. 43, pp. 225–267.
Fan G., Yu H., Chen L. and Liu D. (2012) “Model Based Byzantine Fault Detection Technique for Cloud Computing” In IEEE Services Computing Conference (APSCC), Guilin, Asia-Pacific, pp. 249-256.
Ganesh, A., Sandhya, M. and Shankar, S. (2014) “A study on fault tolerance methods in Cloud Computing”, In Advance Computing Conference (IACC), IEEE International, pp. 844 - 849
Garraghan P., Tounend P. and Jie X. (2011) “Byzantine fault-tolerance in federated cloud computing”. In Proccessing of 6th International Symposium on Service Oriented System Engineering (SOSE 2011). IEEE Computer Society, pp. 280-285.
Greve, F. (2005) “Protocolos Fundamentais para o desenvolvimento de Aplicações Robustas” SBC-SBRC, Brasil, pp. 330-398.
Greve, F., Lima M., Arantes L. and Sens P. (2012) “A Time-Free Byzantine Failure Detector for Dynamic Networks” In IEEE Dependable Computing Conference (EDCC), Sibiu, Ninth European. pp.191 – 202.
Kihlstrom K. P., Moser L. E. and Melliar-Smith P. M. (2003) “Byzantine Fault Detectors for Solving Consensus,” The Computer Journal, vol. 46, no. 1, pp. 16–35
Lamport L., Shostak R. and Pease M., (1982) “The Byzantine generals problem” ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382–401.
Poledna S. (1996) “Fault Tolerant Real-Time Systems: The problem of replica Determinism”. The Springer International Series in Engineering and Computer Science.
Ramasamy H. and Cachin. C. (2005) “Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast” In Proc. 9th International Conference on Principles of Distributed Systems, Berlin. Germany
Rivest R., Shamir A. and Adleman L, (1978) “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, pp. 120–126.
Rivest R. (1992), “The MD5 Message-DigestAlgorithm”. MIT Laboratory for Computer Science and RSA DataSecurity.
Sivakami, R. and Nawaz G. (2011) “Reliable communication for MANETS in military through identification and removal of byzantine faults” In IEEE 3rd International Conference on Electronics Computer Technology (ICECT). Kanyakumari, Indian, vol. 5, pp. 377-381.
Verissimo, P., Neves, N. F., et. al. (2003) “Intrusion-Tolerant Architectures: Concepts and Design”, Lemos, R., Gacek, C., Romanovsky, A. (eds), Architecting Dependable Systems, v. 2677, LNCS, Springer-Verlag.
Fan G., Yu H., Chen L. and Liu D. (2012) “Model Based Byzantine Fault Detection Technique for Cloud Computing” In IEEE Services Computing Conference (APSCC), Guilin, Asia-Pacific, pp. 249-256.
Ganesh, A., Sandhya, M. and Shankar, S. (2014) “A study on fault tolerance methods in Cloud Computing”, In Advance Computing Conference (IACC), IEEE International, pp. 844 - 849
Garraghan P., Tounend P. and Jie X. (2011) “Byzantine fault-tolerance in federated cloud computing”. In Proccessing of 6th International Symposium on Service Oriented System Engineering (SOSE 2011). IEEE Computer Society, pp. 280-285.
Greve, F. (2005) “Protocolos Fundamentais para o desenvolvimento de Aplicações Robustas” SBC-SBRC, Brasil, pp. 330-398.
Greve, F., Lima M., Arantes L. and Sens P. (2012) “A Time-Free Byzantine Failure Detector for Dynamic Networks” In IEEE Dependable Computing Conference (EDCC), Sibiu, Ninth European. pp.191 – 202.
Kihlstrom K. P., Moser L. E. and Melliar-Smith P. M. (2003) “Byzantine Fault Detectors for Solving Consensus,” The Computer Journal, vol. 46, no. 1, pp. 16–35
Lamport L., Shostak R. and Pease M., (1982) “The Byzantine generals problem” ACM Transactions on Programming Languages and Systems, vol. 4, pp. 382–401.
Poledna S. (1996) “Fault Tolerant Real-Time Systems: The problem of replica Determinism”. The Springer International Series in Engineering and Computer Science.
Ramasamy H. and Cachin. C. (2005) “Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast” In Proc. 9th International Conference on Principles of Distributed Systems, Berlin. Germany
Rivest R., Shamir A. and Adleman L, (1978) “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, pp. 120–126.
Rivest R. (1992), “The MD5 Message-DigestAlgorithm”. MIT Laboratory for Computer Science and RSA DataSecurity.
Sivakami, R. and Nawaz G. (2011) “Reliable communication for MANETS in military through identification and removal of byzantine faults” In IEEE 3rd International Conference on Electronics Computer Technology (ICECT). Kanyakumari, Indian, vol. 5, pp. 377-381.
Verissimo, P., Neves, N. F., et. al. (2003) “Intrusion-Tolerant Architectures: Concepts and Design”, Lemos, R., Gacek, C., Romanovsky, A. (eds), Architecting Dependable Systems, v. 2677, LNCS, Springer-Verlag.
Published
2015-05-18
How to Cite
MATOS, Clésio; GREVE, Fabíola.
Um Detector de Falhas Bizantinas Assíncrono Aplicada à Computação em Nuvem. In: FAULT TOLERANCE WORKSHOP (WTF), 16. , 2015, Vitória/ES.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2015
.
p. 29-42.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2015.22936.
