Abstract
It has been shown that sets of convergent operators with a shared fixed point can simulate autonomic control mechanisms, but many questions remain about this management technique. We discuss how an autonomous agent can reason about whether its convergent operators share a fixed point with the operators of other agents. Using a concept of time based upon operator repetition, we show that a failure to achieve convergence within specific time limits can be used as a probabilistic indicator of inconsistencies in local policy. We describe a statistical inference technique that determines if an agent’s promise strategy is feasible. The strengths of this technique are that it is both scale-invariant and exterior to the operators whose consistency is being evaluated.
Chapter PDF
Similar content being viewed by others
Keywords
- Autonomic Computing
- Logical Consistency
- Ubiquitous Computing Environment
- Policy Consistency
- Containment Relationship
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Burgess, M., Couch, A.: Autonomic computing approximated by fixed-point promises. In: Proceedings of the First IEEE International Workshop on Modeling Autonomic Communication Environments (MACE), pp. 197–222. Multicon Verlag (2006)
Couch, A., Chiarini, M.: A theory of closure operators. In: AIMS (submitted, 2008)
Burgess, M., Couch, A.L.: Modeling next generation configuration management tools. In: LISA, USENIX, pp. 131–147 (2006)
Anderson, P.: Configuration Management. SAGE Short Topics in System Administration. USENIX (2007)
Couch, A.: Configuration management. In: Bergstra, J., Burgess, M. (eds.) Handbook of Network and System Administration, pp. 75–133. Elsevier, Inc., Amsterdam (2007)
Couch, A.L., Daniels, N.: The maelstrom: Network service debugging via ”ineffective procedures”. In: LISA, USENIX, pp. 63–78 (2001)
Lupu, E., Sloman, M.: Conflicts in policy-based distributed systems management. IEEE Trans. Software Eng. 25(6), 852–869 (1999)
Dunlop, N., Indulska, J., Raymond, K.: Dynamic conflict detection in policy-based management systems. In: EDOC, pp. 15–26. IEEE Computer Society, Los Alamitos (2002)
Couch, A.L., Sun, Y.: On observed reproducibility in network configuration management. Sci. Comput. Program 53(2), 215–253 (2004)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Burgess, M.: A site configuration engine. Computing Systems 8(2), 309–337 (1995)
Burgess, M., Ralston, R.: Distributed resource administration using cfengine. Softw., Pract. Exper. 27(9), 1083–1101 (1997)
Burgess, M.: Theoretical system administration. In: LISA, USENIX, pp. 1–13 (2000)
Burgess, M.: Computer immunology. In: LISA, USENIX, pp. 283–298 (1998)
Burgess, M.: Cfengine as a component of computer immune-systems. In: Proceedings of the Norwegian Conference on Informatics (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Couch, A.L., Chiarini, M. (2008). Dynamic Consistency Analysis for Convergent Operators. In: Hausheer, D., Schönwälder, J. (eds) Resilient Networks and Services. AIMS 2008. Lecture Notes in Computer Science, vol 5127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70587-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70587-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70586-4
Online ISBN: 978-3-540-70587-1
eBook Packages: Computer ScienceComputer Science (R0)