Multi-Access Edge Computing (MEC) is one of the key technology enablers of the 5G ecosystem, in combination with the high speed access provided by mmWave communications. In this paper, among all services enabled by MEC, we focus on computation offloading, devising an algorithm to optimize computation and communication resources jointly with the assignment of mobile users to Access Points and Mobile Edge Hosts, in a dynamic scenario where computation tasks are continuously generated according to (unknown) random arrival processes at each user. To formulate and solve the dynamic allocation/assignment problem, we merge tools from stochastic optimization and matching theory, thus developing a low complexity algorithmic solution that works in an online fashion. Numerical results illustrate the potential advantages of the proposed approach.

Dynamic joint resource allocation and user assignment in multi-access edge computing / Merluzzi, Mattia; DI LORENZO, Paolo; Barbarossa, Sergio. - (2019), pp. 4759-4763. ((Intervento presentato al convegno IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) tenutosi a Brighton [10.1109/ICASSP.2019.8683499].

Dynamic joint resource allocation and user assignment in multi-access edge computing

Merluzzi, Mattia;Paolo, Di Lorenzo;Barbarossa, Sergio
2019

Abstract

Multi-Access Edge Computing (MEC) is one of the key technology enablers of the 5G ecosystem, in combination with the high speed access provided by mmWave communications. In this paper, among all services enabled by MEC, we focus on computation offloading, devising an algorithm to optimize computation and communication resources jointly with the assignment of mobile users to Access Points and Mobile Edge Hosts, in a dynamic scenario where computation tasks are continuously generated according to (unknown) random arrival processes at each user. To formulate and solve the dynamic allocation/assignment problem, we merge tools from stochastic optimization and matching theory, thus developing a low complexity algorithmic solution that works in an online fashion. Numerical results illustrate the potential advantages of the proposed approach.
978-1-4799-8131-1
File allegati a questo prodotto
File Dimensione Formato  
Merluzzi_Dynamic-joint_2019.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 229.84 kB
Formato Adobe PDF
229.84 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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: http://hdl.handle.net/11573/1282617
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 7
social impact