2nd International ICST Conference on Autonomic Computing and Communication Systems

Research Article

Grouping Algorithms for Scalable Self-Monitoring Distributed Systems

Download290 downloads
  • @INPROCEEDINGS{10.4108/ICST.AUTONOMICS2008.4476,
        author={Benjamin Satzger and Theo Ungerer},
        title={Grouping Algorithms for Scalable Self-Monitoring Distributed Systems},
        proceedings={2nd International ICST Conference on Autonomic Computing and Communication Systems},
        publisher={ICST},
        proceedings_a={AUTONOMICS},
        year={2010},
        month={5},
        keywords={grouping failure detection scalable distributed system algorithm self-monitoring},
        doi={10.4108/ICST.AUTONOMICS2008.4476}
    }
    
  • Benjamin Satzger
    Theo Ungerer
    Year: 2010
    Grouping Algorithms for Scalable Self-Monitoring Distributed Systems
    AUTONOMICS
    ICST
    DOI: 10.4108/ICST.AUTONOMICS2008.4476
Benjamin Satzger1,*, Theo Ungerer1,*
  • 1: Department of Computer Science, University of Augsburg, 86159 Augsburg, Germany.
*Contact email: satzger@informatik.uni-augsburg.de, ungerer@informatik.uni-augsburg.de

Abstract

The growing complexity of distributed systems demands for new ways of control. Future systems should be able to adapt dynamically to the current conditions of their environment. They should be characterised by so-called self-x properties like self-configuring, self-healing, self-optimising, selfprotecting, and context-aware. For the incorporation of such features typically monitoring components provide the necessary information about the system’s state. In this paper we propose three algorithms which allow a distributed system to install monitoring relations among its components. This serves as a basis to build scalable distributed systems with self-x features and to achieve a self-monitoring capability. Evaluation measurements have been conducted to compare the proposed algorithms.