arXiv subjects

Raffaele Bruno

Publications and source records attributed to Raffaele Bruno.

At least 19 recordsLinked to original sources

arXiv2025

Towards End-to-End Application Slicing in Multi-access Edge Computing systems: Architecture Discussion and Proof-of-Concept

Network slicing is one of the most critical 5G pillars. It allows for sharing a 5G infrastructure among different tenants leading to improved service customisation and increased operators' revenues. Concurrently, introducing the Multi-access Edge Computing (MEC) into 5G to support time-critical applications raises the need to integrate this distributed computing infrastructure to the 5G network slicing framework. Indeed, end-to-end latency guarantees require the end-to-end management of slice resources. For this purpose, after discussing the main gaps in the state-of-the-art with regards to such an objective, we propose a novel slicing architecture that enables the management and orchestration of slice segments that span over all the domains of an end-to-end application service, including the MEC. We also show how this general management architecture can be instantiated into a multi-tenant MEC infrastructure. A preliminary implementation of the proposed architecture focusing on the MEC domain is also provided, together with performance tests to validate the feasibility and efficacy of our design approach.

cs.NI↗

arXiv2025

SLICES, a scientific instrument for the networking community

A science is defined by a set of encyclopedic knowledge related to facts or phenomena following rules or evidenced by experimentally-driven observations. Computer Science and in particular computer networks is a relatively new scientific domain maturing over years and adopting the best practices inherited from more fundamental disciplines. The design of past, present and future networking components and architectures have been assisted, among other methods, by experimentally-driven research and in particular by the deployment of test platforms, usually named as testbeds. However, often experimentally-driven networking research used scattered methodologies, based on ad-hoc, small-sized testbeds, producing hardly repeatable results. We believe that computer networks needs to adopt a more structured methodology, supported by appropriate instruments, to produce credible experimental results supporting radical and incremental innovations. This paper reports lessons learned from the design and operation of test platforms for the scientific community dealing with digital infrastructures. We introduce the SLICES initiative as the outcome of several years of evolution of the concept of a networking test platform transformed into a scientific instrument. We address the challenges, requirements and opportunities that our community is facing to manage the full research-life cycle necessary to support a scientific methodology.

cs.NI↗

arXiv2025

Application-Aware Resource Allocation and Data Management for MEC-assisted IoT Service Providers

To support the growing demand for data-intensive and low-latency IoT applications, Multi-Access Edge Computing (MEC) is emerging as an effective edge-computing approach enabling the execution of delay-sensitive processing tasks close to end-users. However, most of the existing works on resource allocation and service placement in MEC systems overlook the unique characteristics of new IoT use cases. For instance, many IoT applications require the periodic execution of computing tasks on real-time data streams that originate from devices dispersed over a wide area. Thus, users requesting IoT services are typically distant from the data producers. To fill this gap, the contribution of this work is two-fold. Firstly, we propose a MEC-compliant architectural solution to support the operation of multiple IoT service providers over a common MEC platform deployment, which enables the steering and shaping of IoT data transport within the platform. Secondly, we model the problem of service placement and data management in the proposed MEC-based solution taking into account the dependencies at the data level between IoT services and sensing resources. Our model also considers that caches can be deployed on MEC hosts, to allow the sharing of the same data between different IoT services with overlapping geographical scope, and provides support for IoT services with heterogeneous QoS requirements, such as different frequencies of periodic task execution. Due to the complexity of the optimisation problem, a heuristic algorithm is proposed using linear relaxation and rounding techniques. Extensive simulation results demonstrate the efficiency of the proposed approach, especially when traffic demands generated by the service requests are not uniform.

cs.NI↗

arXiv2025

A Multi-stage Optimisation Approach to Design Relocation Strategies in One-way Car-sharing Systems with Stackable Cars

