Mobile traffic generated by a variety of services is rapidly increasing in volume. Both network and computation resources in a single edge network are therefore often too limited to provide the desired Quality of Service (QoS) to mobile u.ers. In this paper, we propose a mathematical model, called ISNC, to perform an efficient joint slicing of mobile network and edge computation resources. JSNC aims at minimizing the total latency of transmitting, outsourcing and processing user traffic, under the constraint of user tolerable latency for multiple classes of traffic. The constraints of network, link and server capacities are considered as well. The optimization model results in a mixed-integer nonlinear programming (MINLP) problem. To tackle it efficiently, we perform an equivalent reformulation, and based on that, we further propose two effective heuristics: Sequential Fixing (SF), which can achieve near-optimal solutions, and a greedy approach which obtains suboptimal results with respect to SF. Both of them can solve the optimization problem in a very short computing time. We evaluate the performance of the proposed model and heuristics, showing the impact of all the considered parameters (viz. different types of traffic, tolerable latency, network topology and bandwidth, computation and link capacity) on the optimal and approximate solutions. Numerical results demonstrate that JSNC and the heuristics can provide efficient resource allocation solutions.

Joint Network Slicing and Mobile Edge Computing in 5G Networks

Xiang, B;Elias, J;Di Nitto, E
2019-01-01

Abstract

Mobile traffic generated by a variety of services is rapidly increasing in volume. Both network and computation resources in a single edge network are therefore often too limited to provide the desired Quality of Service (QoS) to mobile u.ers. In this paper, we propose a mathematical model, called ISNC, to perform an efficient joint slicing of mobile network and edge computation resources. JSNC aims at minimizing the total latency of transmitting, outsourcing and processing user traffic, under the constraint of user tolerable latency for multiple classes of traffic. The constraints of network, link and server capacities are considered as well. The optimization model results in a mixed-integer nonlinear programming (MINLP) problem. To tackle it efficiently, we perform an equivalent reformulation, and based on that, we further propose two effective heuristics: Sequential Fixing (SF), which can achieve near-optimal solutions, and a greedy approach which obtains suboptimal results with respect to SF. Both of them can solve the optimization problem in a very short computing time. We evaluate the performance of the proposed model and heuristics, showing the impact of all the considered parameters (viz. different types of traffic, tolerable latency, network topology and bandwidth, computation and link capacity) on the optimal and approximate solutions. Numerical results demonstrate that JSNC and the heuristics can provide efficient resource allocation solutions.
2019
2019 IEEE International Conference on Communications (ICC)
Network slicing; edge computing; joint allocation; hierarchical network structure
File in questo prodotto:
File Dimensione Formato  
slicing_edge.pdf

accesso aperto

Descrizione: Camera ready paper
: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 568.9 kB
Formato Adobe PDF
568.9 kB Adobe PDF Visualizza/Apri
slicing_edge_VoR.pdf

Accesso riservato

Descrizione: Version of Record
: Publisher’s version
Dimensione 5.87 MB
Formato Adobe PDF
5.87 MB 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/11311/1120892
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 25
social impact