Stephen, Julian James ; Eugster, Patrick
Hrsg.: Eyers, David ; Schwan, Karsten (2013)
Assured Cloud-Based Data Analysis with ClusterBFT.
In: Middleware 2013. ACM/IFIP/USENIX 14th International Middleware Conference. Proceedings
doi: 10.1007/978-3-642-45065-5_5
Buchkapitel, Bibliographie
Kurzbeschreibung (Abstract)
The shift to cloud technologies is a paradigm change that offers considerable financial and administrative gains. However governmental and business institutions wanting to tap into these gains are concerned with security issues. The cloud presents new vulnerabilities and is dominated by new kinds of applications, which calls for new security solutions. Intuitively, Byzantine fault tolerant (BFT) replication has many benefits to enforce integrity and availability in clouds. Existing BFT systems, however, are not suited for typical “data-flow processing” cloud applications which analyze large amounts of data in a parallelizable manner: indeed, existing BFT solutions focus on replicating single monolithic servers, whilst data-flow applications consist in several different stages, each of which may give rise to multiple components at runtime to exploit cheap hardware parallelism; similarly, BFT replication hinges on comparison of redundant outputs generated, which in the case of data-flow processing can represent huge amounts of data. In fact, current limits of data processing directly depend on the amount of data that can be processed per time unit. In this paper we present ClusterBFT, a system that secures computations being run in the cloud by leveraging BFT replication coupled with fault isolation. In short, ClusterBFT leverages a combination of variable-degree clustering, approximated and offline output comparison, smart deployment, and separation of duty, to achieve a parameterized tradeoff between fault tolerance and overhead in practice. We demonstrate the low overhead achieved with ClusterBFT when securing data-flow computations expressed in Apache Pig, and Hadoop. Our solution allows assured computation with less than 10 percent latency overhead as shown by our evaluation.
| Typ des Eintrags: | Buchkapitel |
|---|---|
| Erschienen: | 2013 |
| Herausgeber: | Eyers, David ; Schwan, Karsten |
| Autor(en): | Stephen, Julian James ; Eugster, Patrick |
| Art des Eintrags: | Bibliographie |
| Titel: | Assured Cloud-Based Data Analysis with ClusterBFT |
| Sprache: | Englisch |
| Publikationsjahr: | Dezember 2013 |
| Ort: | Berlin, Heidelberg |
| Verlag: | Springer |
| (Heft-)Nummer: | 8275 |
| Buchtitel: | Middleware 2013. ACM/IFIP/USENIX 14th International Middleware Conference. Proceedings |
| Reihe: | Lecture Notes in Computer Science |
| Band einer Reihe: | 8275 |
| Veranstaltungstitel: | 14th International Middleware Conference |
| Veranstaltungsort: | Beijing, China |
| Veranstaltungsdatum: | December 9-13, 2013 |
| DOI: | 10.1007/978-3-642-45065-5_5 |
| Kurzbeschreibung (Abstract): | The shift to cloud technologies is a paradigm change that offers considerable financial and administrative gains. However governmental and business institutions wanting to tap into these gains are concerned with security issues. The cloud presents new vulnerabilities and is dominated by new kinds of applications, which calls for new security solutions. Intuitively, Byzantine fault tolerant (BFT) replication has many benefits to enforce integrity and availability in clouds. Existing BFT systems, however, are not suited for typical “data-flow processing” cloud applications which analyze large amounts of data in a parallelizable manner: indeed, existing BFT solutions focus on replicating single monolithic servers, whilst data-flow applications consist in several different stages, each of which may give rise to multiple components at runtime to exploit cheap hardware parallelism; similarly, BFT replication hinges on comparison of redundant outputs generated, which in the case of data-flow processing can represent huge amounts of data. In fact, current limits of data processing directly depend on the amount of data that can be processed per time unit. In this paper we present ClusterBFT, a system that secures computations being run in the cloud by leveraging BFT replication coupled with fault isolation. In short, ClusterBFT leverages a combination of variable-degree clustering, approximated and offline output comparison, smart deployment, and separation of duty, to achieve a parameterized tradeoff between fault tolerance and overhead in practice. We demonstrate the low overhead achieved with ClusterBFT when securing data-flow computations expressed in Apache Pig, and Hadoop. Our solution allows assured computation with less than 10 percent latency overhead as shown by our evaluation. |
| Freie Schlagworte: | Cloud Byzantine fault replication integrity data analysis |
| ID-Nummer: | TUD-CS-2013-0484 |
| Fachbereich(e)/-gebiet(e): | Profilbereiche Profilbereiche > Cybersicherheit (CYSEC) |
| Hinterlegungsdatum: | 28 Aug 2017 13:25 |
| Letzte Änderung: | 17 Apr 2019 11:54 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum