ACM Home Page
Please provide us with feedback. Feedback
Grouping algorithms for scalable self-monitoring distributed systems
Full text PdfPdf (163 KB)
Source International Conference on Autonomic Computing and Communication Systems archive
Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems table of contents
Turin, Italy
Article No. 35  
Year of Publication: 2008
ISBN:978-963-9799-34-9
Authors
Benjamin Satzger  University of Augsburg, Augsburg, Germany
Theo Ungerer  University of Augsburg, Augsburg, Germany
Sponsors
: ICST
ACM: Association for Computing Machinery
: Create-Net
Publisher
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 42,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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, self-protecting, 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Asavathiratham, S. Roy, B. Lesieutre, and G. Verghese. The influence model. Control Systems Magazine, IEEE, 21(6):52--64, Dec 2001.
 
2
B. S. Baker and R. Shostak. Gossips and telephones. Discrete Math., 2(3):191--193, June 1972.
 
3
M. Bertier, O. Marin, and P. Sens. Performance analysis of a hierarchical failure detector. In Proceedings 2003 International Conference on Dependable Systems and Networks (DSN 2003), pages 635--644, San Francisco, CA, USA, June 2003. IEEE Computer Society.
4
 
5
6
 
7
 
8
W. Feller. An Introduction to Probability Theory and its Application, Vol. 1. John Wiley and Sons, New York, 1970.
 
9
10
 
11
 
12
P. Horn. Autonomic computing: Ibm's perspective on the state of information technology. http://www.research.ibm.com/autonomic/, 2001.
13
 
14
 
15
U. Richter, M. Mnif, J. Branke, C. Müller-Schloer, and H. Schmeck. Towards a generic observer/controller architecture for organic computing. In C. Hochberger and R. Liskowsky, editors, INFORMATIK 2006 -- Informatik für Menschen, volume P-93 of GI-Edition -- Lecture Notes in Informatics, pages 112--119, Bonn, Germany, Sept. 2006. Köllen Verlag.
 
16
S. Roy, Y. Wan, and A. Saberi. Algorithmic Aspects of Wireless Sensor Networks, volume 4240/2006 of LNCS, chapter A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems, pages 152--163. Springer Berlin / Heidelberg, 2006.
17
 
18
B. Satzger, A. Pietzowski, W. Trumler, and T. Ungerer. Variations and evaluations of an adaptive accrual failure detector to enable self-healing properties in distributed systems. In ARCS 2007, 20th International Conference, Zurich, Switzerland, March 12--15, 2007, volume 4415 of LNCS, pages 171--184. Springer, 2007.
 
19
 
20
H. Schmeck. Organic computing. Künstliche Intelligenz, 05(3):68--69, July 2005.

Collaborative Colleagues:
Benjamin Satzger: colleagues
Theo Ungerer: colleagues