Stretching bft, 2011. ,
Fault-scalable Byzantine fault-tolerant services, ACM SIGOPS Operating Systems Review, vol.39, issue.5, pp.59-74, 2005. ,
DOI : 10.1145/1095809.1095817
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.5687
Recover to Self: Re-Abstract Family (regular paper), The International Conference on Computer and Management, CAMAN. IEEE, 2012. ,
Towards Byzantine Resilient Directories (to appear), The 11th IEEE International Symposium on Network Computing and Applications, NCA'12, 2012. ,
DOI : 10.1109/nca.2012.14
A principle for resilient sharing of distributed resources, Proceedings of the 2nd international conference on Software engineering, ICSE '76, pp.562-570, 1976. ,
Prime: Byzantine Replication under Attack, IEEE Transactions on Dependable and Secure Computing, vol.8, issue.4, pp.564-577, 2011. ,
DOI : 10.1109/TDSC.2010.70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.4629
A view of cloud computing, Ion Stoica, and Matei Zaharia. A view of cloud computing, pp.50-58, 2010. ,
DOI : 10.1145/1721654.1721672
A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.144-152, 1992. ,
DOI : 10.1145/130385.130401
Asynchronous consensus and broadcast protocols, Journal of the ACM, vol.32, issue.4, pp.824-840, 1985. ,
DOI : 10.1145/4221.214134
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.8693
-fold cross-validation and the repeated learning-testing methods, Biometrika, vol.76, issue.3, pp.503-514, 1989. ,
DOI : 10.1093/biomet/76.3.503
URL : https://hal.archives-ouvertes.fr/hal-01352895
Practical byzantine fault tolerance, pp.173-186, 2001. ,
Practical byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems, vol.20, issue.4, pp.398-461, 2002. ,
DOI : 10.1145/571637.571640
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.6725
LIBSVM, ACM Transactions on Intelligent Systems and Technology, vol.2, issue.3, pp.27-28, 2011. ,
DOI : 10.1145/1961189.1961199
Attested append-only memory: making adversaries stick to their word, Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, SOSP '07, pp.189-204, 2007. ,
Upright cluster services, Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, SOSP '09, pp.277-290, 2009. ,
DOI : 10.1145/1629575.1629602
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.8267
Making byzantine fault tolerant systems tolerate byzantine faults, NSDI'09: Proceedings of the 6th USENIX symposium on Networked systems design and implementation, pp.153-168, 2009. ,
How to tolerate half less one Byzantine nodes in practical distributed systems, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004., pp.174-183, 2004. ,
DOI : 10.1109/RELDIS.2004.1353018
Support-vector networks, Machine Learning, pp.273-297, 1995. ,
DOI : 10.1007/BF00994018
Hq replication: a hybrid quorum protocol for byzantine fault tolerance, OSDI '06: Proceedings of the 7th symposium on Operating systems design and implementation, pp.177-190, 2006. ,
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
DOI : 10.1145/42282.42283
Weighted voting for replicated data, Proceedings of the seventh ACM symposium on Operating systems principles, SOSP '79, pp.150-162, 1979. ,
Fundamentals of Queueing Theory, 2008. ,
DOI : 10.1002/9781118625651
The next 700 bft protocols, EuroSys '10: Proceedings of the 5th European conference on Computer systems, pp.363-376, 2010. ,
DOI : 10.1007/978-3-540-92221-6_1
URL : https://hal.archives-ouvertes.fr/hal-00945717
The next 700 bft protocol, 2008. ,
Obfuscating bft, 2011. ,
On the predictability of large transfer TCP throughput, ACM SIGCOMM Computer Communication Review, vol.35, issue.4, pp.145-156, 2005. ,
DOI : 10.1145/1090191.1080110
A Practical Guide to Support Vector Classification, 2000. ,
Zyzzyva, ACM SIGOPS Operating Systems Review, vol.41, issue.6, pp.45-58, 2007. ,
DOI : 10.1145/1323293.1294267
Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978. ,
DOI : 10.1145/359545.359563
The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998. ,
DOI : 10.1145/279227.279229
The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982. ,
DOI : 10.1145/357172.357176
The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998. ,
DOI : 10.1145/279227.279229
Replication in the harp file system, Proceedings of the thirteenth ACM symposium on Operating systems principles, SOSP '91, pp.226-238, 1991. ,
Distributed algorithms, 1996. ,
Semantic Web services, IEEE Intelligent Systems, vol.16, issue.2, pp.46-53, 2001. ,
DOI : 10.1109/5254.920599
Composing Web services on the Semantic Web, The VLDB Journal The International Journal on Very Large Data Bases, vol.12, issue.4, pp.333-351, 2003. ,
DOI : 10.1007/s00778-003-0101-5
Viewstamped replication: A new primary copy method to support highly-available distributed systems, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, PODC '88, pp.8-17, 1988. ,
Quantitative Evaluation of BFT Protocols, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, pp.255-264, 2011. ,
DOI : 10.1109/QEST.2011.40
Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol.22, issue.4, pp.299-319, 1990. ,
DOI : 10.1145/98163.98167
Bft protocols under fire, NSDI'08: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation, pp.189-204, 2008. ,
A tutorial on support vector regression, Statistics and Computing, vol.14, issue.3, pp.199-222, 2004. ,
DOI : 10.1023/B:STCO.0000035301.49549.88
Spin one's wheels? byzantine fault tolerance with a spinning primary, Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems, SRDS '09, 2009. ,
Ebawa: Efficient byzantine agreement for wide-area networks, 2010. ,
Lightweight directory access protocol (v3), 1997. ,
DOI : 10.17487/rfc2251
A QoS-Aware Selection Model for Semantic Web Services, Proceedings of the 4th international conference on Service-Oriented Computing, 2006. ,
DOI : 10.1007/11948148_32
Computing in the clouds, netWorker, vol.11, issue.4, pp.16-25, 2007. ,
DOI : 10.1145/1327512.1327513
An integrated experimental environment for distributed systems and networks, ACM SIGOPS Operating Systems Review, vol.36, issue.SI, pp.255-270, 2002. ,
DOI : 10.1145/844128.844152
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.3768
Separating agreement from execution for byzantine fault tolerant services, ACM SIGOPS Operating Systems Review, vol.37, issue.5, pp.253-267, 2003. ,
DOI : 10.1145/1165389.945470
A method for automated web service selection, Proceedings of the 2008 IEEE Congress on Services -Part I, SERVICES '08, 2008. ,
Lightweight directory access protocol (ldap) transactions. RFC Editor, 2010. ,
DOI : 10.17487/rfc5805
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.7820