Distributed resource administration using Cfengine
Software—Practice & Experience
Conflicts in Policy-Based Distributed Systems Management
IEEE Transactions on Software Engineering
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Dynamic Conflict Detection in Policy-Based Management Systems
EDOC '02 Proceedings of the 6th International Enterprise Distributed Object Computing Conference
LISA '98 Proceedings of the 12th Conference on Systems Administration
Theoretical System Administration
LISA '00 Proceedings of the 14th USENIX conference on System administration
The Maelstrom: Network Service Debugging via "Ineffective Procedures"
LISA '01 Proceedings of the 15th USENIX conference on System administration
Modeling next generation configuration management tools
LISA '06 Proceedings of the 20th conference on Large Installation System Administration
AIMS '08 Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services
AIMS '08 Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services
Dynamics of Resource Closure Operators
AIMS '09 Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security: Scalability of Networks and Services
| Hi-index | 0.00 |
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.