One of the main operational challenges faced by the operators of one-way car-sharing systems is to ensure vehicle availability across the regions of the service areas with uneven patterns of rental requests. Fleet balancing strategies are required to maximise the demand served while minimising the relocation costs. However, the design of optimal relocation policies is a complex problem, and global optimisation solutions are often limited to very small network sizes for computational reasons. In this work, we propose a multi-stage decision support system for vehicle relocation that decomposes the general relocation problem into three independent decision stages to allow scalable solutions. Furthermore, we adopt a rolling horizon control strategy to cope with demand uncertainty. Our approach is highly modular and flexible, and we leverage it to design user-based, operator-based and robotic relocation schemes. Besides, we formulate the relocation problem considering both conventional cars and a new class of compact stackable vehicles that can be driven in a road train. We compare the proposed relocation schemes with two recognised benchmarks using a large data set of taxi trips in New York. Our results show that our approach is scalable and outperforms the benchmark schemes in terms of quality of service, vehicle utilisation and relocation efficiency. Furthermore, we find that stackable vehicles can achieve a relocation performance close to that of autonomous cars, even with a small workforce of relocators.

cs.NI↗

arXiv2024

Energy-Efficient Deployment of Stateful FaaS Vertical Applications on Edge Data Networks

5G and beyond support the deployment of vertical applications, which is particularly appealing in combination with network slicing and edge computing to create a logically isolated environment for executing customer services. Even if serverless computing has gained significant interest as a cloud-native technology its adoption at the edge is lagging, especially because of the need to support stateful tasks, which are commonplace in, e.g., cognitive services, but not fully amenable to being deployed on limited and decentralized computing infrastructures. In this work, we study the emerging paradigm of stateful Function as a Service (FaaS) with lightweight task abstractions in WebAssembly. Specifically, we assess the implications of deploying inter-dependent tasks with an internal state on edge computing resources using a stateless vs. stateful approach and then derive a mathematical model to estimate the energy consumption of a workload with given characteristics, considering the power used for both processing and communication. The model is used in extensive simulations to determine the impact of key factors and assess the energy trade-offs of stateless vs. stateful.

cs.NI↗

arXiv2023

A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services

Car pooling is expected to significantly help in reducing traffic congestion and pollution in cities by enabling drivers to share their cars with travellers with similar itineraries and time schedules. A number of car pooling matching services have been designed in order to efficiently find successful ride matches in a given pool of drivers and potential passengers. However, it is now recognised that many non-monetary aspects and social considerations, besides simple mobility needs, may influence the individual willingness of sharing a ride, which are difficult to predict. To address this problem, in this study we propose GoTogether, a recommender system for car pooling services that leverages on learning-to-rank techniques to automatically derive the personalised ranking model of each user from the history of her choices (i.e., the type of accepted or rejected shared rides). Then, GoTogether builds the list of recommended rides in order to maximise the success rate of the offered matches. To test the performance of our scheme we use real data from Twitter and Foursquare sources in order to generate a dataset of plausible mobility patterns and ride requests in a metropolitan area. The results show that the proposed solution quickly obtain an accurate prediction of the personalised user's choice model both in static and dynamic conditions.

cs.IR↗

arXiv2022

A reinforcement learning-based link quality estimation strategy for RPL and its impact on topology management

Over the last few years, standardisation efforts are consolidating the role of the Routing Protocol for LowPower and Lossy Networks (RPL) as the standard routing protocol for IPv6 based Wireless Sensor Networks (WSNs). Although many core functionalities are well defined, others are left implementation dependent. Among them, the definition of an efficient link quality estimation (LQE) strategy is of paramount importance, as it influences significantly both the quality of the selected network routes and nodes' energy consumption. In this paper, we present RLProbe, a novel strategy for link quality monitoring in RPL, which accurately measures link quality with minimal overhead and energy waste. To achieve this goal, RLProbe leverages both synchronous and asynchronous monitoring schemes to maintain up-to-date information on link quality and to promptly react to sudden topology changes, e.g. due to mobility. Our solution relies on a reinforcement learning model to drive the monitoring procedures in order to minimise the overhead caused by active probing operations. The performance of the proposed solution is assessed by means of simulations and real experiments. Results demonstrated that RLProbe helps in effectively improving packet loss rates, allowing nodes to promptly react to link quality variations as well as to link failures due to node mobility.

cs.NI↗

arXiv2022

Reliable data delivery in ICN-IoT environments

