Simulation of URLLC slicing with resource reconfiguration in 5G networks

This thesis seeks to analyse the performance of dynamic slice provisioning in a 5G metro network with the low latency and reliability guaranties. This elaborate highlight the comparison in terms of performance of two versions of a simulator developed in Python based on different models: the Exhaustive research model and Shortest Path First Fit (SPFF) model. It further presents the differences between the dedicated path protection and the shared path protection. This analysis is made through several simulations at different network conditions by varying networks resources and observing the network performances while comparing the 2 models mentioned above. A reconfiguration procedure was implemented on backup resources in the shortest path first fit in order to improve its performance with respect to the exhaustive research which is more optimised. Subsequently, several triggering events was implemented, for the reconfiguration. And a comparison is made between these different triggering events in terms blocking probability, bandwidth at link, capacity at each node, primary and backup bandwidth per slice and backup capacity per slice.

Procedure di Programmazione Dinamica per Determinare le K Migliori Soluzioni del Knapsack Problem 0-1 e dello Shortest Path Problem

In questa tesi viene trattata la problematica di determinare le migliori K soluzioni per due problemi di ottimizzazione, il Knapsack Problem 0-1 e lo Shortest Path Problem. Tali soluzioni possono essere impiegate all'interno di metodi di column generation per la risoluzione di problemi reali, ad esempio Bin Packing Problems e problemi di scheduling di veicoli ed equipaggi. Sono stati implementati, per verificarne sperimentalmente le prestazioni, nuovi algoritmi di programmazione dinamica, sviluppati nell’ambito di un programma di ricerca. Inizialmente, per entrambi i problemi, è stato descritto un algoritmo che determinasse le migliori K soluzioni per ogni possibile sottoproblema; partendo da uno zaino con capacità nulla, nel caso del Knapsack Problem 0-1, e dalla determinazione di un cammino dal vertice sorgente in se stesso per lo Shortest Path Problem, l’algoritmo determina le migliori soluzioni di sottoproblemi via via sempre più grandi, utilizzando le soluzioni costruite per gli stati precedenti, fino a ottenere le migliori soluzioni del problema globale. Successivamente, è stato definito un algoritmo basato su un approccio di ricorsione backward; in questo caso si utilizza una funzione ricorsiva che, chiamata a partire dallo stato corrispondente al problema globale, viene richiamata solo sugli stati intermedi strettamente necessari, e per ognuno di essi non vengono determinate soluzioni superflue.

Radio relics and magnetic fields in galaxy clusters

Radio relics are diffuse synchrotron sources generally located in the peripheries of galaxy clusters in merging state. According to the current leading scenario, relics trace gigantic cosmological shock waves that cross the intra-cluster medium where particle acceleration occurs. The relic/shock connection is supported by several observational facts, including the spatial coincidence between relics and shocks found in the X-rays. Under the assumptions that particles are accelerated at the shock front and are subsequently deposited and then age downstream of the shock, Markevitch et al. (2005) proposed a method to constrain the magnetic field strength in radio relics. Measuring the thickness of radio relics at different frequencies allows to derive combined constraints on the velocity of the downstream flow and on the magnetic field, which in turns determines particle aging. We elaborate this idea to infer first constraints on magnetic fields in cluster outskirts. We consider three models of particle aging and develop a geometric model to take into account the contribution to the relic transverse size due to the projection of the shock-surface on the plane of the sky. We selected three well studied radio relics in the clusters A 521, CIZA J2242.8+5301 and 1RXS J0603.3+4214. These relics have been chosen primarily because they are almost seen edge-on and because the Mach number of the shock that is associated with these relics is measured by X-ray observations, thus allowing to break the degeneracy between magnetic field and downstream velocity in the method. For the first two clusters, our method is consistent with a pure radiative aging model allowing us to derive constraints on the relics magnetic field strength. In the case of 1RXS J0603.3+4214 we find that particle life-times are consistent with a pure radiative aging model under some conditions, however we also collect evidences for downstream particle re-acceleration in the relic W-region and for a magnetic field decaying downstream in its E-region. Our estimates of the magnetic field strength in the relics in A 521 and CIZA J2242.8+5301 provide unique information on the field properties in cluster outskirts. The constraints derived for these relics, together with the lower limits to the magnetic field that we derived from the lack of inverse Compton X-ray emission from the sources, have been combined with the constraints from Faraday rotation studies of the Coma cluster. Overall results suggest that the spatial profile of the magnetic field energy density is broader than that of the thermal gas, implying that the ε_th /ε_B ratio decreases with cluster radius. Alternatively, radio relics could trace dynamically active regions where the magnetic field strength is biased high with respect to the average value in the cluster volume.

Sperimentazione di protocolli di routing ip su piattaforme raspberry pi.

