Application Placement with Constraint Relaxation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917200822009856 |
|---|---|
| author | Azzolini, Damiano Duca, Marco Forti, Stefano Gallo, Francesco Ielo, Antonio |
| author_facet | Azzolini, Damiano Duca, Marco Forti, Stefano Gallo, Francesco Ielo, Antonio |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_13895 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Application Placement with Constraint Relaxation Azzolini, Damiano Duca, Marco Forti, Stefano Gallo, Francesco Ielo, Antonio Logic in Computer Science Distributed, Parallel, and Cluster Computing 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. |
| title | Application Placement with Constraint Relaxation |
| topic | Logic in Computer Science Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2507.13895 |