Grouping algorithms for scalable self-monitoring distributed systems
نویسندگان
چکیده
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.
منابع مشابه
Self healing distributed systems
The growing complexity of distributed systems demands for new ways of control. This work addresses self-healing in distributed environments. The term self-healing represents a quite new area of research and is used in a fairly broad way, but can be seen as dynamic fault tolerance. This work proposes generic concepts and algorithms to build self-healing systems. The detection of node failures in...
متن کاملAutonomous and scalable failure detection in distributed systems
The growing complexity of distributed systems makes it more and more difficult to manage them. Therefore, it is necessary that such systems will be able to adapt autonomously to their environment. They should be characterised by so-called self-x properties such as self-configuration or self-healing. The autonomous detection of failures in distributed environments is a crucial part for developin...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملEvaluation of Replica Placement and Retrieval Algorithms in Self-Organizing CDNs
Content distribution networks (CDN) have been increasingly used as the scalable solution to deliver high-quality multimedia content. However, despite the promising concept, current self-organizing content distribution networks (using realtime replica placement) lack placement and retrieval algorithms that are both intelligent and scalable. In this paper we present an architecture and relating a...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کامل