Dimensioning V2N services in 5G networks through forecast-based scaling

With the increasing adoption of intelligent transportation systems and the upcoming era of autonomous vehicles, vehicular services (such as remote driving, cooperative awareness, and hazard warning) will have to operate in an ever-changing and dynamic environment. Anticipating the dynamics of traffic flows on the roads is critical for these services and, therefore, it is of paramount importance to forecast how they will evolve over time. By predicting future events (such as traffic jams) and demands, vehicular services can take proactive actions to minimize Service Level Agreement (SLA) violations and reduce the risk of accidents. In this paper, we compare several techniques, including both traditional time-series and recent Machine Learning (ML)-based approaches, to forecast the traffic flow at different road segments in the city of Torino (Italy). Using the the most accurate forecasting technique, we propose n-max algorithm as a forecast-based scaling algorithm for vertical scaling of edge resources, comparing its benefits against state-of-the-art solutions for three distinct Vehicle-to-Network (V2N) services. Results show that the proposed scaling algorithm outperforms the state-of-the-art, reducing Service Level Objective (SLO) violations for remote driving and hazard warning services.Work partially funded by the EU H2020 5GROWTH Project (grant no. 856709) and H2020 collaborative Europe/Taiwan research project 5G-DIVE (grant no. 859881)

Statistical Multiplexing and Traffic Shaping Games for Network Slicing

Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst such slices. We study a simple dynamic resource sharing policy which allocates a 'share' of a pool of (distributed) resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a characterization of SCPF's performance gains over static slicing and general processor sharing. We show that higher gains are obtained when a slice's spatial load is more 'imbalanced' than, and/or 'orthogonal' to, the aggregate network load, and that the overall gain across slices is positive. We then address the associated dimensioning problem. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, which characterizes the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a 'traffic shaping' game with an achievable Nash equilibrium. Under high loads, the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis

Satellite integration in 5G : contribution on network architectures and traffic engineering solutions for hybrid satellite-terrestrial mobile backhauling

