Network Function Virtualization (NFV) introduces a new network architecture framework that evolves network functions, traditionally deployed over dedicated equipment, to software implementations that run on general-purpose hardware. One of the main challenges for deploying NFV is the optimal resource placement of demanded network services in the NFV infrastructure. The virtual network function placement and network embedding can be formulated as a mathematical optimization problem concerned with a set of feasibility constraints that express the restrictions of the network infrastructure and the services contracted. This problem has been reported to be NP-hard, as a result most of the optimization work carried out in the area has focused on designing heuristic and metaheuristic algorithms. Nevertheless, in highly constrained problems, as in this case, inferring a competitive heuristic can be a daunting task that requires expertise. Consequently, an interesting solution is the use of Reinforcement Learning to model an optimization policy. The work presented here extends the Neural Combinatorial Optimization theory by considering constraints in the definition of the problem. The resulting agent is able to learn placement decisions by exploring the NFV infrastructure with the aim of minimizing the overall power consumption. The experiments conducted demonstrate that when the proposed strategy is also combined with heuristics, highly competitive results are achieved using relatively simple algorithms.
In the fast-changing technological landscape, novel applications are emerging with the potential to reshape the world. These applications, while promising, impose stringent requirements in terms of quality of service (QoS). The advent of wireless networks like 5G, 6G and Wi-Fi 6 brings about resource management solutions to ensure these requirements while meeting the user expectations within the interconnected environment. Nevertheless, user behaviors are also evolving, highlighting the importance of satisfaction and quality of experience (QoE). Furthermore, changes in user behavior trigger shifts in business models, where the quality of business (QoBiz) takes on a pivotal role. This evolving ecosystem, encompassing QoS, QoE, and QoBiz, demands a comprehensive and adaptable approach that conventional QoS management frameworks fail to perform. This paper introduces an implementation methodology for a global QoS management model named QoXphere. The implementation methodology is grounded in machine learning techniques and addresses the multifaceted aspects of quality of service (QoX) and their interconnections within wireless networks. The objective is to facilitate dynamic resource management that not only elevates user satisfaction but also optimizes provider benefits. Real-world examples illustrate the methodology’s applicability in widely deployed networks, complemented by simulated scenarios of modern network environments that further validate the approach.
Wi-Fi networks face increasing pressure due to the rapid growth in the number of connected devices, the diversity of applications, and rising user expectations. Managing quality of service (QoS) in such complex environments requires a holistic approach. This study validates a machine learning (ML)-based methodology for comprehensive quality of X (QoX) management, integrating quality of service (QoS), quality of experience (QoE), and quality of business (QoBiz). The approach was evaluated during the migration of the Eduroam Wi-Fi network at the University of the Basque Country (EHU) from Wi-Fi 5 to Wi-Fi 6. Traffic patterns, protocol adoption, performance indicators, and user feedback were analyzed before and after the migration to identify the key quality indicators (KQIs) and to assess the scalability, consistency, and effectiveness of the proposed methodology. Results show that the ML-driven QoX management methodology applied during the migration process enables adaptive, efficient, and user-centric network management. The consistency of improvements across Wi-Fi generations confirms the robustness and scalability of the method for continuous optimization in dynamic wireless environments.
The evolution of commodity hardware makes it possible to use this type of equipment to implement traffic monitoring systems. A preliminary empirical evaluation of a network traffic probe based on Linux indicates that the system performance has significant losses as the network rate increases. To assess this issue, we consider a model with two tandem queues and a moving server. In this system, we formulate a three-dimensional Markov Decision Process in continuous time. The goal of the proposed model is to determine the position of the server in each time slot so as to optimize the system performance which is measured in terms of throughput. We first formulate an equivalent discrete-time Markov Decision Process and we propose a numerical method to characterize the solution of our problem in a general setting. The solution we obtain in this problem has been tested for a wide range of scenarios and, in all the instances, we observe that the optimality is close to a threshold type policy. We also consider a real probe and we validate the good performance of threshold policies in real applications.
Monitoring the evolution of the state of networks is an important issue to ensure that many applications provide the required quality of service. The first step in network-monitoring systems consists of capturing packets; that is, packets arrive at the system through a network interface card and are placed into system memory. Then, in this first stage, and usually in relation to the operating system, packets are treated and transferred from the capturing buffer to a higher-layer processing, for instance, to be analyzed in the next step of the system. In this work, we focus on the capturing stage. In particular, we focus on a Linux packet-capturing system. We model it as a single server queue. Taking into account that the server can be in charge not only of the capturing process but also of other tasks, we consider that the queue has vacations, i.e., there is some time when the capturing process cannot be carried out. We also assume that the queue has a finite buffer. We consider three different models and present a rigorous analysis of the derived Markov chain of each of the models. We provide standard performance metrics in all cases. We also evaluate the performance of these models in a real packet-capture probe.