A Replication- and Checkpoint-Based Approach for Anomaly-Based Intrusion Detection and Recovery, 25th IEEE International Conference on Distributed Computing Systems Workshops, pp.137-143, 2005. ,
DOI : 10.1109/ICDCSW.2005.21
SETI@home: an experiment in public-resource computing, Communications of the ACM, vol.45, issue.11, pp.4556-61, 2002. ,
DOI : 10.1145/581571.581573
Probabilistic Byzantine Tolerance for Cloud Computing, 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS), 2015. ,
DOI : 10.1109/SRDS.2015.22
URL : https://hal.archives-ouvertes.fr/hal-01166767
Lower bounds for distributed coinflipping and randomized consensus, J. of the ACM, vol.45, pp.559-568, 1997. ,
Tight bounds for asynchronous randomized consensus, J. ACM, vol.5520, issue.5, pp.1-2026, 2008. ,
Lower Bounds for Randomized Consensus under a Weak Adversary, SIAM Journal on Computing, vol.39, issue.8, pp.3885-3904, 2010. ,
DOI : 10.1137/090751906
The Next 700 BFT Protocols, ACM Transactions on Computer Systems, vol.32, issue.4, pp.1-1245, 2015. ,
DOI : 10.1145/2658994
An adaptive approach to achieving hardware and software fault tolerance in a distributed computing environment, Journal of Systems Architecture, vol.47, issue.9, pp.763-781, 2002. ,
DOI : 10.1016/S1383-7621(01)00029-7
Smart Redundancy for Distributed Computation, 2011 31st International Conference on Distributed Computing Systems, pp.665-676, 2011. ,
DOI : 10.1109/ICDCS.2011.25
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
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
SpeQuloS: a QoS service for hybrid and elastic computing infrastructures, Cluster Computing, vol.21, issue.2, pp.79-100, 2014. ,
DOI : 10.1007/s10586-013-0283-6
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
DOI : 10.1145/42282.42283
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems, IEEE Transactions on Dependable and Secure Computing, vol.2, issue.1, pp.46-56, 2005. ,
DOI : 10.1109/TDSC.2005.13
Efficient middleware for byzantine fault tolerant database replication, Proceedings of the sixth conference on Computer systems, EuroSys '11, pp.107-122, 2011. ,
DOI : 10.1145/1966445.1966456
A survey of attack and defense techniques for reputation systems, ACM Computing Surveys, vol.42, issue.1, pp.1-131, 2009. ,
DOI : 10.1145/1592451.1592452
Failure-Aware Resource Scheduling Policy for Hybrid Cloud, 2014 Tenth International Conference on Computational Intelligence and Security, pp.152-156, 2015. ,
DOI : 10.1109/CIS.2014.158
Failure-aware resource provisioning for hybrid Cloud infrastructure, Journal of Parallel and Distributed Computing, vol.72, issue.10, pp.1318-1331, 2012. ,
DOI : 10.1016/j.jpdc.2012.06.012
URL : http://dro.deakin.edu.au/eserv/DU:30047830/abawajy-failureaware-2012.pdf
Fast asynchronous Byzantine agreement and leader election with full information, ACM Transactions on Algorithms, vol.6, issue.4, pp.1-6828, 2010. ,
DOI : 10.1145/1824777.1824788
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.8741
The power of two choices in randomized load balancing, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.10, pp.1094-1104, 2001. ,
DOI : 10.1109/71.963420
Multi-criteria and satisfaction oriented scheduling for hybrid distributed computing infrastructures, Future Generation Computer Systems, vol.55, pp.428-443, 2016. ,
DOI : 10.1016/j.future.2015.03.022
URL : https://hal.archives-ouvertes.fr/hal-01239218
) messages, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.2-9, 2014. ,
DOI : 10.1145/2611462.2611468
Randomized byzantine generals, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.403-409, 1983. ,
DOI : 10.1109/SFCS.1983.48
Reputation systems, Communications of the ACM, vol.43, issue.12, pp.45-48, 2000. ,
DOI : 10.1145/355112.355122
Multi-state grid resource availability characterization, 2007 8th IEEE/ACM International Conference on Grid Computing, pp.42-49, 2007. ,
DOI : 10.1109/GRID.2007.4354114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1698
Sabotage-Tolerance Mechanisms for Volunteer Computing Systems, Future Generation Computing Systems, vol.14, issue.4, pp.561-572, 2002. ,
Reputation-based scheduling on unreliable distributed infrastructures, 26th IEEE ICDCS, 2006. ,
DOI : 10.1109/icdcs.2006.70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.924
Randomized Byzantine Agreements, Proceedings of the third annual ACM symposium on Principles of distributed computing , PODC '84, pp.163-178, 1984. ,
DOI : 10.1145/800222.806744
Efficient Byzantine Fault-Tolerance, IEEE Transactions on Computers, vol.62, issue.1, pp.16-30, 2013. ,
DOI : 10.1109/TC.2011.221
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.9972
Separating Agreement from Execution for Byzantine Fault Tolerant Services, Proc. of the ACM SOSP, pp.253-267, 2003. ,