Application Placement with Constraint Relaxation

TL;DR

This paper presents a novel approach using Answer Set Programming to optimize application placement in cloud-edge networks, effectively handling unsatisfiable constraints and preferences, demonstrated through simulated experiments.

Contribution

It introduces a constraint relaxation method for application placement problems using Answer Set Programming, addressing limitations of existing solutions.

Findings

Effective in simulated cloud-edge scenarios

Handles unsatisfiable constraints and preferences

Demonstrates practical applicability in lifelike networks

Abstract

Novel utility computing paradigms rely upon the deployment of multi-service applications to pervasive and highly distributed cloud-edge infrastructure resources. Deciding onto which computational nodes to place services in cloud-edge networks, as per their functional and non-functional constraints, can be formulated as a combinatorial optimisation problem. Most existing solutions in this space are not able to deal with \emph{unsatisfiable} problem instances, nor preferences, i.e. requirements that DevOps may agree to relax to obtain a solution. In this article, we exploit Answer Set Programming optimisation capabilities to tackle this problem. Experimental results in simulated settings show that our approach is effective on lifelike networks and applications.