In an IoT environment, which is characterized by a multitude of interconnected smart devices with sensing and computational capabilities, many applications are (i) content-based, that is, they are only interested in finding a given type of content rather than the location of data, and (ii) contextualized, that is, the content is generated and consumed in the proximity of the user. In this context, the Information-Centric Networking (ICN) paradigm is an appealing model for efficiently retrieving application data, and the service decentralization towards the network edge helps to reduce the core network load being the data produced by IoT devices mainly confined in the area where they are generated. MobCCN is an ICN-based data delivery protocol that we designed for operating efficiently in such context [1][2], where static and mobile IoT devices are enriched with ICN functions. Specifically, MobCCN leverages an efficient routing and forwarding protocol, exploiting opportunistic contacts among IoT mobile devices, to fill the Forwarding Interest Base (FIB) tables so as to correctly forward Interest packets towards the intended data producers. In this paper, we aim to enhance the reliability of MobCCN by exploring different retransmissions mechanisms, such as retransmissions based on number of duplicate Interests that are received for the same requested content, periodic retransmissions, single path versus disjoint multi-path forwarding, hysteresis mechanism and combinations of them. Extensive simulation results show that, among the analysed MobCCN variants, the one that implements both periodic retransmissions and a hysteresis-based retransmission process ensures the highest delivery rates (up to 95\%) and the shortest network path, with a very limited traffic overhead due to retransmissions.

cs.NI↗

arXiv2021

Cellular traffic offloading via Opportunistic Networking with Reinforcement Learning

The widespread diffusion of mobile phones is triggering an exponential growth of mobile data traffic that is likely to cause, in the near future, considerable traffic overload issues even in last-generation cellular networks. Offloading part of the traffic to other networks is considered a very promising approach and, in particular, in this paper, we consider offloading through opportunistic networks of users' devices. However, the performance of this solution strongly depends on the pattern of encounters between mobile nodes, which should therefore be taken into account when designing offloading control algorithms. In this paper, we propose an adaptive offloading solution based on the Reinforcement Learning framework and we evaluate and compare the performance of two well-known learning algorithms: Actor-Critic and Q-Learning. More precisely, in our solution the controller of the dissemination process, once trained, is able to select a proper number of content replicas to be injected into the opportunistic network to guarantee the timely delivery of contents to all interested users. We show that our system based on Reinforcement Learning is able to automatically learn a very efficient strategy to reduce the traffic on the cellular network, without relying on any additional context information about the opportunistic network. Our solution achieves a higher level of offloading with respect to other state-of-the-art approaches, in a range of different mobility settings. Moreover, we show that a more refined learning solution, based on the Actor-Critic algorithm, is significantly more efficient than a simpler solution based on Q-learning.

cs.NI↗

arXiv2021

Human-centric Data Dissemination in the IoP: Large-scale Modeling and Evaluation

Data management using Device-to-Device (D2D) communications and opportunistic networks (ONs) is one of the main focuses of human-centric pervasive Internet services. In the recently proposed "Internet of People" paradigm, accessing relevant data dynamically generated in the environment nearby is one of the key services. Moreover, personal mobile devices become proxies of their human users while exchanging data in the cyber world and, thus, largely use ONs and D2D communications for exchanging data directly. Recently, researchers have successfully demonstrated the viability of embedding human cognitive schemes in data dissemination algorithms for ONs. In this paper, we consider one such scheme based on the recognition heuristic, a human decision-making scheme used to efficiently assess the relevance of data. While initial evidence about its effectiveness is available, the evaluation of its behaviour in large-scale settings is still unsatisfactory. To overcome these limitations, we have developed a novel hybrid modelling methodology, which combines an analytical model of data dissemination within small-scale communities of mobile users, with detailed simulations of interactions between different communities. This methodology allows us to evaluate the algorithm in large-scale city- and country-wide scenarios. Results confirm the effectiveness of cognitive data dissemination schemes, even when content popularity is very heterogenous.

cs.NI↗

arXiv2021

Next generation IEEE 802.11 Wireless Local Area Networks: Current status, future directions and open challenges

new generation of Wireless Local Area Networks (WLANs) will make its appearance in the market in the forthcoming years based on the amendments to the IEEE 802.11 standards that have recently been approved or are under development. Examples of the most expected ones are IEEE 802.11aa (Robust Audio Video Transport Streaming), IEEE 802.11ac (Very-high throughput at < 6 GHz), IEEE 802.11af (TV White Spaces) and IEEE 802.11ah (Machine-to-Machine communications) specifications. The aim of this survey is to provide a comprehensive overview of these novel technical features and the related open technical challenges that will drive the future WLAN evolution. In contrast to other IEEE 802.11 surveys, this is a use case oriented study. Specifically, we first describe the three key scenarios in which next-generation WLANs will have to operate. We then review the most relevant amendments for each of these use cases focusing on the additional functionalities and the new technologies they include, such as multi-user MIMO techniques, groupcast communications, dynamic channel bonding, spectrum databases and channel sensing, enhanced power saving mechanisms and efficient small data transmissions. We also discuss the related work to highlight the key issues that must still be addressed. Finally, we review emerging trends that can influence the design of future WLANs, with special focus on software-defined MACs and the internet-working with cellular systems.

