Grouping Algorithms for Scalable Self-Monitoring Distributed Systems

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.

Autonomous and scalable failure detection in distributed systems

“…This paper presents the basic functionality of the algorithms. For a formal listing, it is referred to (Satzger and Ungerer, 2008) where you can find the pseudocode of all three algorithms.…”