Detecting Colluding Attackers in Distributed Grid Systems

Jan Kantert, Melanie Kauder, Sarah Edenhofer, Sven Tomforde, Christian Müller-Schloer

2016

Abstract

Distributed grid systems offer possible benefits in terms of fast computation of tasks. This is accompanied by potential drawbacks due to their openness, the heterogeneity of participants, and the unpredictability of agent behaviour, since agents have to be considered as black-boxes. The utilisation of technical trust within adaptive collaboration strategies has been shown to counter negative effects caused by these characteristics. A major challenge in this context is the presence of colluding attackers that try to exploit or damage the system in a coordinated fashion. Therefore, this paper presents a novel approach to detect and isolate such colluding attackers. The concept is based on observations of interaction patterns and derives a classification of agent communities. Within the evaluation, we demonstrate the benefit of the approach and highlight the highly reliable classification.

References

  1. Anderson, D. P. and Fedak, G. (2006). The Computational and Storage Potential of Volunteer Computing. In Proc. of CCGRID 2006, pages 73-80, Singapore. IEEE.
  2. Anglano, C., Brevik, J., Canonico, M., Nurmi, D., and Wolski, R. (2006). Fault-aware Scheduling for Bag-ofTasks Applications on Desktop Grids. In Proc. of GRID 2006, pages 56-63, Singapore. IEEE.
  3. Anglano, C., Canonico, M., Guazzone, M., Botta, M., Rabellino, S., Arena, S., and Girardi, G. (2008). Peer-toPeer Desktop Grids in the Real World: The ShareGrid Project. Proc. of CCGrid 2008, 0:609-614.
  4. Artikis, A. and Pitt, J. (2009). Specifying Open Agent Systems: A Survey. In Artikis, A., Picard, G., and Vercouter, L., editors, Engineering Societies in the Agents World IX, volume 5485 of LNCS, pages 29- 45. Springer, Saint-Etienne, FR.
  5. Bennett, J. C. and Zhang, H. (1996). WF2Q: Worst-case Fair Weighted Fair Queueing. In INFOCOM 7896. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE, volume 1, pages 120-128, San Francisco, CA, USA. IEEE.
  6. Boella, G., Pigozzi, G., and van der Torre, L. (2009). Normative Systems in Computer Science - Ten Guidelines for Normative Multiagent Systems. In Boella, G., Noriega, P., Pigozzi, G., and Verhagen, H., editors, Normative Multi-Agent Systems, number 09121 in Dagstuhl Seminar Proceedings, pages 1-21, Dagstuhl, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
  7. Chakravarti, A. J., Baumgartner, G., and Lauria, M. (2004). Application-Specific Scheduling for the Organic Grid. In Proc. of GRID 2004 Workshops, pages 146-155, Washington, DC, USA. IEEE.
  8. Demers, A., Keshav, S., and Shenker, S. (1989). Analysis and Simulation of a Fair Queueing Algorithm. In Symposium Proceedings on Communications Architectures & Protocols, SIGCOMM 7889, pages 1-12, New York, NY, USA. ACM.
  9. Frey, B. and Dueck, D. (2007). Clustering by passing messages between data points. Science, 315:972-976.
  10. Governatori, G. and Rotolo, A. (2008). BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic. Autonomous Agents and Multi-Agent Systems, 17(1):36-69.
  11. Hewitt, C. (1991). Open Information Systems Semantics for Distributed Artificial Intelligence. Artificial intelligence, 47(1):79-106.
  12. Jain, R., Babic, G., Nagendra, B., and Lam, C.-C. (1996). Fairness, Call Establishment Latency and Other Performance Metrics. ATM-Forum, 96(1173):1-6.
  13. Jardine, N. and Sibson, R. (1971). Mathematical taxonomy. John Wiley & Sons, Chichester, UK.
  14. Kantert, J., Bernard, Y., Klejnowski, L., and MüllerSchloer, C. (2013). Interactive Graph View of Explicit Trusted Communities in an Open Trusted Desktop Grid System. In Proc. of SASO Workshops, pages 13-14.
  15. Kantert, J., Bödelt, S., Edenhofer, S., Tomforde, S., Hähner, J., and Müller-Schloer, C. (2014). Interactive Simulation of an Open Trusted Desktop Grid System with Visualisation in 3D. In Self-Adaptive and SelfOrganizing Systems (SASO), 2014 IEEE Eighth International Conference on, pages 191-192, London, UK. IEEE.
  16. Khamsi, M. A. and Kirk, W. A. (2011). An introduction to metric spaces and fixed point theory , volume 53. John Wiley & Sons, Chichester, UK.
  17. Klejnowski, L. (2014). Trusted Community: A Novel Multiagent Organisation for Open Distributed Systems. PhD thesis, Leibniz Universität Hannover.
  18. Ostrom, E. (1990). Governing the Commons: The Evolution of Institutions for Collective Action. Cambridge university press, Cambridge, US.
  19. Pitt, J., Schaumeier, J., and Artikis, A. (2011). The Axiomatisation of Socio-Economic Principles for SelfOrganising Systems. In Self-Adaptive and SelfOrganizing Systems (SASO), 2011 Fifth IEEE International Conference on, pages 138-147, Michigan, US. IEEE.
  20. Rosenschein, J. S. and Zlotkin, G. (1994). Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, Cambridge.
  21. Savarimuthu, B. T. R. and Cranefield, S. (2011). Norm Creation, Spreading and Emergence: A Survey of Simulation Models of Norms in Multi-Agent Systems. Multiagent and Grid Systems, 7(1):21-54.
  22. Schaeffer, S. E. (2007). Graph clustering. Computer Science Review, 1(1):27-64.
  23. Singh, M. P. (1999). An Ontology for Commitments in Multiagent Systems. Artificial Intelligence and Law , 7(1):97-113.
  24. Tomforde, S., Hähner, J., Seebach, H., Reif, W., Sick, B., Wacker, A., and Scholtes, I. (2014). Engineering and Mastering Interwoven Systems. In ARCS 2014 - 27th International Conference on Architecture of Computing Systems, Workshop Proceedings, February 25-28, 2014, Luebeck, Germany, University of Luebeck, Institute of Computer Engineering, pages 1-8.
  25. Tomforde, S., Prothmann, H., Branke, J., Hähner, J., Mnif, M., Müller-Schloer, C., Richter, U., and Schmeck, H. (2011). Observation and Control of Organic Systems. In Organic Computing - A Paradigm Shift for Complex Systems, pages 325 - 338. Birkh äuser Verlag.
  26. Van Dongen, S. M. (2001). Graph clustering by flow simulation. PhD thesis, Utrecht University.
  27. von Dogen, S. M. (2000). An introduction to mcl. Accessed: March 30, 2015.
  28. Wang, Y. and Vassileva, J. (2004). Trust-Based Community Formation in Peer-to-Peer File Sharing Networks. In Proc. on Web Intelligence, pages 341-348, Beijing, China. IEEE.
Download


Paper Citation


in Harvard Style

Kantert J., Kauder M., Edenhofer S., Tomforde S. and Müller-Schloer C. (2016). Detecting Colluding Attackers in Distributed Grid Systems . In Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-172-4, pages 198-206. DOI: 10.5220/0005708301980206


in Bibtex Style

@conference{icaart16,
author={Jan Kantert and Melanie Kauder and Sarah Edenhofer and Sven Tomforde and Christian Müller-Schloer},
title={Detecting Colluding Attackers in Distributed Grid Systems},
booktitle={Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2016},
pages={198-206},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005708301980206},
isbn={978-989-758-172-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Detecting Colluding Attackers in Distributed Grid Systems
SN - 978-989-758-172-4
AU - Kantert J.
AU - Kauder M.
AU - Edenhofer S.
AU - Tomforde S.
AU - Müller-Schloer C.
PY - 2016
SP - 198
EP - 206
DO - 10.5220/0005708301980206