Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:40:32.472Z Has data issue: false hasContentIssue false

Probabilistic QoS-aware Placement of VNF Chains at the Edge

Published online by Cambridge University Press:  15 February 2021

STEFANO FORTI
Affiliation:
Department of Computer Science, University of Pisa, Pisa, Italy (e-mails: stefano.forti@di.unipi.it, antonio.brogi@unipi.it, federica.paganelli@unipi.it)
FEDERICA PAGANELLI
Affiliation:
Department of Computer Science, University of Pisa, Pisa, Italy (e-mails: stefano.forti@di.unipi.it, antonio.brogi@unipi.it, federica.paganelli@unipi.it)
ANTONIO BROGI
Affiliation:
Department of Computer Science, University of Pisa, Pisa, Italy (e-mails: stefano.forti@di.unipi.it, antonio.brogi@unipi.it, federica.paganelli@unipi.it)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Deploying Internet of Things (IoT)-enabled virtual network function (VNF) chains to Cloud-Edge infrastructures requires determining a placement for each VNF that satisfies all set deployment requirements as well as a software-defined routing of traffic flows between consecutive functions that meets all set communication requirements. In this article, we present a declarative solution, EdgeUsher, to the problem of how to best place VNF chains to Cloud-Edge infrastructures. EdgeUsher can determine all eligible placements for a set of VNF chains to a Cloud-Edge infrastructure so to satisfy all of their hardware, IoT, security, bandwidth, and latency requirements. It exploits probability distributions to model the dynamic variations in the available Cloud-Edge infrastructure and to assess output eligible placements against those variations.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of Theory and Practice of Logic Programming
Supplementary material: PDF

Forti et al. supplementary material

Appendix A

Download Forti et al. supplementary material(PDF)
PDF 131 KB