Abstract
Desktop Grid systems reached a preeminent place among the most powerful computing platforms in the planet. Unfortunately, they are extremely vulnerable to mischief, because computing projects exert no administrative or technical control on volunteers. These can very easily output bad results, due to software or hardware glitches (resulting from over-clocking for instance), to get unfair computational credit, or simply to ruin the project. To mitigate this problem, Desktop Grid servers replicate work units and apply majority voting, typically on 2 or 3 results. In this paper, we observe that simple majority voting is powerless against malicious volunteers that collude to attack the project. We argue that to identify this type of attack and to spot colluding nodes, each work unit needs at least 3 voters. In addition, we propose to post-process the voting pools in two steps. i) In the first step, we use a statistical approach to identify nodes that were not colluding, but submitted bad results; ii) then, we use a rather simple principle to go after malicious nodes which acted together: they might have won conflicting voting pools against nodes that were not identified in step i. We use simulation to show that our heuristic can be quite effective against colluding nodes, in scenarios where honest nodes form a majority.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, D.P.: BOINC: a system for public-resource computing and storage. In: 5th Intl Workshop on Grid Computing (GRID 2004), 2004, USA, Proceedings, pp. 4–10. IEEE Computer Society, Piscataway (2004)
Anderson, D.P., McLeod, J.: Local scheduling for volunteer computing. In: 21th Intl. Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 2007, USA, pp. 1–8. IEEE Computer Society, Piscataway (2007)
Cappello, F., Djilali, S., Fedak, G., Hérault, T., Magniette, F., Néri, V., Lodygensky, O.: Computing on large-scale distributed systems: XtremWeb architecture, programming models, security, tests and convergence with grid. Future Gener. Comput. Syst. 21(3), 417–437 (2005)
Costa, F., Silva, L., Fedak, G., Kelley, I.: Optimizing data distribution in desktop grid platforms. Parallel Process. Lett. 18(3), 391–410 (2008)
Domingues, P., Sousa, B., Silva, L.M.: Sabotage-tolerance and trust management in desktop grid computing. Future Gener. Comput. Syst. 23(7), 904–912 (2007)
Douceur, J.R.: The sybil attack. In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers. Lecture Notes in Computer Science, vol. 2429, pp. 251–260. Springer, New York (2002)
Fedak, G., He, H., Cappello, F.: Bitdew: a programmable environment for large-scale data management and distribution. In: SC ’08: Proceedings of the 2008 ACM/IEEE Conference on Supercomputing, pp. 1–12. IEEE, Piscataway (2008)
Guha, S., Rastogi, R., Shim, K.: Rock: A robust clustering algorithm for categorical attributes. In: Data Engineering, International Conference on (1999)
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: WWW ’03: Proc. of the 12th Intl. Conf. on WWW, pp. 640–651. ACM, New York (2003)
Karlin, S., Taylor, H.M.: A First Course in Stochastic Processes, 2nd edn. Academic, London (1975)
Kim, J.S., Nam, B., Marsh, M.A., Keleher, P.J., Bhattacharjee, B., Richardson, D., Wellnitz, D., Sussman, A.: Creating a robust desktop grid using peer-to-peer services. In: 21th Intl. Parallel and Distributed Processing Symp. (IPDPS 2007), Proceedings, 2007, USA. IEEE, Piscataway (2007)
Kondo, D., Araujo, F., Malecot, P., Domingues, P., Silva, L.M., Fedak, G., Cappello, F.: Characterizing result errors in internet desktop grids. In: Euro-Par 2007, Parallel Processing, 13th Intl Euro-Par Conf, France, 2007, Proceedings. LNCS, vol. 4641, pp. 361–371. Springer, New York (2007)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Cam, L.M.L., Neyman, J. (eds.) Proc. of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press, Berkeley (1967)
Malkhi, D., Reiter, M.K.: Byzantine quorum systems. Distrib. Comput. 11(4), 203–213 (1998)
Sarmenta, L.F.G.: Sabotage-tolerance mechanisms for volunteer computing systems. Future Gener. Comput. Syst. 18(4), 561–572 (2002)
Silaghi, G.C., Domingues, P., Araujo, F., Silva, L., Arenas, A.: Defeating colluding nodes in desktop grid computing platforms. In: Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on, pp. 1–8 (2008)
Wei, B., Fedak, G., Cappello, F.: Collaborative data distribution with bittorrent for computational desktop grids. In: 4th Intl Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005, France, pp. 250–257. IEEE Computer Society, Piscataway (2005)
Witten, I.E., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Wong, S.: An authentication protocol in web-computing. In: 20th Intl. Parallel and Distributed Processing Symp. (IPDPS 2006), Proceedings, 2006, Greece. IEEE, Piscataway (2006)
Yurkewych, M., Levine, B.N., Rosenberg, A.L.: On the cost-ineffectiveness of redundancy in commercial p2p computing. In: 12th ACM Conference on Computer and Communications Security (CCS ’05), Proceedings, pp. 280–288. ACM, New York (2005)
Zhao, S., Lo, V.M., GauthierDickey, C.: Result verification and trust-based scheduling in peer-to-peer grids. In: 5th IEEE Intl Conf. on Peer-to-Peer Computing (P2P 2005), 2005, Germany, pp. 31–38. IEEE Computer Society, Piscataway (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Silaghi, G.C., Araujo, F., Silva, L.M. et al. Defeating Colluding Nodes in Desktop Grid Computing Platforms. J Grid Computing 7, 555 (2009). https://doi.org/10.1007/s10723-009-9124-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10723-009-9124-5