cs.NI↗

arXiv2021

Making opportunistic networks in IoT environments CCN-ready: A performance evaluation of the MobCCN protocol

In future IoT environments it is expected that the role of personal devices of mobile users in the physical area where IoT devices are deployed will become more and more important. In particular, due to the push towards decentralisation of services towards the edge, it is likely that a significant share of data generated by IoT devices will be needed by other (mobile) nodes nearby, while global Internet access will be limited only to a small fraction of data. In this context, opportunistic networking schemes can be adopted to build efficient content-centric protocols, through which data generated by IoT devices (or by mobile nodes themselves) can be accessed by the other nodes nearby. In this paper, we propose MobCCN, which is an ICN-compliant protocol for this heterogeneous environment. MobCCN is designed to implement the routing and forwarding mechanisms of the main ICN realisations, such as CCN. The original aspect of MobCCN is to implement an efficient opportunistic networking routing scheme to populate the Forwarding Interest Base (FIB) tables of the nodes, in order to guide the propagation of Interest packets towards nodes that store the required data. Specifically, MobCCN defines the utility of each node as a forwarder of Interest packets for a certain type of content, such that Interest packets can be propagated along a positive utility gradient, until reaching some node storing the data. We evaluate MobCCN against protocols representing two possible endpoints of the spectrum, respectively in terms of minimising the data delivery delay and the resource consumption. Performance results show that MobCCN is very effective and efficient, as it guarantees very high delivery rates and low delays, while keeping the total generated traffic at a reasonable level and also saving local resources.

cs.NI↗

arXiv2021

Weak Signals in the Mobility Landscape: Car Sharing in Ten European Cities

Car sharing is one the pillars of a smart transportation infrastructure, as it is expected to reduce traffic congestion, parking demands and pollution in our cities. From the point of view of demand modelling, car sharing is a weak signal in the city landscape: only a small percentage of the population uses it, and thus it is difficult to study reliably with traditional techniques such as households travel diaries. In this work, we depart from these traditional approaches and we leverage web-based, digital records about vehicle availability in 10 European cities for one of the major active car sharing operators. We discuss which sociodemographic and urban activity indicators are associated with variations in car sharing demand, which forecasting approach (among the most popular in the related literature) is better suited to predict pickup and drop-off events, and how the spatio-temporal information about vehicle availability can be used to infer how different zones in a city are used by customers. We conclude the paper by presenting a direct application of the analysis of the dataset, aimed at identifying where to locate maintenance facilities within the car sharing operation area.

cs.LG↗

arXiv2021

Preemptive periodic epidemic control reduces life and healthcare system costs without aggravation of social and economic losses

Many countries are managing COVID-19 epidemic by switching between lighter and heavier restrictions. While an open-close and a close-open cycle have comparable socio-economic costs, the former leads to a much heavier burden in terms of deaths and pressure on the healthcare system. An empirical demonstration of the toll ensuing from procrastination was recently observed in Israel, where both cycles were enforced from late August to mid-December 2020, yielding some 1,600 deaths with open-close compared to 440 with close-open.

eess.SY↗

arXiv2021

Vaccination and SARS-CoV-2 variants: how much containment is still needed? A quantitative assessment

Despite the progress in medical care, combined population-wide interventions (such as physical distancing, testing and contact tracing) are still crucial to manage the SARS-CoV-2 pandemic, aggravated by the emergence of new highly transmissible variants. We combine the compartmental SIDARTHE model, predicting the course of COVID-19 infections, with a new data-based model that projects new cases onto casualties and healthcare system costs. Based on the Italian case study, we outline several scenarios: mass vaccination campaigns with different paces, different transmission rates due to new variants, and different enforced countermeasures, including the alternation of opening and closure phases. Our results demonstrate that non-pharmaceutical interventions (NPIs) have a higher impact on the epidemic evolution than vaccination, which advocates for the need to keep containment measures in place throughout the vaccination campaign. We also show that, if intermittent open-close strategies are adopted, deaths and healthcare system costs can be drastically reduced, without any aggravation of socioeconomic losses, as long as one has the foresight to start with a closing phase rather than an opening one.

