Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/35536
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Barbosa, Raul André Brajczewski | - |
dc.contributor.author | Nogueira, Rodrigo Augusto Abrantes | - |
dc.date.accessioned | 2017-01-13T10:37:03Z | - |
dc.date.available | 2017-01-13T10:37:03Z | - |
dc.date.issued | 2014-07-18 | por |
dc.identifier.uri | https://hdl.handle.net/10316/35536 | - |
dc.description | Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia da Universidade de Coimbra | por |
dc.description.abstract | Cloud computing is increasingly important, with the industry moving towards outsourcing computational resources as a means to reduce investment and management costs, while improving dependability and performance. Nevertheless, the migration to cloud environments is a process that has been raising some concerns to many companies, which see the lack of physical control, the physical resources sharing (between distinct clients) and possible security breaches as the biggest barrier to move their systems to cloud environments. Taking into account these cloud’s problems and the resilience, availability and consistency needed in critical applications, we propose CloudBFT: a standard three-tiered system capable of taking advantage of cloud’s scalability and elasticity, and simultaneously, being as resilient as possible in order to tolerate a wide range of faults, such as faults caused by intrusions, software and hardware faults, etc. The elasticity and scalability are achieved by scaling out and shrinking the cluster according to the processing requirements. On the other hand, to tolerate a wide range of faults (i.e., Byzantine faults), the system must execute a parallel version of a Byzantine fault-tolerant algorithm, where it is used groups of replicas placed on distinct physical machines, as a means to avoid exposing applications to correlated failures. This challenge becomes even more difficult in a relational model (as we used), where the synchronization and contention is higher. We believe that the elasticity we observe in our system, as it scales with the load, demonstrates the feasibility of tolerating Byzantine faults in a cloud-based web server using a relational data model. The results show that the system can scale with the load, as well as tolerating Byzantine faults in a cloud-based web server using a relational data model. Therefore, this work indicates that is possible to have a higher level of resilience in cloud environments and tolerating Byzantine faults without compromising the scalability and elasticity. | por |
dc.language.iso | eng | por |
dc.rights | openAccess | por |
dc.subject | Distributed systems | por |
dc.subject | fault-tolerant algorithms | por |
dc.subject | Byzantine faults | por |
dc.subject | security | por |
dc.subject | dependability | por |
dc.title | CloudBFT: Elastic Byzantine Fault-Tolerant Web Server | por |
dc.type | masterThesis | por |
degois.publication.location | Coimbra | por |
degois.publication.title | CloudBFT: Elastic Byzantine Fault-Tolerant Web Server | por |
dc.identifier.tid | 201538881 | por |
thesis.degree.grantor | Universidade de Coimbra | por |
thesis.degree.name | Mestrado em Engenharia Informática | - |
uc.degree.grantorUnit | 0501 - Faculdade de Ciências e Tecnologia | por |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | masterThesis | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | UC - Dissertações de Mestrado FCTUC Eng.Informática - Teses de Mestrado |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CloudBFT_Elastic Byzantine Fault-Tolerant Web Server.pdf | 1.41 MB | Adobe PDF | View/Open |
Page view(s)
208
checked on Oct 8, 2024
Download(s)
218
checked on Oct 8, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.