Skip to main content

Runtime Clustering of Similarly Behaving Agents in Open Organic Computing Systems

  • Conference paper
Architecture of Computing Systems – ARCS 2016 (ARCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9637))

Included in the following conference series:

Abstract

Organic Computing systems are increasingly open for subsystems (or agents) to join and leave. Thereby, we can observe classes of similarly behaving agents, including those that try to exploit or even damage the system. In this paper, we describe a novel concept to cluster agent groups at runtime and to estimate their contribution to the system. The goal is to distinguish between good, suspicious and malicious agent groups to allow for counter measures. We demonstrate the potential benefit of our approach within simulations of a Desktop Grid Computing system that resembles typical Organic Computing characteristics such as self-organisation, adaptive behaviour of heterogeneous agents, and openness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Anderson, D.P., Fedak, G.: The computational and storage potential of volunteer computing. In: Proceedings of CCGRID 2006, pp. 73–80. IEEE, Singapore (2006)

    Google Scholar 

  • Anglano, C., Brevik, J., Canonico, M., Nurmi, D., Wolski, R.: Fault-aware scheduling for bag-of-tasks applications on desktop grids. In: Proceedings of GRID 2006, pp. 56–63. IEEE, Singapore (2006)

    Google Scholar 

  • Anglano, C., Canonico, M., Guazzone, M., Botta, M., Rabellino, S., Arena, S., Girardi, G.: Peer-to-peer desktop grids in the real world: the ShareGrid project. In: Proceedings of CCGrid 2008, pp. 609–614 (2008)

    Google Scholar 

  • Bennett, J.C., Zhang, H.: WF2Q: worst-case fair weighted fair queueing. In: INFOCOM 1996. Proceedings of Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation, vol. 1, pp. 120–128. IEEE, San Francisco, March 1996

    Google Scholar 

  • Bernard, Y., Klejnowski, L., Hähner, J., Müller-Schloer, C.: Towards trust in desktop grid systems. In: Proceedings of CCGrid 2010, pp. 637–642 (2010)

    Google Scholar 

  • Castelfranchi, C., Falcone, R.: Trust Theory: A Socio-Cognitive and Computational Model, vol. 18. John Wiley & Sons, Chichester (2010)

    Book  MATH  Google Scholar 

  • Chakravarti, A.J., Baumgartner, G., Lauria, M.: Application-specific scheduling for the organic grid. In: Proceedings of GRID 2004 Workshops, pp. 146–155. IEEE, Washington, DC (2004)

    Google Scholar 

  • Choi, S., Buyya, R., Kim, H., Byun, E.: A taxonomy of desktop grids and its mapping to state of the art systems. Technical report, Grid Computing and Distributed System Integration, The University of Melbourne (2008)

    Google Scholar 

  • Choi, S., Kim, H., Byun, E., Baik, M., Kim, S., Park, C., Hwang, C.: Characterizing and classifying desktop grid. In: Proceedings of CCGRID 2007, pp. 743–748. IEEE, Rio de Janeiro (2007)

    Google Scholar 

  • Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: Symposium Proceedings on Communications Architectures and Protocols, pp. 1–12. SIGCOMM 1989. ACM, New York (1989)

    Google Scholar 

  • Domingues, P., Sousa, B., Moura Silva, L.: Sabotage-tolerance and trustmanagement in desktop grid computing. Future Gener. Comput. Syst. 23(7), 904–912 (2007)

    Article  Google Scholar 

  • Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, vol. 96, pp. 226–231. The AAAI Press, Menlo Park (1996)

    Google Scholar 

  • Governatori, G., Rotolo, A.: BIO logical agents: norms, beliefs, intentions in defeasible logic. Auton. Agents Multi-agent Syst. 17(1), 36–69 (2008)

    Article  Google Scholar 

  • Hardin, G.: The tragedy of the commons. Science 162(3859), 1243–1248 (1968)

    Article  Google Scholar 

  • Hewitt, C.: Open information systems semantics for distributed artificial intelligence. Artif. intell. 47(1), 79–106 (1991)

    Article  MathSciNet  Google Scholar 

  • Hinneburg, Alexander, Gabriel, Hans-Henning: DENCLUE 2.0: fast clustering based on kernel density estimation. In: Berthold, Michael, Shawe-Taylor, John, Lavrač, Nada (eds.) IDA 2007. LNCS, vol. 4723, pp. 70–80. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  • Jain, R., Babic, G., Nagendra, B., Lam, C.C.: Fairness, call establishment latency and other performance metrics. ATM-Forum 96(1173), 1–6 (1996)

    Google Scholar 

  • Kantert, J., Edenhofer, S., Tomforde, S., Hähner, J., Müller-Schloer, C.: Defending autonomous agents against attacks in multi-agent systems using norms. In: Proceedings of the 7th International Conference on Agents and Artificial Intelligence, pp. 149–156. INSTICC, SciTePress, Lisbon (2015)

    Google Scholar 

  • Kantert, J., Scharf, H., Edenhofer, S., Tomforde, S., Hähner, J., Müller-Schloer, C.: A graph analysis approach to detect attacks in multi-agent-systems at runtime. In: 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems, pp. 80–89. IEEE, London (2014)

    Google Scholar 

  • Kephart, J.O., Chess, D.M.: The vision of autonomic computing. IEEE Comput. 36(1), 41–50 (2003)

    Article  Google Scholar 

  • Klejnowski, L.: Trusted community: a novel multiagent organisation for OpenDistributed systems. Ph.D. thesis, Leibniz Universität Hannover (2014). http://edok01.tib.uni-hannover.de/edoks/e01dh11/668667427.pdf

  • Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129–137 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  • Muehl, G., Werner, M., Jaeger, M.A., Herrmann, K., Parzyjegla, H.: On the definitions of self-managing and self-organizing systems. In: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference, pp. 1–11, February 2007

    Google Scholar 

  • Müller-Schloer, C.: Organic computing: on the feasibility of controlled emergence. In: CODES and ISSS 2004 Proceedings, pp. 2–5. ACM Press, 8–10 September 2004

    Google Scholar 

  • Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  • Olson, D.L., Delen, D.: Advanced Data Mining Techniques. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  • O’Madadhain, J., Fisher, D., Smyth, P., White, S., Boey, Y.B.: Analysis and visualization of network data using JUNG. J. Stat. Softw. 10(2), 1–35 (2005)

    Google Scholar 

  • Ostrom, E.: Governing the Commons: The Evolution of Institutions for Collective Action. Cambridge University Press, Cambridge (1990)

    Book  Google Scholar 

  • Pitt, J., Schaumeier, J., Artikis, A.: The axiomatisation of socio-economic principles for self-organising systems. In: 2011 Fifth IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 138–147. IEEE, Michigan, October 2011

    Google Scholar 

  • Rosenschein, J.S., Zlotkin, G.: Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. MIT Press, Cambridge (1994)

    Google Scholar 

  • Schmeck, H., Müller-Schloer, C., Çakar, E., Mnif, M., Richter, U.: Adaptivity and self-organization in organic computing systems. ACM Trans. Auton. Adapt. Syst. (TAAS) 5(3), 1–32 (2010)

    Article  Google Scholar 

  • Sheikholeslami, G., Chatterjee, S., Zhang, A.: Wavecluster: a wavelet-based clustering approach for spatial data in very large databases. VLDB J. 8(3–4), 289–304 (2000)

    Article  Google Scholar 

  • Singh, M.P.: An ontology for commitments in multiagent systems. Artif. Intell. Law 7(1), 97–113 (1999)

    Article  Google Scholar 

  • Tomforde, S., Müller-Schloer, C.: Incremental design of adaptive systems. J. Ambient Intell. Smart Environ. 6, 179–198 (2014)

    Google Scholar 

  • Tomforde, S., Hähner, J., Seebach, H., Reif, W., Sick, B., Wacker, A., Scholtes, I.: Engineering and mastering interwoven systems. In: ARCS 2014–27th International Conference on Architecture of Computing Systems, Workshop Proceedings. Institute of Computer Engineering, University of Luebeck, Luebeck, pp. 1–8, 25–28 February 2014

    Google Scholar 

  • Wang, Y., Vassileva, J.: Trust-based community formation in peer-to-peer file sharing networks. In: Proceedings on Web Intelligence, pp. 341–348. IEEE, Beijing, September 2004

    Google Scholar 

  • Wasserman, S.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)

    Book  Google Scholar 

  • Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645–678 (2005)

    Article  Google Scholar 

  • Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM SIGMOD Record, vol. 25, pp. 103–114. ACM, Montreal (1996)

    Google Scholar 

Download references

Acknowledgements

This research is funded by the research unit “OC-Trust” (FOR 1085) of the German Research Foundation (DFG).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Kantert .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kantert, J., Scharrer, R., Tomforde, S., Edenhofer, S., Müller-Schloer, C. (2016). Runtime Clustering of Similarly Behaving Agents in Open Organic Computing Systems. In: Hannig, F., Cardoso, J.M.P., Pionteck, T., Fey, D., Schröder-Preikschat, W., Teich, J. (eds) Architecture of Computing Systems – ARCS 2016. ARCS 2016. Lecture Notes in Computer Science(), vol 9637. Springer, Cham. https://doi.org/10.1007/978-3-319-30695-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30695-7_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30694-0

  • Online ISBN: 978-3-319-30695-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics