Search

In modern cloud computing, the need for flexible and scalable orchestration of services, combined with robust security measures, is paramount. In this paper, we propose an innovative approach for managing secure cloud bursting in Kubernetes, combining Attribute-Based Encryption (ABE) with Kubernetes labeling. Our model addresses the challenges of complexity, cost, and data protection compliance by leveraging both Kubernetes and ABE. We introduce an attribute-based bursting component that uses Kubernetes labels for orchestration, and an encryption component that employs ABE for data protection. This unified management model ensures data confidentiality while enabling efficient cloud bursting. Our approach combines the strengths of label-based orchestration with fine-grained encryption, providing a technologically advanced yet user-friendly solution for secure cloud bursting. We present a proof-of-concept implementation that demonstrates the feasibility and effectiveness of our model. Our approach offers a unified solution that complies with security and privacy laws while meeting the needs of contemporary cloud-based systems.

Serverless computing is a new cloud computing model suitable for providing services in both large cloud and edge clusters. In edge clusters, the autoscaling functions play a key role on serverless platforms as the dynamic scaling of function instances can lead to reduced latency and efficient resource usage, both typical requirements of edge-hosted services. However, a badly configured scaling function can introduce unexpected latency due to so-called “cold start” events or service request losses. In this work, we focus on the optimization of resource-based autoscaling on OpenFaaS, the most-adopted open-source Kubernetes-based serverless platform, leveraging real-world serverless traffic traces. We resort to the reinforcement learning algorithm named Proximal Policy Optimization to dynamically configure the value of the Kubernetes Horizontal Pod Autoscaler, trained on real traffic. This was accomplished via a state space model able to take into account resource consumption, performance values, and time of day. In addition, the reward function definition promotes Service-Level Agreement (SLA) compliance. We evaluate the proposed agent, comparing its performance in terms of average latency, CPU usage, memory usage, and loss percentage with respect to the baseline system. The experimental results show the benefits provided by the proposed agent, obtaining a service time within the SLA while limiting resource consumption and service loss.

This paper intends to provide the reader with an overview of the main processes that are introducing artificial intelligence (AI) into healthcare services. The first part is organized according to an evolutionary perspective. We first describe the role that digital technologies have had in shaping the current healthcare methodologies and the relevant foundations for new evolutionary scenarios. Subsequently, the various evolutionary paths are illustrated with reference to AI techniques and their research activities, specifying their degree of readiness for actual clinical use. The organization of this paper is based on the interplay three pillars, namely, algorithms, enabling technologies and regulations, and healthcare methodologies. Through this organization we introduce the reader to the main evolutionary aspects of the healthcare ecosystem, to associate clinical needs with appropriate methodologies. We also explore the different aspects related to the Internet of the future that are not typically presented in papers that focus on AI, but that are equally crucial to determine the success of current research and development activities in healthcare.

Edge computing is one of the technological areas currently considered among the most promising for the implementation of many types of applications. In particular, IoT-type applications can benefit from reduced latency and better data protection. However, the price typically to be paid in order to benefit from the offered opportunities includes the need to use a reduced amount of resources compared to the traditional cloud environment. Indeed, it may happen that only one computing node can be used. In these situations, it is essential to introduce computing and memory resource management techniques that allow resources to be optimized while still guaranteeing acceptable performance, in terms of latency and probability of rejection. For this reason, the use of serverless technologies, managed by reinforcement learning algorithms, is an active area of research. In this paper, we explore and compare the performance of some machine learning algorithms for managing horizontal function autoscaling in a serverless edge computing system. In particular, we make use of open serverless technologies, deployed in a Kubernetes cluster, to experimentally fine-tune the performance of the algorithms. The results obtained allow both the understanding of some basic mechanisms typical of edge computing systems and related technologies that determine system performance and the guiding of configuration choices for systems in operation.

The need for adaptivity and scalability in telecommunication systems has led to the introduction of a software-based approach to networking, in which network functions are virtualized and implemented in software modules, based on network function virtualization (NFV) technologies. The growing demand for low latency, efficiency, flexibility and security has placed some limitations on the adoption of these technologies, due to some problems of traditional virtualization solutions. However, the introduction of lightweight virtualization approaches is paving the way for new and better infrastructures for implementing network functions. This article discusses these new virtualization solutions and shows a proposal, based on serverless computing, that uses them to implement container-based virtualized network functions for the delivery of advanced Internet of Things (IoT) services. It includes open source software components to implement both the virtualization layer, implemented through Firecracker, and the runtime environment, based on Kata containers. A set of experiments shows that the proposed approach is fast, in order to boost new network functions, and more efficient than some baseline solutions, with minimal resource footprint. Therefore, it is an excellent candidate to implement NFV functions in the edge deployment of serverless services for the IoT.

Convolutional neural networks (CNNs) are becoming increasingly popular in medical Image Segmentation. Among them, U-Net is a widely used model that can lead to cutting-edge results for 2D biomedical Image Segmentation. However, U-Net performance can be influenced by many factors, such as the size of the training dataset, the performance metrics used, the quality of the images and, in particular, the shape and size of the organ to be segmented. This could entail a loss of robustness of the U-Net-based models. In this paper, the performance of the considered networks is determined by using the publicly available images from the 3D-IRCADb-01 dataset. Different organs with different features are considered. Experimental results show that the U-Net-based segmentation performance decreases when organs with sparse binary masks are considered. The solution proposed in this paper, based on automated zooming of the parts of interest, allows improving the performance of the segmentation model by up to 20% in terms of Dice coefficient metric, when very sparse segmentation images are used, without affecting the cost of the learning process.

The complexity of molecular communications system, involving a massive number of interacting entities, makes scalability a fundamental property of simulators and modeling tools. A typical scenario is that of targeted drug delivery systems, which makes use of biological nanomachines close to a biological target, able to release molecules in the diseased area. In this paper, we propose a simple but reliable receiver model for diffusion-based molecular communication systems tackling the time needed for analyzing such a system. The proposed model consists of using an equivalent markovian queuing model, which reproduces the aggregate behavior of thousands of receptors spread over the receiver surface. It takes into account not only the fact that the absorption of molecules can occur only through receptors, but also that absorption is not an instantaneous process and may require a significant time during which the receptor is not available to bind to other molecules. Our results, expressed in terms of number of absorbed molecules and average number of busy receptors, demonstrate that the proposed approach is in good agreement with results obtained through particle-based simulations of a large number of receptors, although the time taken for obtaining the results with the proposed model is an order of magnitudes lower than the simulation time. We believe that this model can be the precursor of novel class of models based on similar principles that allow realizing reliable simulations of much larger systems.

Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution. It is used to define some caching scenarios with increasing complexity, which refers to real situations, including mobile 5G connectivity. For each scenario our aim is to maximize the hit ratio, which leads to the formulation of NP-complete optimization problems. The heuristic solutions proposed are based on the theory of the maximization of monotone submodular functions under matroid constraints. After the determination of the approximation ratio of the greedy heuristic algorithms proposed, a numerical performance analysis is shown. This analysis includes a comparison with the Least-Frequently Used (LFU) eviction strategy adapted to the analyzed systems. Results show very good performance, under the hypotheses of either known or unknown popularity of contents.

Cyber-physical systems (CPSs) are a new class of engineered systems based on interactions between cyber and physical components, by integrating three main components: communications, control, and computing. When these systems are brought to the nanoscale, some design and implementation issues arise. A high level of complexity is due to the use of biological components in a CPS, such as engineered cells, which may play the role of sensors, actuators, or even controllers. In this paper, we study the effectiveness of control solutions implemented through the usage of molecular communications in a biological nanoscale cyber-physical system, where a biological nanomachine plays the role of actuator, that releases drug molecules, and another acts as both sensor and controller. The goal of the proposal is to control the release rate, so that target cells can receive the desired amount of drug in a given time, by limiting potential side effects. Basically, we aim to limit congestion, which can arise when large amounts of molecules are released toward a target. To this aim, we propose a simple congestion detection scheme, and compare different rate control algorithms used to throttle the molecules release rate at the transmitter upon the reception of a feedback signal sent by the receiver. We validate the proposed techniques against delivery efficiency and delivery time of molecules by means of an extensive simulation campaign.

Serverless computing, especially implemented through Function-as-a-Service (FaaS) platforms, has recently been gaining popularity as an application deployment model in which functions are automatically instantiated when called and scaled when needed. When a warm start deployment mode is used, the FaaS platform gives users the perception of constantly available resources. Conversely, when a cold start mode is used, containers running the application’s modules are automatically destroyed when the application has been executed. The latter can lead to considerable resource and cost savings. In this paper, we explore the suitability of both modes for deploying Internet of Things (IoT) applications considering a low resources testbed comparable to an edge node. We discuss the implementation and the experimental analysis of an IoT serverless platform that includes typical IoT service elements. A performance study in terms of resource consumption and latency is presented for the warm and cold start deployment mode, and implemented using OpenFaaS, a well-known open-source FaaS framework which allows to test a cold start deployment with precise inactivity time setup thanks to its flexibility. This experimental analysis allows to evaluate the aptness of the two deployment modes under different operating conditions: Exploiting OpenFaaS minimum inactivity time setup, we find that the cold start mode can be convenient in order to save edge nodes limited resources, but only if the data transmission period is significantly higher than the time needed to trigger containers shutdown.

In an expected future multiaccess and multiservice IEEE 802.11 environment, the problem of providing users with useful service-related information to support a correct rapid network selection is expected to become a very important issue. A feasible short-term 802.11-tailored working solution, compliant with existing equipment, is to publish service information encoded within the SSID information element within beacon frames. This makes it possible for an operator to implement service publishing in 802.11 networks while waiting for a standardized mechanism. Also, this straightforward approach has allowed us to evaluate experimentally the performance of a beacon-based service publishing solution. In fact, the main focus of the paper is indeed to present a quantitative comparison of service discovery times between the legacy scenario, where the user is forced to associate and authenticate with a network point of access to check its service offer, and the enhanced scenario where the set of service-related information is broadcasted within beacons. These discovery times are obtained by processing the results of a measurement campaign performed in a multiaccess/service 802.11 environment. This analysis confirms the effectiveness of the beacon-based approach. We also show that the cost in terms of wireless bandwidth consumption of such solution is low.