When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
On balancing the load in a clustered web farm
ACM Transactions on Internet Technology (TOIT)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Policy-Based Networks: Hype and Hope
IT Professional
The Vision of Autonomic Computing
Computer
Issues in Managing Soft QoS Requirements in Distributed Systems Using a Policy-Based Framework
POLICY '01 Proceedings of the International Workshop on Policies for Distributed Systems and Networks
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Practical Solutions for QoS-Based Resource Allocation
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Policy Based QoS Management System for the IntServ/DiffServ Based Internet
POLICY '02 Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks (POLICY'02)
Feedback Control of Computing Systems
Feedback Control of Computing Systems
An Artificial Intelligence Perspective on Autonomic Computing Policies
POLICY '04 Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks
SLA based profit optimization in autonomic computing systems
Proceedings of the 2nd international conference on Service oriented computing
A survey of autonomic communications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Achieving Self-Management via Utility Functions
IEEE Internet Computing
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A survey of autonomic computing—degrees, models, and applications
ACM Computing Surveys (CSUR)
Self-adaptive software: Landscape and research challenges
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
An Adaptive Reinforcement Learning Approach to Policy-Driven Autonomic Management
ICAS '09 Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Efficient security policy enforcement in a location based service environment
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
On-Line Scheduling of Real-Time Services for Cloud Computing
SERVICES '10 Proceedings of the 2010 6th World Congress on Services
The smart internet: current research and future applications
The smart internet: current research and future applications
Parameterized Complexity
Hi-index | 0.01 |
Self-adaptive and self-managing systems optimize their own behaviour according to high-level objectives and constraints. One way for administrators to specify goals for such optimization problems effectively is using policies. Over the past decade, researchers produced various approaches, models and techniques for policy specification in different areas including distributed systems, communications networks, web services, autonomic computing, and cloud computing. Research challenges range from characterizing policies for ease of specification in particular application domains to categorizing policies for achieving solution qualities for particular algorithmic techniques. The contributions of this paper are threefold. Firstly, we give a mathematical formulation for each of the three policy types, action, goal and utility function policies, introduced in the policy framework by Kephart and Walsh. In particular, we introduce a first precise characterization of goal policies for optimization problems. Secondly, this paper introduces a mathematical framework that adds structure to the underlying optimization problem for different types of policies. Structure is added either to the objective function or the constraints of the optimization problem. These mathematical structures, imposed on the underlying problem, progressively increase the quality of the solutions obtained when using the greedy optimization technique. Thirdly, we show the applicability of our framework by analyzing several optimization problems encountered in self-adaptive and selfmanaging systems, such as resource allocation, quality of service management, and SLA profit optimization to provide quality guarantees for their solutions. Our approach is based on the algorithmic frameworks by Edmonds, Fisher et al., and Mestre, and the policy framework of Kephart and Walsh. Our characterization and approach will help designers of self-adaptive and self-managing systems formulate optimization problems, decide on algorithmic strategies based on policy requirements, and reason about solution qualities.