Bibtex de la publication

@InProceedings{ ShBa2012.2,
author = {Shoker, Ali and Bahsoun, Jean-Paul},
title = "{Towards Byzantine Resilient Directories (regular paper)}",
booktitle = "{IEEE International Symposium on Network Computing and Applications (IEEE NCA 2012), Cambridge, MA, USA, 23/08/12-25/08/12}",
year = {2012},
month = {août},
publisher = {IEEE Computer Society},
address = {},
pages = {52--60},
language = {anglais},
keywords = {Distributed systems; Byzantine fault tolerance; Directories; OpenLDAP},
abstract = {Notable Byzantine Fault Tolerant protocols have been designed so far. These protocols are often evaluated on simple benchmarks, and few times on NFS systems. On the contrary, studies that addressed the behavior of BFT on large back-ends, like Directories, are few. We believe that studying such systems is crucial for practice community due to their popularity. In this paper, we integrate BFT with OpenLDAP Directory. We introduce the design of the integrated system, that we call BFT-LDAP. Then, we study its behavior accompanied with some useful observations. In addition, we discuss the cost overhead of this integration. Our approach ensures that OpenLDAP legacy code remains completely intact, and that the integration with BFT is straightforward using APIs. Moreover, we convey that the additional performance cost of BFT-LDAP is negligible as compared to that of standalone OpenLDAP. We conducted our experiments on Emulab. The experiments indicate that the performance discrepancy of BFT-LDAP is negligible whenever different state-of-the-art BFT protocols are used. Other experiments demonstrate that a little sacrifice in throughput (less than 10%) is needed in order to leverage the resiliency of OpenLDAP against Byzantine faults (i.e., through applying BFT).}