Tesi mirata allo studio dei protocolli di routing IP utilizzati per l'inoltro dei pacchetti in una topologia non banale. Sono state utilizzate macchine Linux Raspberry Pi per il loro costo e ingombro per costruire la rete. In particolare, è stata implementata una rete caratterizzata da sette router divisi in tre aree distinte, ai quali sono state connesse sette LAN. Si è installato e utilizzato il software quagga per attivare il protocollo OSPF (Open Shortest Path First). Per limitare i dispositivi fisici si è utilizzato il software Mininet per virtualizzare switch e LAN. Infine, sono stati trattati elementi teorici del routing su Internet, applicati alla rete creata per verificarne il funzionamento.

Deployment of a data analysis workflow of the ATLAS experiment on HPC systems

LHC experiments produce an enormous amount of data, estimated of the order of a few PetaBytes per year. Data management takes place using the Worldwide LHC Computing Grid (WLCG) grid infrastructure, both for storage and processing operations. However, in recent years, many more resources are available on High Performance Computing (HPC) farms, which generally have many computing nodes with a high number of processors. Large collaborations are working to use these resources in the most efficient way, compatibly with the constraints imposed by computing models (data distributed on the Grid, authentication, software dependencies, etc.). The aim of this thesis project is to develop a software framework that allows users to process a typical data analysis workflow of the ATLAS experiment on HPC systems. The developed analysis framework shall be deployed on the computing resources of the Open Physics Hub project and on the CINECA Marconi100 cluster, in view of the switch-on of the Leonardo supercomputer, foreseen in 2023.

Modeling and Model Predictive Control of an Industrial Hydraulic System

This thesis aims to illustrate the construction of a mathematical model of a hydraulic system, oriented to the design of a model predictive control (MPC) algorithm. The modeling procedure starts with the basic formulation of a piston-servovalve system. The latter is a complex non linear system with some unknown and not measurable effects that constitute a challenging problem for the modeling procedure. The first level of approximation for system parameters is obtained basing on datasheet informations, provided workbench tests and other data from the company. Then, to validate and refine the model, open-loop simulations have been made for data matching with the characteristics obtained from real acquisitions. The final developed set of ODEs captures all the main peculiarities of the system despite some characteristics due to highly varying and unknown hydraulic effects, like the unmodeled resistive elements of the pipes. After an accurate analysis, since the model presents many internal complexities, a simplified version is presented. The latter is used to linearize and discretize correctly the non linear model. Basing on that, a MPC algorithm for reference tracking with linear constraints is implemented. The results obtained show the potential of MPC in this kind of industrial applications, thus a high quality tracking performances while satisfying state and input constraints. The increased robustness and flexibility are evident with respect to the standard control techniques, such as PID controllers, adopted for these systems. The simulations for model validation and the controlled system have been carried out in a Python code environment.

Embedding Starobinsky inflation in string compactifications

A period of accelerated expansion of the primordial universe, known as inflation, represents the standard paradigm for the early universe cosmology. While inflation agrees with observational constraints, a complete understanding of its physical origin is not available yet. This suggests the necessity of an embedding into a more fundamental theory. String theory is arguably the best-developed candidate for an ultra-violet (UV) complete theory of gravity and string compactifications could provide a natural framework for addressing this issue. The aim of this thesis work is to investigate the potential embedding of Starobinsky inflation in effective field theories arising in string compactifications. In particular, we focus on two main objectives. The first one is the evaluation of Yukawa-like couplings in f (R)-theories of gravity with fermions, more specifically in the context of Starobinsky inflation. The second goal is understanding if any of the moduli which naturally arise in string compactifications has the right form of this coupling and displays the correct scalar potential, as needed for a possible identification with the scalar field driving Starobinsky inflation.

Distributed collision-free traffic management via vertex cover for multi-vehicle systems

In this thesis, we state the collision avoidance problem as a vertex covering problem, then we consider a distributed framework in which a team of cooperating Unmanned Vehicles (UVs) aim to solve this optimization problem cooperatively to guarantee collision avoidance between group members. For this purpose, we implement a distributed control scheme based on a robust Set-Theoretic Model Predictive Control ( ST-MPC) strategy, where the problem involves vehicles with independent dynamics but with coupled constraints, to capture required cooperative behavior.

Studio e implementazione di algoritmi per il tracciamento ottimo di satellite LEO da stazioni di terra di tipo radioamatoriale

Questo elaborato di tesi ha l’obbiettivo di studiare le limitazioni delle stazioni di terra nel tracciamento di satelliti in orbita LEO, investigare possibili soluzioni ed implementare queste soluzioni all’interno della Ground Station AMGS di Forlì per verificarne l’efficacia. A questo scopo, dopo un’attenta revisione della letteratura sono stati identificati due promettenti algoritmi descritti nei paper: “Trajectory optimisation to minimise antenna pointing error” di P. S. Crawford , R. J. H. Brush e “An optimal antenna motion generation using shortest path planning” di Moon-Jin Jeon , Dong-Soo Kwon. Questi algoritmi sono stati implementi in Python 3, al fine di inglobarli all’interno del software di tracking al momento in uso nella GS di Forlì, ovvero AMGS Orbit Predictor. All’interno di questo elaborato sono anche riportati i risultati dei test conseguiti e una valutazione dettagliata di questi ultimi.