Identification and classification of agent behaviour at runtime in open, trust-based organic computing systems

Clustering of similar behaving groups during runtime in open distributed systems.Identification of groups regardless of system size.Approach only relies on trust and reputation information. Information and Communication technology (ICT) pervades every aspect of our daily lives to support us solving tasks and providing information. However, we are facing an increasing complexity in ICT due to interconnectedness and coupling of large-scale distributed systems. One particular challenge in this context is openness, i.e. systems and components are free to join and leave at any time, including those that are faulty or even malicious. In this article, we present a novel concept to master openness by detecting groups of similarly behaving systems in order to identify and finally isolate malicious elements. More precisely, we present a mechanism to cluster groups of systems at runtime and to estimate their contribution to the overall system utility. For evaluation and demonstration purposes, we use the Trusted Desktop Grid (TDG), where the system utility is an averaged speedup in job calculation for all benevolent participants. This TDG resembles typical Organic Computing characteristics such as self-organisation, adaptive behaviour of heterogeneous entities, and openness. We show that our concept is able to successfully identify groups of systems with undesired behaviour, ranging from freeriding to colluding attacks.

[1]  H. Casanova,et al.  ACM SIGACT news distributed computing column 8 , 2002, SIGA.

[2]  Christian Müller-Schloer,et al.  Runtime Clustering of Similarly Behaving Agents in Open Organic Computing Systems , 2016, ARCS.

[3]  Jörg Hähner,et al.  Controlling Negative Emergent Behavior by Graph Analysis at Runtime , 2016, ACM Trans. Auton. Adapt. Syst..

[4]  Padhraic Smyth,et al.  Analysis and Visualization of Network Data using JUNG , 2005 .

[5]  Jack J. Dongarra,et al.  Computer benchmarks , 1993 .

[6]  Aidong Zhang,et al.  WaveCluster: a wavelet-based clustering approach for spatial data in very large databases , 2000, The VLDB Journal.

[7]  Michael Wooldridge,et al.  Agent technology: foundations, applications, and markets , 1998 .

[8]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[10]  Christian Müller-Schloer,et al.  Quantitative Emergence -- A Refined Approach Based on Divergence Measures , 2010, 2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[11]  John Scott What is social network analysis , 2010 .

[12]  Jeffrey S. Rosenschein,et al.  Rules of Encounter - Designing Conventions for Automated Negotiation among Computers , 1994 .

[13]  Gilles Fedak,et al.  The Computational and Storage Potential of Volunteer Computing , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[14]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[15]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[16]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

[17]  Christian Müller-Schloer,et al.  Incremental design of adaptive systems , 2014, J. Ambient Intell. Smart Environ..

[18]  Carl Hewitt,et al.  Open Information Systems Semantics for Distributed Artificial Intelligence , 1991, Artif. Intell..

[19]  Mario Lauria,et al.  Application-specific scheduling for the organic grid , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[20]  Christian Müller-Schloer,et al.  Detecting Colluding Attackers in Distributed Grid Systems , 2016, ICAART.

[21]  Andreas Gutscher,et al.  A Trust Model for an Open, Decentralized Reputation System , 2007, IFIPTM.

[22]  Ove Edlund CMregr - A Matlab software package for finding CM-Estimates for Regression , 2004 .

[23]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[24]  Reiner R. Dumke,et al.  Quality Assurance of Agent-Based and Self-Managed Systems , 2009 .

[25]  David L. Olson,et al.  Advanced Data Mining Techniques , 2008 .

[26]  Virgílio A. F. Almeida,et al.  Using cause-effect analysis to understand the performance of distributed programs , 1998, SPDT '98.

[27]  Sarvapali D. Ramchurn,et al.  Trust in multi-agent systems , 2004, The Knowledge Engineering Review.

[28]  Hung Le Vu High Quality P2P Service Provisioning via Decentralized Trust Management , 2010 .

[29]  Rino Falcone,et al.  Trust Theory: A Socio-Cognitive and Computational Model , 2010 .

[30]  Alexander Hinneburg,et al.  DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation , 2007, IDA.

[31]  Marios D. Dikaiakos,et al.  A performance study of cosmological simulations on message-passing and shared-memory multiprocessors , 1996, ICS '96.

[32]  Hartmut Schmeck,et al.  Adaptivity and self-organization in organic computing systems , 2010, TAAS.

[33]  Marios D. Dikaiakos,et al.  Mobile agent platforms for Web databases: a qualitative and quantitative assessment , 1999, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents.

[34]  Jörg Hähner,et al.  A building block for awareness in technical systems: Online novelty detection and reaction with an application in intrusion detection , 2015, 2015 IEEE 7th International Conference on Awareness Science and Technology (iCAST).

[35]  Marvin Karlins,et al.  Persuasion: How Opinions and Attitudes Are Changed. , 1970 .

[36]  Chong-Sun Hwang,et al.  Characterizing and Classifying Desktop Grid , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[37]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[38]  Jordi Sabater-Mir,et al.  Review on Computational Trust and Reputation Models , 2005, Artificial Intelligence Review.

[39]  P. Nidditch,et al.  David Hume, A Treatise of Human Nature , 1978 .

[40]  Jörg Hähner,et al.  Normative Control: Controlling Open Distributed Systems with Autonomous Entities , 2016, Trustworthy Open Self-Organising Systems.

[41]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[42]  R. Jain,et al.  Fairness, call es-tablishment latency and other performance metrics , 1996 .

[43]  Richard Wolski,et al.  Fault-aware scheduling for Bag-of-Tasks applications on Desktop Grids , 2006, 2006 7th IEEE/ACM International Conference on Grid Computing.

[44]  Jörg Hähner,et al.  Observation and Control of Organic Systems , 2011, Organic Computing.

[45]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[46]  Anoop Gupta,et al.  Parallel computer architecture - a hardware / software approach , 1998 .

[47]  L. Mui,et al.  A computational model of trust and reputation , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[48]  Cosimo Anglano,et al.  Peer-to-Peer Desktop Grids in the Real World: The ShareGrid Project , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[49]  V. Buskens The social structure of trust , 1998 .

[50]  Bruno Sousa,et al.  Sabotage-tolerance and trust management in desktop grid computing , 2007, Future Gener. Comput. Syst..

[51]  Jörg Hähner,et al.  A Graph Analysis Approach to Detect Attacks in Multi-agent Systems at Runtime , 2014, 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems.

[52]  Julita Vassileva,et al.  Trust-Based Community Formation in Peer-to-Peer File Sharing Networks , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[53]  Wolfgang Kellerer,et al.  The Complex Facets of Reputation and Trust , 2006 .

[54]  Michael Wooldridge,et al.  Introduction to multiagent systems , 2001 .

[55]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.