The recent technological advances in the satellite domain such as the use of High Throughput Satellites (HTS) with throughput rates that are magnitudes higher than with previous ones, or the use of large non- Geostationary Earth Orbit (GEO) satellites constellations, etc, are reducing the price per bit and enhancing the Quality of Service (QoS) metrics such as latency, etc., changing the way that the capacity is being brought to the market and making it more attractive for other services such as satellite broadband communications. These new capabilities coupled with the advantages offered by satellite communications such as the unique wide-scale geographical coverage, inherent broadcast/multicast capabilities and highly reliable connectivity, anticipate new opportunities for the integration of the satellite component into the 5G ecosystem. One of the most compelling scenarios is mobile backhauling, where satellite capacity can be used to complement the terrestrial backhauling infrastructure, not only in hard to reach areas, but also for more efficient traffic delivery to Radio Access Network (RAN) nodes, increased resiliency and better support for fast, temporary cell deployments and moving cells. In this context, this thesis work focuses on achieving better satellite-terrestrial backhaul network integration through the development of Traffic Engineering (TE) strategies to manage in a better way the dynamically steerable satellite provisioned capacity. To do this, this thesis work first takes the steps in the definition of an architectural framework that enables a better satellite-terrestrial mobile backhaul network integration, managing the satellite capacity as a constituent part of a Software Defined Networking (SDN) -based TE for mobile backhaul network. Under this basis, this thesis work first proposes and assesses a model for the analysis of capacity and traffic management strategies for hybrid satellite-terrestrial mobile backhauling networks that rely on SDN for fine-grained traffic steering. The performance analysis is carried out in terms of capacity gains that can be achieved when the satellite backhaul capacity is used for traffic overflow, taking into account the placement of the satellite capacity at different traffic aggregation levels and considering a spatial correlation of the traffic demand. Later, the thesis work presents the development of SDN-based TE strategies and algorithms that exploits the dynamically steerable satellite capacity provisioned for resilience purposes to better utilize the satellite capacity by maximizing the network utility under both failure and non-failure conditions in some terrestrial links, under the consideration of elastic, inelastic and unicast and multicast traffic. The performance analysis is carried out in terms of global network utility, fairness and connexion rejection rates compared to non SDN-based TE applications. Finally, sustained in the defined architectural framework designs, the thesis work presents an experimental Proof of Concept (PoC) and validation of a satellite-terrestrial backhaul links integration solution that builts upon SDN technologies for the realization of End-to-End (E2E) TE applications in mobile backhauling networks with a satellite component, assessing the feasibility of the proposed SDN-based integration solution under a practical laboratory setting that combines the use of commercial, experimentation-oriented and emulation equipment and software.Los recientes avances tecnológicos en el dominio de los satélites, como el uso de satélites de alto rendimiento (HTS) con tasas de rendimiento que son magnitudes más altas que los anteriores, o el uso de grandes constelaciones de satélites de órbita no geoestacionaria (GEO), etc. están reduciendo el precio por bit y mejorando las métricas de Calidad de Servicio (QoS) como la latencia, etc., cambiando la forma en que la capacidad se está llevando al mercado, y haciéndola más atractiva para otros servicios como las comunicaciones de banda ancha por satélite. Estas nuevas capacidades, junto con las ventajas ofrecidas por las comunicaciones por satélite, como la cobertura geográfica a gran escala, las inherentes capacidades de difusión / multidifusión y la conectividad altamente confiable, anticipan nuevas oportunidades para la integración de la componente satelital al ecosistema 5G. Uno de los escenarios más atractivos es el backhauling móvil, donde la capacidad del satélite se puede usar para complementar la infraestructura de backhauling terrestre, no solo en áreas de difícil acceso, sino también para la entrega de tráfico de manera más eficiente a los nodos de la Red de Acceso (RAN), una mayor resiliencia y mejor soporte para implementaciones rápidas y temporales de células, así como células en movimiento. En este contexto, este trabajo de tesis se centra en lograr una mejor integración de la red híbrida de backhaul satélital-terrestre, a través del desarrollo de estrategias de ingeniería de tráfico (TE) para gestionar de una mejor manera la capacidad dinámicamente orientable del satélite. Para hacer esto, este trabajo de tesis primero toma los pasos en la definición de un marco de arquitectura que permite una mejor integración de una red híbrida satelital-terrestre de backhaul móvil, gestionando la capacidad del satélite como parte constitutiva de un TE basado en Software Defined Networking (SDN). Bajo esta base, este trabajo de tesis primero propone y evalúa un modelo para el análisis de la capacidad y las estrategias de gestión del tráfico para redes híbridas satelital-terrestre de backhaul móvil basadas en SDN para la dirección de tráfico. El análisis de rendimiento se lleva a cabo en términos de aumento de capacidad que se puede lograr cuando la capacidad de la red de backhaul por satélite se utiliza para el desborde de tráfico, teniendo en cuenta la ubicación de la capacidad del satélite en diferentes niveles de agregación de tráfico y considerando una correlación espacial de la demanda de tráfico. Posteriormente, el trabajo de tesis presenta el desarrollo de estrategias y algoritmos de TE basados en SDN que explotan la capacidad dinámicamente orientable del satelite, provista con fines de resiliencia para utilizar de mejor manera la capacidad satelital al maximizar la utilidad de red en condiciones de falla y no falla en algunos enlaces terrestres, y bajo la consideración de tráfico elástico, inelástico y de unidifusión y multidifusión. El análisis de rendimiento se lleva a cabo en términos de tasas de rechazo, de utilidad, y equidad en comparación con las aplicaciones de TE no basadas en SDN. Finalmente, basado en la definición del diseño de marco de arquitectura, el trabajo de tesis presenta una Prueba de concepto (PoC) experimental y la validación de una solución de integración de enlaces de backhaul satelital-terrestre que se basa en las tecnologías SDN para la realización de aplicaciones de TE de extremo a extremo (E2E) en redes de backhaul móviles, evaluando la viabilidad de la solución propuesta de integración basada en SDN en un entorno práctico de laboratorio que combina el uso de equipos y software comerciales, orientados a la experimentación y emulación.Postprint (published version

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators

Analytical modeling of HSUPA-enabled UMTS networks for capacity planning

In recent years, mobile communication networks have experienced significant evolution. The 3G mobile communication system, UMTS, employs WCDMA as the air interface standard, which leads to quite different mobile network planning and dimensioning processes compared with 2G systems. The UMTS system capacity is limited by the received interference at NodeBs due to the unique features of WCDMA, which is denoted as `soft capacity'. Consequently, the key challenge in UMTS radio network planning has been shifted from channel allocation in the channelized 2G systems to blocking and outage probabilities computation under the `cell breathing' effects which are due to the relationship between network coverage and capacity. The interference characterization, especially for the other-cell interference, is one of the most important components in 3G mobile networks planning. This monograph firstly investigates the system behavior in the operation of UMTS uplink, and develops the analytic techniques to model interference and system load as fully-characterized random variables, which can be directly applicable to the performance modeling of such networks. When the analysis progresses from single-cell scenario to multi-cell scenario, as the target SIR oriented power control mechanism is employed for maximum capacity, more sophisticated system operation, `feedback behavior', has emerged, as the interference levels at different cells depend on each other. Such behaviors are also captured into the constructed interference model by iterative and approximation approaches. The models are then extended to cater for the features of the newly introduced HSUPA, which provides enhanced dedicated channels for the packet switched data services such that much higher bandwidth can be achieved for best-effort elastic traffic, which allows network operators to cope with the coexistence of both circuit-switched and packet-switched traffic and guarantee the QoS requirements. During the derivation, we consider various propagation models, traffic models, resource allocation schemes for many possible scenarios, each of which may lead to different analytical models. All the suggested models are validated with either Monte-Carlo simulations or discrete event simulations, where excellent matches between results are always achieved. Furthermore, this monograph studies the optimization-based resource allocation strategies in the UMTS uplink with integrated QoS/best-effort traffic. Optimization techniques, both linear-programming based and non-linear-programming based, are used to determine how much resource should be assigned to each enhanced uplink user in the multi-cell environment where each NodeB possesses full knowledge of the whole network. The system performance under such resource allocation schemes are analyzed and compared via Monte-Carlo simulations, which verifies that the proposed framework may serve as a good estimation and optimal reference to study how systems perform for network operators

Theories and Models for Internet Quality of Service

We survey recent advances in theories and models for Internet Quality of Service (QoS). We start with the theory of network calculus, which lays the foundation for support of deterministic performance guarantees in networks, and illustrate its applications to integrated services, differentiated services, and streaming media playback delays. We also present mechanisms and architecture for scalable support of guaranteed services in the Internet, based on the concept of a stateless core. Methods for scalable control operations are also briefly discussed. We then turn our attention to statistical performance guarantees, and describe several new probabilistic results that can be used for a statistical dimensioning of differentiated services. Lastly, we review recent proposals and results in supporting performance guarantees in a best effort context. These include models for elastic throughput guarantees based on TCP performance modeling, techniques for some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support

Performance evaluation of multicast networks and service differentiation mechanisms in IP networks

The performance of a communication network depends on how well the network is designed in terms of delivering the level of service required by a given type of traffic. The field of teletraffic theory is concerned with quantifying the three-way relationship between the network, its level of service and the traffic arriving at the network. In this thesis, we study three different problems concerning this three-way relationship and present models to assist in designing and dimensioning networks to satisfy the different quality of service demands. In the first part of the thesis, we consider service differentiation mechanisms in packet-switched IP networks implementing a Differentiated Services (DiffServ) architecture. We study how bandwidth can be divided in a weighted fair manner between persistent elastic TCP flows, and between these TCP flows and streaming real-time UDP flows. To this end, we model the traffic conditioning and scheduling mechanisms on the packet and the flow level. We also model the interaction of these DiffServ mechanisms with the TCP congestion control mechanism and present closed-loop models for the sending rate of a TCP flow that reacts to congestion signals from the network. In the second part, we concentrate on non-persistent elastic TCP traffic in IP networks and study how flows can be differentiated in terms of mean delay by giving priority to flows based on their age. We study Multi Level Processor Sharing (MLPS) disciplines, where jobs are classified into levels based on their age or attained service. Between levels, a strict priority discipline is applied; the level containing the youngest jobs has the highest priority. Inside a particular level, any scheduling discipline could be used. We present an implementation proposal of a two-level discipline, PS+PS, with the Processor Sharing discipline used inside both levels. We prove that, as long as the hazard rate of the job-size distribution is decreasing, which is the case for Internet traffic, PS+PS, and any MLPS discipline that favors young jobs, is better than PS with respect to overall mean delay. In the final part, we study distribution-type streaming traffic in a multicast network, where there is, at most, one copy of each channel transmission in each network link, and quantify the blocking probability. We derive an exact blocking probability algorithm for multicast traffic in a tree network based on the convolution and truncation algorithm for unicast traffic. We present a new convolution operation, the OR-convolution, to suit the transmission principle of multicast traffic, and a new truncation operator to take into account the case of having both unicast and multicast traffic in the network. We also consider different user models derived from the single-user model.reviewe