Preference-based Multiobjective Virtual Machine Placement: A Ceteris Paribus Approach
This work adopts the notion of Ceteris Paribus (CP) as an interpretation of the Decision Maker (DM) preferences and incorporates it in a constrained multiobjective problem known as virtual machine placement (VMP). VMP is an essential multiobjective problem in the design and operation of cloud data centers concerned about placing each virtual machine to a physical machine (a server) in the data center. We analyze the effectiveness of CP interpretation on VMP problems and propose an NSGA-II variant with which preferred solutions are returned at almost no extra time cost.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Survey on the Use of Preferences for Virtual Machine Placement in Cloud Data Centers
With the rapid development of virtualization techniques, cloud data centers allow for cost effective, flexible, and customizable deployments of applications on virtualized infrastructure. Virtual machine (VM) placement a…
Modeling Contrary-to-Duty with CP-nets
In a ceteris-paribus semantics for deontic logic, a state of affairs where a larger set of prescriptions is respected is preferable to a state of affairs where some of them are violated. Conditional preference nets (CP-n…
Ceteris paribus logic in counterfactual reasoning
The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit the…
counterfactualCounterfactual ReasoningDecision MakingCP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qual…
Decision MakingA Heuristically Assisted Deep Reinforcement Learning Approach for Network Slice Placement
Network Slice placement with the problem of allocation of resources from a virtualized substrate network is an optimization problem which can be formulated as a multiobjective Integer Linear Programming (ILP) problem. Ho…
Deep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)