8 research outputs found
Modeling Mobile Edge Computing Deployments for Low Latency Multimedia Services
Multi-access edge computing (MEC) technologies bring important improvements in terms of network bandwidth, latency, and use of context information and critical for services like multimedia streaming, augmented, and virtual reality. In future deployments, operators will need to decide how many MEC points of presence (PoPs) are needed and where to deploy them, also considering the number of base stations needed to support the expected traffic. This paper presents an application of inhomogeneous Poisson point processes with hard-core repulsion to model feasible MEC infrastructure deployments. With the presented methodology a mobile network operator knows where to locate the MEC PoPs and associated base stations to support a given set of services. We evaluate our model with simulations in realistic scenarios, namely Madrid City Center, an industrial area and a rural area.This work was supported in part by EU
H2020 5G-CORAL Project under Grant 761586, and in part by EU H2020
5G-TRANSFORMER Project under Grant 761536
IEEE Transactions on Broadcasting Special Issue on: 5G for Broadband Multimedia Systems and Broadcasting
[EN] The upcoming fifth-generation ( 5G ) of wireless communications technologies is expected to revolutionize society digital transformation thanks to its unprecedented wireless performance capabilities, providing speeds of several Gbps, very low latencies well below 5 ms, ultra-reliable transmissions with up to 99.999% success probability, while being able to handle a huge number of devices simultaneously connected to the network. The first version of the 3GPP specification (i.e., Release 15) has been recently completed and many 5G trials are under plan or carrying out worldwide, with the first commercial deployments happening in 2019."© 2019 IEEE. Personal use of this material is permitted. Permissíon from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertisíng or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works."Gomez-Barquero, D.; Li, W.; Fuentes, M.; Xiong, J.; Araniti, G.; Akamine, C.; Wang, J. (2019). IEEE Transactions on Broadcasting Special Issue on: 5G for Broadband Multimedia Systems and Broadcasting. IEEE Transactions on Broadcasting. 65(2):351-355. https://doi.org/10.1109/TBC.2019.2914866S35135565
OKpi: All-KPI Network Slicing Through Efficient Resource Allocation
Networks can now process data as well as transporting it; it follows that
they can support multiple services, each requiring different key performance
indicators (KPIs). Because of the former, it is critical to efficiently
allocate network and computing resources to provide the required services, and,
because of the latter, such decisions must jointly consider all KPIs targeted
by a service. Accounting for newly introduced KPIs (e.g., availability and
reliability) requires tailored models and solution strategies, and has been
conspicuously neglected by existing works, which are instead built around
traditional metrics like throughput and latency. We fill this gap by presenting
a novel methodology and resource allocation scheme, named OKpi, which enables
high-quality selection of radio points of access as well as VNF (Virtual
Network Function) placement and data routing, with polynomial computational
complexity. OKpi accounts for all relevant KPIs required by each service, and
for any available resource from the fog to the cloud. We prove several
important properties of OKpi and evaluate its performance in two real-world
scenarios, finding it to closely match the optimum
Demonstrating Immersive Media Delivery on 5G Broadcast and Multicast Testing Networks
This work presents eight demonstrators and one showcase developed within the
5G-Xcast project. They experimentally demonstrate and validate key technical
enablers for the future of media delivery, associated with multicast and
broadcast communication capabilities in 5th Generation (5G). In 5G-Xcast, three
existing testbeds: IRT in Munich (Germany), 5GIC in Surrey (UK), and TUAS in
Turku (Finland), have been developed into 5G broadcast and multicast testing
networks, which enables us to demonstrate our vision of a converged 5G
infrastructure with fixed and mobile accesses and terrestrial broadcast,
delivering immersive audio-visual media content. Built upon the improved
testing networks, the demonstrators and showcase developed in 5G-Xcast show the
impact of the technology developed in the project. Our demonstrations
predominantly cover use cases belonging to two verticals: Media & Entertainment
and Public Warning, which are future 5G scenarios relevant to multicast and
broadcast delivery. In this paper, we present the development of these
demonstrators, the showcase, and the testbeds. We also provide key findings
from the experiments and demonstrations, which not only validate the technical
solutions developed in the project, but also illustrate the potential technical
impact of these solutions for broadcasters, content providers, operators, and
other industries interested in the future immersive media delivery.Comment: 16 pages, 22 figures, IEEE Trans. Broadcastin
NFV orchestration in edge and fog scenarios
Mención Internacional en el título de doctorLas infraestructuras de red actuales soportan una
variedad diversa de servicios como video bajo demanda,
video conferencias, redes sociales, sistemas
de educación, o servicios de almacenamiento de
fotografías. Gran parte de la población mundial ha
comenzado a utilizar estos servicios, y los utilizan
diariamente. Proveedores de Cloud y operadores
de infraestructuras de red albergan el tráfico de
red generado por estos servicios, y sus tareas de
gestión no solo implican realizar el enrutamiento
del tráfico, sino también el procesado del tráfico de
servicios de red. Tradicionalmente, el procesado
del tráfico ha sido realizado mediante aplicaciones/
programas desplegados en servidores que estaban
dedicados en exclusiva a tareas concretas
como la inspección de paquetes. Sin embargo, en
los últimos anos los servicios de red se han virtualizado
y esto ha dado lugar al paradigma de
virtualización de funciones de red (Network Function
Virtualization (NFV) siguiendo las siglas en
ingles), en el que las funciones de red de un servicio
se ejecutan en contenedores o máquinas virtuales
desacopladas de la infraestructura hardware. Como
resultado, el procesado de tráfico se ha ido
haciendo más flexible gracias al laxo acople del
software y hardware, y a la posibilidad de compartir
funciones de red típicas, como firewalls, entre
los distintos servicios de red.
NFV facilita la automatización de operaciones
de red, ya que tareas como el escalado, o la migración
son típicamente llevadas a cabo mediante
un conjunto de comandos previamente definidos
por la tecnología de virtualización pertinente, bien
mediante contenedores o máquinas virtuales. De
todos modos, sigue siendo necesario decidir el en rutamiento y procesado del tráfico de cada servicio
de red. En otras palabras, que servidores tienen
que encargarse del procesado del tráfico, y que
enlaces de la red tienen que utilizarse para que las
peticiones de los usuarios lleguen a los servidores
finales, es decir, el conocido como embedding problem.
Bajo el paraguas del paradigma NFV, a este
problema se le conoce en inglés como Virtual Network
Embedding (VNE), y esta tesis utiliza el termino
“NFV orchestration algorithm” para referirse
a los algoritmos que resuelven este problema. El
problema del VNE es NP-hard, lo cual significa
que que es imposible encontrar una solución optima
en un tiempo polinómico, independientemente
del tamaño de la red. Como consecuencia, la comunidad
investigadora y de telecomunicaciones
utilizan heurísticos que encuentran soluciones de
manera más rápida que productos para la resolución
de problemas de optimización.
Tradicionalmente, los “NFV orchestration algorithms”
han intentado minimizar los costes de
despliegue derivados de las soluciones asociadas.
Por ejemplo, estos algoritmos intentan no consumir
el ancho de banda de la red, y usar rutas cortas
para no utilizar tantos recursos. Además, una tendencia
reciente ha llevado a la comunidad investigadora
a utilizar algoritmos que minimizan el
consumo energético de los servicios desplegados,
bien mediante la elección de dispositivos con un
consumo energético más eficiente, o mediante el
apagado de dispositivos de red en desuso. Típicamente,
las restricciones de los problemas de VNE se
han resumido en un conjunto de restricciones asociadas
al uso de recursos y consumo energético, y las
soluciones se diferenciaban por la función objetivo
utilizada. Pero eso era antes de la 5a generación de
redes móviles (5G) se considerase en el problema
de VNE. Con la aparición del 5G, nuevos servicios
de red y casos de uso entraron en escena. Los estándares
hablaban de comunicaciones ultra rápidas
y fiables (Ultra-Reliable and Low Latency Communications
(URLLC) usando las siglas en inglés) con
latencias por debajo de unos pocos milisegundos y
fiabilidades del 99.999%, una banda ancha mejorada
(enhanced Mobile Broadband (eMBB) usando
las siglas en inglés) con notorios incrementos en
el flujo de datos, e incluso la consideración de comunicaciones
masivas entre maquinas (Massive
Machine-Type Communications (mMTC) usando
las siglas en inglés) entre dispositivos IoT. Es más,
paradigmas como edge y fog computing se incorporaron a la tecnología 5G, e introducían la idea
de tener dispositivos de computo más cercanos al
usuario final. Como resultado, el problema del VNE
tenía que incorporar los nuevos requisitos como
restricciones a tener en cuenta, y toda solución
debía satisfacer bajas latencias, alta fiabilidad, y
mayores tasas de transmisión.
Esta tesis estudia el problema des VNE, y propone
algunos heurísticos que lidian con las restricciones
asociadas a servicios 5G en escenarios
edge y fog, es decir, las soluciones propuestas se
encargan de asignar funciones virtuales de red a
servidores, y deciden el enrutamiento del trafico
en las infraestructuras 5G con dispositivos edge y
fog. Para evaluar el rendimiento de las soluciones
propuestas, esta tesis estudia en primer lugar la
generación de grafos que representan redes 5G.
Los mecanismos propuestos para la generación de
grafos sirven para representar distintos escenarios
5G. En particular, escenarios de federación en
los que varios dominios comparten recursos entre
ellos. Los grafos generados también representan
servidores en el edge, así como dispositivos fog con
una batería limitada. Además, estos grafos tienen
en cuenta los requisitos de estándares, y la demanda
que se espera en las redes 5G. La generación de
grafos propuesta sirve para representar escenarios
federación en los que varios dominios comparten
recursos entre ellos, y redes 5G con servidores edge,
así como dispositivos fog estáticos o móviles con
una batería limitada. Los grafos generados para
infraestructuras 5G tienen en cuenta los requisitos
de estándares, y la demanda de red que se espera
en las redes 5G. Además, los grafos son diferentes
en función de la densidad de población, y el área
de estudio, es decir, si es una zona industrial, una
autopista, o una zona urbana.
Tras detallar la generación de grafos que representan
redes 5G, esta tesis propone algoritmos de
orquestación NFV para resolver con el problema
del VNE. Primero, se centra en escenarios federados
en los que los servicios de red se tienen que
asignar no solo a la infraestructura de un dominio,
sino a los recursos compartidos en la federación
de dominios. Dos problemas diferentes han sido estudiados,
uno es el problema del VNE propiamente
dicho sobre una infraestructura federada, y el otro
es la delegación de servicios de red. Es decir, si
un servicio de red se debe desplegar localmente
en un dominio, o en los recursos compartidos por
la federación de dominios; a sabiendas de que el último caso supone el pago de cuotas por parte del
dominio local a cambio del despliegue del servicio
de red. En segundo lugar, esta tesis propone
OKpi, un algoritmo de orquestación NFV para conseguir
la calidad de servicio de las distintas slices
de las redes 5G. Conceptualmente, el slicing consiste
en partir la red de modo que cada servicio
de red sea tratado de modo diferente dependiendo
del trozo al que pertenezca. Por ejemplo, una
slice de eHealth reservara los recursos de red necesarios
para conseguir bajas latencias en servicios
como operaciones quirúrgicas realizadas de manera
remota. Cada trozo (slice) está destinado a
unos servicios específicos con unos requisitos muy
concretos, como alta fiabilidad, restricciones de
localización, o latencias de un milisegundo. OKpi
es un algoritmo de orquestación NFV que consigue
satisfacer los requisitos de servicios de red en los
distintos trozos, o slices de la red. Tras presentar
OKpi, la tesis resuelve el problema del VNE en redes
5G con dispositivos fog estáticos y móviles. El
algoritmo de orquestación NFV presentado tiene
en cuenta las limitaciones de recursos de computo
de los dispositivos fog, además de los problemas
de falta de cobertura derivados de la movilidad de
los dispositivos.
Para concluir, esta tesis estudia el escalado
de servicios vehiculares Vehicle-to-Network (V2N),
que requieren de bajas latencias para servicios como
la prevención de choques, avisos de posibles
riesgos, y conducción remota. Para estos servicios,
los atascos y congestiones en la carretera pueden
causar el incumplimiento de los requisitos de latencia.
Por tanto, es necesario anticiparse a esas
circunstancias usando técnicas de series temporales
que permiten saber el tráfico inminente en los
siguientes minutos u horas, para así poder escalar
el servicio V2N adecuadamente.Current network infrastructures handle a diverse
range of network services such as video
on demand services, video-conferences, social
networks, educational systems, or photo
storage services. These services have been
embraced by a significant amount of the
world population, and are used on a daily basis.
Cloud providers and Network operators’
infrastructures accommodate the traffic rates
that the aforementioned services generate, and
their management tasks do not only involve
the traffic steering, but also the processing of
the network services’ traffic. Traditionally,
the traffic processing has been assessed via
applications/programs deployed on servers
that were exclusively dedicated to a specific
task as packet inspection. However, in recent
years network services have stated to be
virtualized and this has led to the Network
Function Virtualization (Network Function
Virtualization (NFV)) paradigm, in which the
network functions of a service run on containers
or virtual machines that are decoupled
from the hardware infrastructure. As a result,
the traffic processing has become more flexible
because of the loose coupling between
software and hardware, and the possibility
of sharing common network functions, as
firewalls, across multiple network services.
NFV eases the automation of network operations,
since scaling and migrations tasks
are typically performed by a set of commands
predefined by the virtualization technology,
either containers or virtual machines. However,
it is still necessary to decide the traffic steering and processing of every network
service. In other words, which servers will
hold the traffic processing, and which are the
network links to be traversed so the users’ requests
reach the final servers, i.e., the network
embedding problem. Under the umbrella of
NFV, this problem is known as Virtual Network
Embedding (VNE), and this thesis refers
as “NFV orchestration algorithms” to those
algorithms solving such a problem. The VNE
problem is a NP-hard, meaning that it is impossible
to find optimal solutions in polynomial
time, no matter the network size. As a
consequence, the research and telecommunications
community rely on heuristics that find
solutions quicker than a commodity optimization
solver.
Traditionally, NFV orchestration algorithms
have tried to minimize the deployment
costs derived from their solutions. For example,
they try to not exhaust the network
bandwidth, and use short paths to use less
network resources. Additionally, a recent
tendency led the research community towards
algorithms that minimize the energy consumption
of the deployed services, either
by selecting more energy efficient devices
or by turning off those network devices that
remained unused. VNE problem constraints
were typically summarized in a set of resources/energy constraints, and the solutions
differed on which objectives functions were
aimed for. But that was before 5th generation
of mobile networks (5G) were considered
in the VNE problem. With the appearance
of 5G, new network services and use cases
started to emerge. The standards talked about
Ultra Reliable Low Latency Communication
(Ultra-Reliable and Low Latency Communications
(URLLC)) with latencies below few
milliseconds and 99.999% reliability, an enhanced
mobile broadband (enhanced Mobile
Broadband (eMBB)) with significant data
rate increases, and even the consideration
of massive machine-type communications
(Massive Machine-Type Communications
(mMTC)) among Internet of Things (IoT) devices.
Moreover, paradigms such as edge and
fog computing blended with the 5G technology
to introduce the idea of having computing
devices closer to the end users. As a result, the VNE problem had to incorporate the new
requirements as constraints to be taken into
account, and every solution should either
satisfy low latencies, high reliability, or larger
data rates.
This thesis studies the VNE problem, and
proposes some heuristics tackling the constraints
related to 5G services in Edge and
fog scenarios, that is, the proposed solutions
assess the assignment of Virtual Network
Functions to resources, and the traffic steering
across 5G infrastructures that have Edge and
Fog devices. To evaluate the performance
of the proposed solutions, the thesis studies
first the generation of graphs that represent
5G networks. The proposed mechanisms to
generate graphs serve to represent diverse 5G
scenarios. In particular federation scenarios
in which several domains share resources
among themselves. The generated graphs
also represent edge servers, so as fog devices
with limited battery capacity. Additionally,
these graphs take into account the standard
requirements, and the expected demand for
5G networks. Moreover, the graphs differ depending
on the density of population, and the
area of study, i.e., whether it is an industrial
area, a highway, or an urban area.
After detailing the generation of graphs
representing the 5G networks, this thesis proposes
several NFV orchestration algorithms
to tackle the VNE problem. First, it focuses
on federation scenarios in which network services
should be assigned not only to a single
domain infrastructure, but also to the shared
resources of the federation of domains. Two
different problems are studied, one being the
VNE itself over a federated infrastructure, and
the other the delegation of network services.
That is, whether a network service should be
deployed in a local domain, or in the pool
of resources of the federation domain; knowing
that the latter charges the local domain
for hosting the network service. Second, the
thesis proposes OKpi, a NFV orchestration
algorithm to meet 5G network slices quality
of service. Conceptually, network slicing consists
in splitting the network so network services
are treated differently based on the slice
they belong to. For example, an eHealth network
slice will allocate the network resources necessary to meet low latencies for network
services such as remote surgery. Each network
slice is devoted to specific services with
very concrete requirements, as high reliability,
location constraints, or 1ms latencies. OKpi is
a NFV orchestration algorithm that meets the
network service requirements among different
slices. It is based on a multi-constrained
shortest path heuristic, and its solutions satisfy
latency, reliability, and location constraints.
After presenting OKpi, the thesis tackles the
VNE problem in 5G networks with static/moving
fog devices. The presented NFV orchestration
algorithm takes into account the limited
computing resources of fog devices, as well
as the out-of-coverage problems derived from
the devices’ mobility.
To conclude, this thesis studies the scaling
of Vehicle-to-Network (V2N) services, which
require low latencies for network services as
collision avoidance, hazard warning, and remote
driving. For these services, the presence
of traffic jams, or high vehicular traffic congestion
lead to the violation of latency requirements.
Hence, it is necessary to anticipate to
such circumstances by using time-series techniques
that allow to derive the incoming vehicular
traffic flow in the next minutes or hours,
so as to scale the V2N service accordingly.The 5G Exchange (5GEx) project (2015-2018) was an EU-funded project (H2020-ICT-2014-2 grant agreement 671636).
The 5G-TRANSFORMER project (2017-2019) is an EU-funded project (H2020-ICT-2016-2 grant agreement 761536).
The 5G-CORAL project (2017-2019) is an EU-Taiwan project (H2020-ICT-2016-2 grant agreement 761586).Programa de Doctorado en Ingeniería Telemática por la Universidad Carlos III de MadridPresidente: Ioannis Stavrakakis.- Secretario: Pablo Serrano Yáñez-Mingot.- Vocal: Paul Horatiu Patra
Mecanismos para la gestión eficiente del plano de control y del plano de datos en redes móviles 5G
En los últimos años, el incremento exponencial del tráfico de datos móviles, unido al despliegue de nuevos servicios sobre las redes actuales, han propiciado que los operadores de telecomunicaciones busquen nuevos mecanismos que permitan una gestión eficiente de la red. En este contexto, uno de los procesos involucrados en la gestión de la red es el soporte a la movilidad, cuyo principal objetivo es mantener las comunicaciones activas mientras los usuarios se mueven entre redes diferentes. A tal efecto, se han estandarizado protocolos para la gestión de movilidad centralizada (CMM) y distribuida (DMM), pero debido a la densificación de celdas producida por el incipiente desarrollo de 5G, se está produciendo un incremento de tráfico de señalización usado para gestionar la movilidad, que debe ser tenido en cuenta por los operadores de red. Partiendo de esta situación, en esta tesis se proponen tres nuevos mecanismos para mejorar el rendimiento de las redes móviles desde tres perspectivas diferentes. Nuestra primera propuesta, TEDMM, permite llevar a cabo una gestión eficiente del plano de control. La segunda propuesta, SRDMM, combina SDN con DMM para mejorar el proceso de gestión de la movilidad desde el punto de vista del plano de datos. Nuestro tercer mecanismo (LNA) propone una estrategia de asociación entre estaciones base y la red de acceso para mejorar el rendimiento del plano de control y del plano de datos.In recent years, the world has witnessed an explosion of mobile communications due to the wide penetration of handheld mobile devices generating an unprecedented amount of data traffic. As the number of mobile users grows rapidly, 5G networks are evolving to match this growth and to ensure emerging services and applications according to the specific demands of mobile users. In such a challenging environment, effective mobility management mechanisms are needed and they are expected to serve mobile users with distinct mobility profiles The mobility management mechanisms provide seamless mobility support at the network level by maintaining ongoing communications while the users roam among different access networks. However, this mobility management protocols introduce signaling overhead for supporting seamless session continuity of the mobile nodes by using control messages between mobility agents. This aspect, together with the cell densification produced by 5G, will increase total signaling traffic, degrading the QoS and QoE requirements. Thus, the operators are seeking innovative solutions to the optimization of mobility management procedures within the 5G evolved architecture. In this Thesis, we propose three mechanisms in order to improve the performance of mobility management protocols. First, we propose a novel mechanism, called TE-DMM, to improve the performance of the control plane by reducing the signaling traffic. Then, taking advantage of the benefits that SDN brings, we present a novel mobility management solution to improve the performance of the data plane. Finally, we propose a novel link-network assignment strategy to enhance the overall performance of the mobility protocols