q-bio.PE↗

arXiv2020

CovidDeep: SARS-CoV-2/COVID-19 Test Based on Wearable Medical Sensors and Efficient Neural Networks

The novel coronavirus (SARS-CoV-2) has led to a pandemic. The current testing regime based on Reverse Transcription-Polymerase Chain Reaction for SARS-CoV-2 has been unable to keep up with testing demands, and also suffers from a relatively low positive detection rate in the early stages of the resultant COVID-19 disease. Hence, there is a need for an alternative approach for repeated large-scale testing of SARS-CoV-2/COVID-19. We propose a framework called CovidDeep that combines efficient DNNs with commercially available WMSs for pervasive testing of the virus. We collected data from 87 individuals, spanning three cohorts including healthy, asymptomatic, and symptomatic patients. We trained DNNs on various subsets of the features automatically extracted from six WMS and questionnaire categories to perform ablation studies to determine which subsets are most efficacious in terms of test accuracy for a three-way classification. The highest test accuracy obtained was 98.1%. We also augmented the real training dataset with a synthetic training dataset drawn from the same probability distribution to impose a prior on DNN weights and leveraged a grow-and-prune synthesis paradigm to learn both DNN architecture and weights. This boosted the accuracy of the various DNNs further and simultaneously reduced their size and floating-point operations.

cs.HC↗

arXiv2020

A SIDARTHE Model of COVID-19 Epidemic in Italy

In late December 2019, a novel strand of Coronavirus (SARS-CoV-2) causing a severe, potentially fatal respiratory syndrome (COVID-19) was identified in Wuhan, Hubei Province, China and is causing outbreaks in multiple world countries, soon becoming a pandemic. Italy has now become the most hit country outside of Asia: on March 16, 2020, the Italian Civil Protection documented a total of 27980 confirmed cases and 2158 deaths of people tested positive for SARS-CoV-2. In the context of an emerging infectious disease outbreak, it is of paramount importance to predict the trend of the epidemic in order to plan an effective control strategy and to determine its impact. This paper proposes a new epidemic model that discriminates between infected individuals depending on whether they have been diagnosed and on the severity of their symptoms. The distinction between diagnosed and non-diagnosed is important because non-diagnosed individuals are more likely to spread the infection than diagnosed ones, since the latter are typically isolated, and can explain misperceptions of the case fatality rate and of the seriousness of the epidemic phenomenon. Being able to predict the amount of patients that will develop life-threatening symptoms is important since the disease frequently requires hospitalisation (and even Intensive Care Unit admission) and challenges the healthcare system capacity. We show how the basic reproduction number can be redefined in the new framework, thus capturing the potential for epidemic containment. Simulation results are compared with real data on the COVID-19 epidemic in Italy, to show the validity of the model and compare different possible predicted scenarios depending on the adopted countermeasures.

q-bio.PE↗

arXiv2017

Relocation in Car Sharing Systems with Shared Stackable Vehicles: Modelling Challenges and Outlook

Car sharing is expected to reduce traffic congestion and pollution in cities while at the same time improving accessibility to public transport. However, the most popular form of car sharing, one-way car sharing, still suffers from the vehicle unbalance problem. Innovative solutions to this issue rely on custom vehicles with stackable capabilities: customers or operators can drive a train of vehicles if necessary, thus efficiently bringing several cars from an area with few requests to an area with many requests. However, how to model a car sharing system with stackable vehicles is an open problem in the related literature. In this paper, we propose a queueing theoretical model to fill this gap, and we use this model to derive an upper-bound on user-based relocation capabilities. We also validate, for the first time in the related literature, legacy queueing theoretical models against a trace of real car sharing data. Finally, we present preliminary results about the impact, on car availability, of simple user-based relocation heuristics with stackable vehicles. Our results indicate that user-based relocation schemes that exploit vehicle stackability can significantly improve car availability at stations.

cs.PF↗