Edge computing has attracted a lot of attention both from industry and academia in recent years and is considered as a key enabler for addressing the increasingly strict requirements of Next Generation applications. Contrary to Cloud computing, in Edge computing the computation are placed closer to the end-users into the so-called Edge, to facilitate low-latency and high-bandwidth applications and services that would not be feasible using cloud and far remote processing alone. However, the distributed, dynamic and heterogeneous environment in the Edge computing along with the diverse applications’ requirements make service placement in such infrastructure a challenging issue. One important aspect of Edge computing is the management of the placement of the applications in the network system so as to minimize each application’s runtime, given the resources of system’s devices and the capabilities of the system’s network. To this end, we propose an empirical experimental analysis, by comparing the results of different placements strategies and various edge communication networks. In particular, we model the problem of proactive placement of application images as a Minimum Vertex Cover problem. Our results demonstrate that the Greedy implementation seems to offer the best tradeoff in terms of performance, cost function and execution time.

Pro-active component image placement in edge computing environments

Carlini E.;Mordacchini M.;
2024

Abstract

Edge computing has attracted a lot of attention both from industry and academia in recent years and is considered as a key enabler for addressing the increasingly strict requirements of Next Generation applications. Contrary to Cloud computing, in Edge computing the computation are placed closer to the end-users into the so-called Edge, to facilitate low-latency and high-bandwidth applications and services that would not be feasible using cloud and far remote processing alone. However, the distributed, dynamic and heterogeneous environment in the Edge computing along with the diverse applications’ requirements make service placement in such infrastructure a challenging issue. One important aspect of Edge computing is the management of the placement of the applications in the network system so as to minimize each application’s runtime, given the resources of system’s devices and the capabilities of the system’s network. To this end, we propose an empirical experimental analysis, by comparing the results of different placements strategies and various edge communication networks. In particular, we model the problem of proactive placement of application images as a Minimum Vertex Cover problem. Our results demonstrate that the Greedy implementation seems to offer the best tradeoff in terms of performance, cost function and execution time.
2024
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Istituto di informatica e telematica - IIT
Edge computing
Cloud computing
Application placement
Component placement algorithm
Proactive image placement
Graphs
File in questo prodotto:
File Dimensione Formato  
Carlini et al_Elsevier 2024.pdf

non disponibili

Descrizione: Pro-active component image placement in Edge computing environments
Tipologia: Versione Editoriale (PDF)
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 803.09 kB
Formato Adobe PDF
803.09 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Carlini et al_FGCS_Elsevier-2024_preprint.pdf

accesso aperto

Descrizione: Pro-active Component Image Placement in Edge Computing Environments
Tipologia: Documento in Pre-print
Licenza: Altro tipo di licenza
Dimensione 471.91 kB
Formato Adobe PDF
471.91 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/485622
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
social impact