Performance Evaluation of Check-By-Voting for Colluding Attack in Volunteer Computing Systems
Volunteer computing (VC) is a type of Internet based parallel computing paradigm, which allows any participants in the Internet to contribute their idle computing resources towards solving large problems. In VC, sabotage-tolerance mechanism is mandatory to improve the reliability of computations because some malicious participants may sabotage their jobs by returning incorrect results. Then, this paper evaluates current sabotage-tolerance methods such as voting and presents an impact of colluding attack on the sabotage-tolerance performance. The colluding attack is one of the most important issues to realize reliable modern VC systems because it may ruin the fundamental assumption of voting, i.e., “the majority is correct”. This becomes a big threat to the voting-based sabotage-tolerant methods which eliminate malicious participants based on whether their results are the majority or not. In this paper, we propose a colluding attack model, and conduct a detailed study for two major voting-based methods (i.e., M-first voting and check-by-voting) through a Monte Carlo simulation to reveal the sabotage-tolerance performance against colluding attacks. Our model introduces a colluding probability to cover various sabotaging and colluding scenarios. The simulation study shows that check-by-voting works well even if colluding attacks happen, while M-first voting does not.
KeywordsCheck-by-voting Colluding attacks Desktop grids Majority voting Sabotage-tolerance Volunteer computing
This work was supported by KAKENHI 23800041.
- 1.SETI@home: a scientific experiment that uses Internet-connected computers in the Search for Extraterrestrial Intelligence (SETI). http://setiathome.ssl.berkeley.edu/
- 2.Rosetta@home: a scientific project that determines the 3-dimensional shapes of proteins. http://boinc.bakerlab.org/rosetta/
- 3.Cosmology@home: a project to search for the model that best describes our Universe and to find the range of models. http://www.cosmologyathome.org/
- 4.Knispel B et al (2010) Pulsar discovery by global volunteer computing. Science 329(5994):927–930Google Scholar
- 5.LHC@home: a project in theoretical physics computations for the Large Hadron Collider at CERN. http://lhcathome2.cern.ch/test4theory/
- 6.SAT@home: a research project that uses Internet-connected computers to solve hard and practically important problems. http://sat.isa.ru/pdsat/
- 7.BOINC: open-source software for volunteer computing. http://boinc.berkeley.edu/
- 8.Watanabe K, Fukushi M (2010) Generalized spot-checking for reliable volunteer computing. IEICE Trans Inf Syst E93-D(12):3164–3172Google Scholar
- 9.Watanabe K, Fukushi M, Kameyama M (2011) Adaptive group-based job scheduling for high performance and reliable volunteer computing. J Inf Process 19:39–51Google Scholar
- 10.Watanabe K, Funabiki N, Nakanishi T, Fukushi M (2012) Modeling and performance evaluation of colluding attack in volunteer computing systems. In: Proceedings of the international multiconference of engineers and computer scientists 2012, IMECS 2012, 14–16 March, 2012. Lecture notes in engineering and computer science, Hong Kong, pp 1658–1663Google Scholar
- 13.Kondo D, Araujo F, Malecot P, Domingues P, Silva LM, Fedak G, Cappello F (2007) Characterizing error rates in internet desktop grids. In: 13th European conference on parallel and distributed computing, pp 361–371Google Scholar