Pasar al contenido principal

INVESTIGACION EN FUTURAS REDES TOTALMENTE OPTIMIZADAS MEDIANTE INTELIGENCIA ARTIFICIAL - A

PID2020-118011GB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 84
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

On the stability of the Kubernetes Horizontal Autoscaler control loop

  • Serracanta Pujol, Berta|||0000-0003-3195-2576
  • Lukács, Andor
  • Rodríguez Natal, Alberto
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Rétvári, Gábor
Kubernetes is a widely used platform for deploying and managing containerized applications due to its efficient elastic capabilities. The Horizontal Pod Autoscaler (HPA) in Kubernetes independently adjusts the number of pods for each service, yet these services often operate in an interconnected manner. This study aims to understand the effects of autoscaling events on a graph of interconnected services. To achieve this, we apply control theory to model the HPA’s behavior. We analyze the stability of this model, perform numerical simulations, and deploy a real testbed to evaluate the performance. Our findings demonstrate that the control theory-based model accurately predicts the HPA’s behavior, ensuring system stability with CPU utilization meeting desired thresholds and no traffic loss after a transitional period. The model provides insights into optimizing resource scheduling and improving application performance in Kubernetes environments. Additionally, we extend our model to the whole service graph to understand how individual scaling decisions influence the complex graphs of cloud applications., This work was supported in part by the Spanish I+D+i Project TowaRds fully AI-empowered NetwoRks, subproject A (TRAINER-A), funded by Ministerio de Ciencia e Innovación (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 under Grant PID2020-118011GB-C21; in part by the Catalan Institution for Research and Advanced Studies (ICREA) through the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia; in part by the European Social Fund; and in part by the National Research, Development and Innovation Fund of Hungary under Grant OTKA/ANN-135606, Grant OTKA/FK-135074, and Grant OTKA/FK-134604., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Probabilistic constellation shaping in flex-grid over multicore fibre optical backbone networks: an energy savings evaluation

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Cho, Junho
  • Spadaro, Salvatore|||0000-0002-4100-1726
Probabilistic constellation shaping (PCS) has been shown to close the gap to channel capacity at any distance, by providing a fine-grained software-defined trade-off between achievable spectral efficiency and transmission reach. Previous works on PCS performance evaluation in Flex-Grid over multicore fibre optical backbone networks have already noted its superior performance when compared to traditional modulation formats, as well as its potential to lower associated network capital expenditures (CAPEX) by allowing, for example, a reduction in the required number of transceivers to handle the offered traffic demands. This paper investigates the potential of PCS to lower network energy consumption, as a way to contribute to the eco-friendliness and sustainability of next-generation optical backbone networks. © 2024 IEEE., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Fast traffic engineering by gradient descent with learned differentiable routing

  • Rusek, Krzysztof
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Cholda, Piotr
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Emerging applications such as the metaverse, telesurgery or cloud computing require increasingly complex operational demands on networks (e.g., ultra-reliable low latency). Likewise, the ever-faster traffic dynamics will demand network control mechanisms that can operate at short timescales (e.g., sub-minute). In this context, Traffic Engineering (TE) is a key component to efficiently control network traffic according to some performance goals (e.g., minimize network congestion).This paper presents Routing By Backprop (RBB), a novel TE method based on Graph Neural Networks (GNN) and differentiable programming. Thanks to its internal GNN model, RBB builds an end-to-end differentiable function of the target TE problem (MinMaxLoad). This enables fast TE optimization via gradient descent. In our evaluation, we show the potential of RBB to optimize OSPF-based routing (˜25% of improvement with respect to default OSPF configurations). Moreover, we test the potential of RBB as an initializer of computationally-intensive TE solvers. The experimental results show promising prospects for accelerating this type of solvers and achieving efficient online TE optimization., This work was supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University and by the PL-Grid Infrastructure. Also, this publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Accelerating deep reinforcement learning for digital twin network optimization with evolutionary strategies

  • Güemes Palau, Carlos|||0009-0001-8654-0512
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Xiao, Shihan
  • Cheng, Xiangle
  • Shi, Xiang
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
The recent growth of emergent network applications (e.g., satellite networks, vehicular networks) is increasing the complexity of managing modern communication networks. As a result, the community proposed the Digital Twin Networks (DTN) as a key enabler of efficient network management. Network operators can leverage the DTN to perform different optimization tasks (e.g., Traffic Engineering, Network Planning).Deep Reinforcement Learning (DRL) showed a high performance when applied to solve network optimization problems. In the context of DTN, DRL can be leveraged to solve optimization problems without directly impacting the real-world network behavior. However, DRL scales poorly with the problem size and complexity. In this paper, we explore the use of Evolutionary Strategies (ES) to train DRL agents for solving a routing optimization problem. The experimental results show that ES achieved a training time speed-up of 128 and 6 for the NSFNET and GEANT2 topologies respectively., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Atom: Neural traffic compression with spatio-temporal graph neural networks

  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Rusek, Krzysztof
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Storing network traffic data is key to efficient network management; however, it is becoming more challenging and costly due to the ever-increasing data transmission rates, traffic volumes, and connected devices. In this paper, we explore the use of neural architectures for network traffic compression. Specifically, we consider a network scenario with multiple measurement points in a network topology. Such measurements can be interpreted as multiple time series that exhibit spatial and temporal correlations induced by network topology, routing, or user behavior. We present Atom, a neural traffic compression method that leverages spatial and temporal correlations present in network traffic. Atom implements a customized spatio-temporal graph neural network design that effectively exploits both types of correlations simultaneously. The experimental results show that Atom can outperform GZIP’s compression ratios by 50%-65% on three real-world networks., This work was supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European UnionNextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-0630002021-52). It has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”. This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. It was also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. Krzysztof Rusek was supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University of Science and Technology., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

TrackSign-labeled web tracking dataset

  • Castell Uroz, Ismael
  • Barlet Ros, Pere|||0000-0001-7837-0886
Recent studies show that more than 95% of the websites available on the Internet contain at least one of the so-called web tracking systems. These systems are specialized in identifying their users by means of a plethora of different methods. Some of them (e.g., cookies) are very well known by most Internet users. However, the percentage of websites including more "obscure" and privacy-threatening systems, such as fingerprinting methods identifying a user's computer, is constantly increasing. Detecting those methods on today's Internet is very difficult, as almost any website modifies its content dynamically and minimizes its code in order to speed up loading times. This minimization and dynamicity render the website code unreadable by humans. Thus, the research community is constantly looking for new ways to discover unknown web tracking systems running under the hood. In this paper, we present a new dataset containing tracking information for more than 76 million URLs and 45 million online resources, extracted from 1.5 million popular websites. The tracking labeling process was done using a state-of-the-art discovery web tracking algorithm called TrackSign. The dataset also contains information about online security and the relation between the domains, the loaded URLs, and the online resource behind each URL. This information can be useful for different kinds of experiments, such as locating privacy-threatening resources, identifying security threats, or determining characteristics of the URL network graph., This publication is part of the Spanish I+D+i project TRAINER-A (ref.∼PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

ASTrack: Automatic detection and removal of web tracking code with minimal functionality loss

  • Castell Uroz, Ismael
  • Fukuda, Kensuke
  • Barlet Ros, Pere|||0000-0001-7837-0886
Recent advances in web technologies make it more difficult than ever to detect and block web tracking systems. In this work, we propose ASTrack, a novel approach to web tracking detection and removal. ASTrack uses an abstraction of the code structure based on Abstract Syntax Trees to selectively identify web tracking functionality shared across multiple web services. This new methodology allows us to: (i) effectively detect web tracking code even when using evasion techniques (e.g., obfuscation, minification, or webpackaging); and (ii) safely remove those portions of code related to tracking purposes without affecting the legitimate functionality of the website. Our evaluation with the top 10k most popular Internet domains shows that ASTrack can detect web tracking with high precision (98%), while discovering about 50k tracking code pieces and more than 3,400 new tracking URLs not previously recognized by most popular privacy-preserving tools (e.g., uBlock Origin). Moreover, ASTrack achieved a 36% reduction in functionality loss in comparison with the filter lists, one of the safest options available. Using a novel methodology that combines computer vision and manual inspection, we estimate that full functionality is preserved in more than 97% of the websites., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also par-tially supported by the NII internship program., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Detecting contextual network anomalies with graph neural networks

  • Latif Martínez, Hamid|||0000-0001-6006-3175
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Detecting anomalies on network traffic is a complex task due to the massive amount of traffic flows in today’s networks, as well as the highly-dynamic nature of traffic over time. In this paper, we propose the use of Graph Neural Networks (GNN) for network traffic anomaly detection. We formulate the problem as contextual anomaly detection on network traffic measurements, and propose a custom GNN-based solution that detects traffic anomalies on origin-destination flows. In our evaluation, we use real-world data from Abilene (6 months), and make a comparison with other widely used methods for the same task (PCA, EWMA, RNN). The results show that the anomalies detected by our solution are quite complementary to those captured by the baselines (with a max. of 36.33% overlapping anomalies for PCA). Moreover, we manually inspect the anomalies detected by our method, and find that a large portion of them can be visually validated by a network expert (64% with high confidence, 18% with mid confidence, 18% normal traffic). Lastly, we analyze the characteristics of the anomalies through two paradigmatic cases that are quite representative of the bulk of anomalies., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/50110-0011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA). This work was supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union – NextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-063000-2021-52). It has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Flow optimization at inter-datacenter networks for application run-time acceleration

  • Serracanta Pujol, Berta|||0000-0003-3195-2576
  • Rodríguez Natal, Alberto
  • Maino, Fabio
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
In the present-day, distributed applications are commonly spread across multiple datacenters, reaching out to edge and fog computing locations. The transition away from single datacenter hosting is driven by capacity constraints in datacenters and the adoption of hybrid deployment strategies, combining on-premise and public cloud facilities. However, the performance of such applications is often limited by extended Flow Completion Times (FCT) for short flows due to queuing behind bursts of packets from concurrent long flows. To address this challenge, we propose a solution to prioritize short flows over long flows in the Software-Defined Wide-Area Network (SD-WAN) interconnecting the distributed computing platforms. Our solution utilizes eBPF to segregate short and long flows, transmitting them over separate tunnels with the same properties. By effectively mitigating queuing delays, we consistently achieve a 1.5 times reduction in FCT for short flows, resulting in improved application response times. The proposed solution works with encrypted traffic and is application-agnostic, making it deployable in diverse distributed environments without modifying the applications themselves. Our testbed evaluation demonstrates the effectiveness of our approach in accelerating the run-time of distributed applications, providing valuable insights for optimizing multi-datacenter and edge deployments., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Evaluating a multidisciplinary model for managing human uncertainty in 5G cyber-physical-social systems

  • Alzate Mejía, Nestor
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Santos Boada, Germán|||0000-0002-9528-2287
  • Almeida Amazonas, José Roberto de
This paper presents a comprehensive evaluation of the previously introduced multidisciplinary model to quantify human uncertainty (MMtQHU) within a realistic 5G-enabled cyber–physical–social systems (CPSS) environment. The MMtQHU, which integrates human, social, and environmental factors into CPSS modeling, is applied to the Ingolstadt traffic scenario (InTAS), a detailed urban simulation reflecting high-traffic conditions. By modeling unpredictable driver behaviors, such as deviations from optimal routes, the study assesses the model’s effectiveness in managing human-induced uncertainties in vehicle-for-hire (VFH) applications. The evaluation shows that human uncertainty significantly impacts 5G network resource allocation and traffic dynamics. A comparative analysis of traditional resource allocation methods reveals their limitations in handling the dynamic nature of human behavior. These findings underscore the necessity for advanced, adaptive strategies, potentially leveraging artificial intelligence and machine learning to enhance the resilience and efficiency of 5G networks in CPSS environments. The study offers valuable insights for future advancements in robust and adaptive 5G infrastructure by highlighting the critical role of integrating human behavior into CPSS models., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GBC21) funded by MCIN/AEI/10.13039/501100011033 and by the aid granted by the Sinfoni project of the Cooperative University of Colombia., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

RouteNet-Erlang: A graph neural network for network performance evaluation

  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Rusek, Krzysztof
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Wu, Bo
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Network modeling is a fundamental tool in network research, design, and operation. Arguably the most popular method for modeling is Queuing Theory (QT). Its main limitation is that it imposes strong assumptions on the packet arrival process, which typically do not hold in real networks. In the field of Deep Learning, Graph Neural Networks (GNN) have emerged as a new technique to build data-driven models that can learn complex and non-linear behavior. In this paper, we present RouteNet-Erlang, a pioneering GNN architecture designed to model computer networks. RouteNet-Erlang supports complex traffic models, multi-queue scheduling policies, routing policies and can provide accurate estimates in networks not seen in the training phase. We benchmark RouteNet-Erlang against a state-of-the-art QT model, and our results show that it outperforms QT in all the network scenarios., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Evaluation of probabilistic constellation shaping performance in Flex Grid over multicore fiber dynamic optical backbone networks [Invited]

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Spadaro, Salvatore|||0000-0002-4100-1726
In this paper, we present a worst-case methodology for estimating the attainable spectral efficiency over end-to-end paths across a Flex Grid over multicore fiber (MCF) optical network. This methodology accounts for physical link noise, as well as for the signal-to-noise ratio in the Add module (SNR TX ) of spatial-division-multiplexing-enabled reconfigurable optical add and drop multiplexers (SDM-ROADMs), introducing a dominant noise contribution over that of their Bypass and Drop modules. The proposed methodology is subsequently used to quantify the benefits that probabilistic constellation shaping (PCS) can bring to Flex-Grid/MCF dynamic optical backbone networks, compared to using traditional polarization-multiplexed modulation formats. In a first step, insight is provided into the spectral efficiency attainable along the precomputed end-to-end paths in two reference backbone networks, either using PCS or traditional modulation formats. Moreover, in each one of these networks, two SNR TX values are identified: the SNR TX yielding the maximum average paths’ spectral efficiency, as well as an SNR TX that, although slightly degrading the average paths’ spectral efficiency (by 10%), would yet enable a cost-effective SDM-ROADM Add module implementation. Extensive simulations are conducted to analyze PCS offered load gains under 1% bandwidth blocking probability. Furthermore, the study lastly focuses on finding out whether lower fragmentation levels in Flex-Grid/MCF dynamic optical backbone networks can push PCS benefits even further., Funding: Agencia Estatal de Investigación (PID2020-118011GB-C21, PID2020-118011GB-C22, RED2018-102585-T)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

ENERO: Efficient real-time WAN routing optimization with Deep Reinforcement Learning

  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Xiao, Shihan
  • Cheng, Xiangle
  • Shi, Xiang
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Wide Area Networks (WAN) are a key infrastructure in today’s society. During the last years, WANs have seen a considerable increase in network’s traffic and network applications, imposing new requirements on existing network technologies (e.g., low latency and high throughput). Consequently, Internet Service Providers (ISP) are under pressure to ensure the customer’s Quality of Service and fulfill Service Level Agreements. Network operators leverage Traffic Engineering (TE) techniques to efficiently manage the network’s resources. However, WAN’s traffic can drastically change during time and the connectivity can be affected due to external factors (e.g., link failures). Therefore, TE solutions must be able to adapt to dynamic scenarios in real-time. In this paper we propose Enero, an efficient real-time TE solution based on a two-stage optimization process. In the first one, Enero leverages Deep Reinforcement Learning (DRL) to optimize the routing configuration by generating a long-term TE strategy. To enable efficient operation over dynamic network scenarios (e.g., when link failures occur), we integrated a Graph Neural Network into the DRL agent. In the second stage, Enero uses a Local Search algorithm to improve DRL’s solution without adding computational overhead to the optimization process. The experimental results indicate that Enero is able to operate in real-world dynamic network topologies in 4.5 s on average for topologies up to 100 links., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/ 10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A multidisciplinary model to quantify human uncertainty in human-centric cyber-physical-social systems: A 5G application use case

  • Alzate Mejía, Nestor
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Santos Boada, Germán|||0000-0002-9528-2287
  • Almeida Amazonas, José Roberto de
The emerging Human-Centric Networks (HCN) paradigm shifts the passive role of individuals to an active one, intertwining the uncertainty of network resource usage with human dynamics, which are difficult to analyze and predict. This phenomenon implies an increase in reciprocal interactions between Cyber-Physical-Social Systems (CPSS) and human activities, presenting the challenge of efficiently allocating network resources while taking into account qualitative human uncertainty. In this study, we propose a conceptual model that addresses and quantifies such uncertainties. The proposed model is characterized by its adaptability to various CPSS applications, facilitating its integration into existing applications and future innovations. The adaptability of the model is based on the application of the sociological concept of Boundary Objects (BO), which allows for the structuring of system components and the generation of a reference architecture that facilitates systematic problem solving. To evaluate the model, we propose a use case related to a Vehicle for Hire (VFH) application operating within a 5G network slice. The integration of the proposed model with the OMNET++ simulation framework has allowed to demonstrate the effectiveness of the model in intricate computational environments and have shown its capacity to incorporate previously overlooked elements that are essential for the optimal allocation of resources in CPSS. This study proposes a methodology for comprehending and mitigating the consequences of human uncertainty, emphasizing the significance of a multidisciplinary approach to resource allocation in sophisticated technological systems., This work was supported in part by the Spanish I+D+i Project TRAINER-A, funded by Ministerio de Ciencia, Innovación y Universidades (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the aid granted by the Sinfoni Project INV3164 of the Cooperative University of Colombia., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

ePrivo.eu: An online service for automatic web tracking discovery

  • Castell Uroz, Ismael
  • Douha Prieto, Ismael
  • Basart Dotras, Meritxell
  • Mesegué Molina, Pol
  • Barlet Ros, Pere|||0000-0001-7837-0886
Given the pervasiveness of web tracking practices on the Internet, many countries are developing and enforcing new privacy regulations to ensure the rights of their citizens. However, discovering websites that do not comply with those regulations is becoming very challenging, given the dynamic nature of the web or the use of obfuscation techniques. This work presents ePrivo, a new online service that can help Internet users, website owners, and regulators inspect how privacy-friendly a given website is. The system explores all the content of the website, including traffic from third parties and dynamically modified content. The ePrivo service combines different state-of-the-art tracking detection and classification methods, including TrackSign, to discover both previously known and zero-day tracking methods. After 6 months of service, ePrivo detected the largest browsing history trackers and more than 40k domains including cookies with a lifespan longer than one year, which is forbidden in some countries., This work was supported in part by the Spanish I+D+i Project TRAINER-A, funded by MCIN/AEI/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Unveiling the potential of graph neural networks for BGP anomaly detection

  • Latif Martínez, Hamid|||0000-0001-6006-3175
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Yang, Jinze
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
The Border Gateway Protocol (BGP) is central to the global connectivity of the Internet, enabling fast and efficient dissemination of routing information. Hence, detecting any anomaly concerning BGP announcements is of critical importance to ensure the continuous operation of Internet services. Typically, BGP anomaly detection algorithms have relied on features of the BGP messages, such as the average length of the AS_PATH attribute, the volume of messages, or the type of message (announcement or withdrawal). Even though these algorithms provide good performance, they do not take into account the BGP topology, that is, the graph of ASes created by the BGP announcements. In this paper we investigate if such topology can be useful to predict BGP anomalies. We leverage Graph Neural Networks (GNN), a subset of the Neural Network (NN) family that is designed to process graph-structured data. We propose a GNN model to detect BGP anomalies and study its generalization capability. We compare its performance with two baseline models: a Support Vector Machine (SVM) and a Multilayer Perceptron (MLP), two Machine Learning (ML) techniques used in state-of-the-art solutions. Our GNN model achieves an accuracy of 79.6% using a weakly supervised dataset of 300 anomalies and is able to outperform the two baseline models., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Toward deep application-network integration: architectures, progress and opportunities

  • Serracanta Pujol, Berta|||0000-0003-3195-2576
  • Gao, Kai
  • Ros Giralt, Jordi
  • Rodríguez Natal, Alberto
  • Contreras Murillo, Luis Miguel
  • Yang, Richard
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
With the rise of a new generation of applications (e.g., virtual and augmented reality, artificial intelligence, etc.) demanding stringent performance requirements, the need for networking solutions and architectures that can enable a higher quality of experience (QoE) has become increasingly important. While jointly optimizing application and network may increase the applications' QoE and simultaneously improve the utilization of network resources, such a paradigm has had limited success in real production networks. However, with the combination of revolutionary trends in computer processing demands, networking capabilities, and sustainable business models, it is high time the community explores the full potential of deeper integration between application and network. In this tutorial article, recent trends observed over the past few years are systematically reviewed. These include the paradigm shift in modern communication services toward computing-driven applications, such as on-site AI training, advances in programmable network technologies like software defined networking (SDN), and new business models incentivizing collaboration and cooperation between parties. Following this, successful scenarios that benefit from various forms of deeper network-application integration are reported, highlighting their considerable potential. A unified framework is then introduced, providing an overview of possible architecture paradigms for network-application integration and bringing awareness to existing abstractions, mechanisms, tools, and their potential combinations. The article concludes with a discussion of several remaining challenges in building practical network-application integrated systems., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

GAT-AD: Graph Attention Networks for contextual anomaly detection in network monitoring

  • Latif Martínez, Hamid|||0000-0001-6006-3175
  • Suárez Varela, José
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Network anomaly detection is essential to promptly detect and fix issues in the network. Particularly, detecting traffic anomalies enables the early detection of configuration errors, malicious activities, or equipment malfunctions that could lead to severe impact on the network. In this paper, we present GAT-AD, a Deep Learning-based anomaly detection solution for network monitoring systems, which integrates a custom neural network model based on Graph Attention Networks (GAT). Our solution monitors aggregated traffic on origin–destination flows and automatically defines contexts that group flows with similar past activity. The neural network model within GAT-AD can be efficiently trained in a self-supervised manner. We evaluate our solution against two state-of-the-art anomaly detection baselines also based on graph representations and Deep Learning, in two different datasets: (i) WaDi, which is a well-known dataset for anomaly detection in a distributed sensor network, and (ii) Abilene, where we inject synthetically-generated anomalies into a dataset with real-world traffic from a large-scale backbone network. The results show that GAT-AD outperforms the two anomaly detection baselines: in WaDi by 14.1% in recall and 10.07% in F1-score, and in the Abilene dataset by ˜ 17.5% recall with respect to the best baseline., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), Spain. This work was also supported by the CHISTERA grant CHIST-ERA-22-SPiDDS-02 corresponding to the GRAPHS4SEC project (reference no PCI2023-145974-2) funded by the Agencia Estatal de Investigación, Spain through the PCI 2023 call. This work was also supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union – NextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-063000-2021-52). This work was partially supported by the ORIGAMI project, funded by the Smart Networks and Services Joint Undertaking (SNS JU), Spain under the European Union’s Horizon Europe research and innovation programme under Grant Agreement No 101139270., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Detecting and analyzing mouse tracking in the wild

  • Urpí Bricollé, Marcel
  • Castell Uroz, Ismael
  • Barlet Ros, Pere|||0000-0001-7837-0886
Nowadays, most websites collect personal information about their users in order to identify them and personalize their services. Among the tools used to that end, fingerprinting is one of the most advanced and precise methods, given the huge amount of features they can collect and combine to build a robust identifier of the user. Although many fingerprinting techniques have recently been studied in the literature, the use and prevalence of mouse tracking, a method that collects information about the computer pointer, is still unexplored in detail. In this work, we propose a new methodology to detect this tracking method and measure its actual usage on the top 80,000 most popular websites. Our results show that about 1.2% of the analyzed websites use some sort of mouse tracking, including some popular websites within the top-1k ranking., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Demystifying content-blockers: Measuring their impact on performance and quality of experience

  • Castell Uroz, Ismael
  • Sánz García, Rubén
  • Solé Pareta, Josep|||0000-0002-9411-6308
  • Barlet Ros, Pere|||0000-0001-7837-0886
With the evolution of the online advertisement and tracking ecosystem, content-blockers have become the reference tool for improving the security, privacy and browsing experience when surfing the Internet. It is also commonly believed that using content-blockers to stop unsolicited content decreases the time needed for loading websites. In this work, we perform a large-scale study on the actual improvements of using content-blockers in terms of performance and quality of experience. For measuring it, we analyze the page size and loading times of the 100K most popular websites, as well as the most relevant QoE metrics, such as the Speed Index, Time to Interactive or the Cumulative Layout Shift, for the subset of the top 10K of them. Our experiments show that using content-blockers results in small improvements in terms of performance. However, contrary to popular belief, this has a negligible impact in terms of loading time and quality of experience. Moreover, in the case of small and lightweight websites, the overhead introduced by content-blockers can even result in decreased performance. Finally, we evaluate the improvement in terms of QoE based on the Mean Opinion Score (MOS) and find that two of the three studied content-blockers present an overall decrease between 3% and 5% instead of the expected improvement., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Application of linear regression in latency estimation in packet-switched 5G xHaul networks

  • Klinkowski, Miroslaw
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Careglio, Davide|||0000-0002-7931-8147
In this work, we aim at investigating the applicability of machine learning (ML), namely, a linear regression (LR) model for estimation of flows latencies in packet-switched 5G xHaul networks. The analysis is performed in a network scenario in which the switches are connected using high-capacity fiber links., The work was supported by National Science Centre, Poland under Grant No. 2018/31/B/ST7/03456. Moreover, it was also supported by the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case

  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Rusek, Krzysztof
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Deep Reinforcement Learning (DRL) has shown a dramatic improvement in decision-making and automated control problems. Consequently, DRL represents a promising technique to efficiently solve many relevant optimization problems (e.g., routing) in self-driving networks. However, existing DRL-based solutions applied to networking fail to generalize, which means that they are not able to operate properly when applied to network topologies not observed during training. This lack of generalization capability significantly hinders the deployment of DRL technologies in production networks. This is because state-of-the-art DRL-based networking solutions use standard neural networks (e.g., fully connected, convolutional), which are not suited to learn from information structured as graphs. In this paper, we integrate Graph Neural Networks (GNN) into DRL agents and we design a problem specific action space to enable generalization. GNNs are Deep Learning models inherently designed to generalize over graphs of different sizes and structures. This allows the proposed GNN-based DRL agent to learn and generalize over arbitrary network topologies. We test our DRL+GNN agent in a routing optimization use case in optical networks and evaluate it on 180 and 232 unseen synthetic and real-world network topologies respectively. The results show that the DRL+GNN agent is able to outperform state-of-the-art solutions in topologies never seen during training., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501- 100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. This work was also supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University and by the PL-Grid Infrastructure., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Wavelet-enhanced graph neural networks: towards non-parametric network traffic modeling

  • Güemes Palau, Carlos|||0009-0001-8654-0512
  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • López Brescó, Albert|||0009-0005-0611-5516
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Network modeling is crucial for the design, management, and optimization of modern telecommunications and data networks. Recent advancements in Machine Learning (ML), specifically Graph Neural Networks (GNNs), offer promising solutions but rely on parameterized traffic representations, necessitating retraining for new traffic patterns. This paper explores integrating the Discrete Wavelet Transform (DWT) with GNNs to enhance network traffic modeling. By leveraging wavelets, which decompose signals into both time and frequency components, we aim to encode traffic patterns without assuming specific distributions, improving model adaptability and accuracy. We modify the state-of-the-art RouteNet-Fermi model to incorporate wavelet-based traffic encoding and evaluate its performance across different synthetic and real traffic scenarios. Our findings show that wavelet-based encoding handles unseen traffic distributions with minimal impact on performance, unlike traditional parameter-based approaches. This work represents a step forward in bridging the gap between non-parametric traffic representation and advanced network modeling, offering a promising solution for dynamic and complex network environments., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA). Carlos Güemes is funded by the Joan Oró predoctoral program, from the Secretariat for Universities and Research, part of the Ministry of Research and Universities of the Government of Catalonia, and the European Social Fund Plus (ref. BDNS 657443). Jordi Paillisse is funded by NextGen EU, Ministry of Universities and Recovery, Transformation and Resilience Plan, through a call from UPC (Grant Ref. 2022 UPC-MSC-93871)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

MAGNNETO: A graph neural network-based multi-agent system for traffic engineering

  • Bernárdez Gil, Guillermo
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • López Brescó, Albert|||0009-0005-0611-5516
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Current trends in networking propose the use of Machine Learning (ML) for a wide variety of network optimization tasks. As such, many efforts have been made to produce ML-based solutions for Traffic Engineering (TE), which is a fundamental problem in Internet Service Provider (ISP) networks. Nowadays, state-of-the-art TE optimizers rely on traditional optimization techniques, such as Local search, Constraint Programming, or Linear programming. In this paper, we present MAGNNETO, a distributed ML-based framework that leverages Multi-Agent Reinforcement Learning and Graph Neural Networks for distributed TE optimization. MAGNNETO deploys a set of agents across the network that learn and communicate in a distributed fashion via message exchanges between neighboring agents. Particularly, we apply this framework to optimize link weights in Open Shortest Path First (OSPF), with the goal of minimizing network congestion. In our evaluation, we compare MAGNNETO against several state-of-the-art TE optimizers in more than 75 topologies (up to 153 nodes and 354 links), including realistic traffic loads. Our experimental results show that, thanks to its distributed nature, MAGNNETO achieves comparable performance to state-of-the-art TE optimizers with significantly lower execution times. Moreover, our ML-based solution demonstrates a strong generalization capability to successfully operate in new networks unseen during training., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GBC21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of joint controller placement for latency and reliability-aware control plane

  • Rasol, Kurdman Abdulrahman Rasol
  • Domingo Pascual, Jordi|||0000-0001-6277-7542
The separation of the forwarding and control planes in software-defined networking provides flexibility for network management. The Controller Placement Problem (CPP) is an important issue affecting network performance. This paper presents an evaluation of the Joint Latency and Reliability-Aware Controller Placement (LRCP) optimization model. LRCP provides network administrators with flexible choices to simultaneously achieve a trade-off between the switch-To-controller latency and the controller-To-controller latency, including the reliability aspect using alternative backup paths. Control plane latency (CPL) is used as the evaluation metric and it is defined as the sum of average switch-To-controller latency and the average inter-controller latency. For each optimal placement in the network, the control plane latency using the real latencies of the real network topology is computed. Results from the control plane latency metric show how the number and location of controllers influence the reliability of the network. In the event of a single link failure, the real CPL for LRCP placements is computed and assesses how good the LRCP placements are. The CPL metric is used to compare with other models using latency and reliability metrics., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work has been also partially funded by the Spanish Ministry of Economy and Competitiveness, under contract TEC 2017-90034-C2-1-R (ALLIANCE)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Reducing the number of transceivers with probabilistic constellation shaping in flex-grid over MCF optical backbone networks

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Cho, Junho
  • Spadaro, Salvatore|||0000-0002-4100-1726
This paper quantifies the potential reduction in the number of required transceivers that the use of probabilistic constellation shaping (PCS) can bring to Flex-Grid over multicore fiber (MCF) optical backbone networks, which can directly lead to a reduction in network capital expenditure (CAPEX). Results from two different backbone networks illustrate that PCS can significantly decrease the number of required transceivers compared to using traditional modulation formats, thanks to the finer granularity in spectral efficiency. The observed reduction becomes more prominent (up to 22.3%) as the traffic profile bit-rates and the network physical distances increase., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Evaluating the impact of the guard band width on the benefits of probabilistic constellation shaping in future flex-grid over multicore fibre optical backbone networks

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Cho, Junho
  • Spadaro, Salvatore|||0000-0002-4100-1726
Probabilistic constellation shaping (PCS) has emerged as an advanced modulation technique that provides a fine-grained software-defined trade-off between achievable spectral efficiency (SE) and transmission reach to deliver optimal channel capacity at any distance. This paper quantifies the network throughput benefits resulting from adopting PCS in future Flex-Grid over multicore fibre optical backbone networks, compared to using traditional uniform modulation formats. In particular, different inter-channel guard band width configurations are accounted in our study, aiming to set guidelines on the technological requirements imposed to network spectrum selective switches (SSS) to take full PCS advantage in future optical backbone networks., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

RouteNet-Fermi: network modeling with graph neural networks

  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Rusek, Krzysztof
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Network models are an essential block of modern networks. For example, they are widely used in network planning and optimization. However, as networks increase in scale and complexity, some models present limitations, such as the assumption of Markovian traffic in queuing theory models, or the high computational cost of network simulators. Recent advances in machine learning, such as Graph Neural Networks (GNN), are enabling a new generation of network models that are data-driven and can learn complex non-linear behaviors. In this paper, we present RouteNet-Fermi, a custom GNN model that shares the same goals as Queuing Theory, while being considerably more accurate in the presence of realistic traffic models. The proposed model predicts accurately the delay, jitter, and packet loss of a network. We have tested RouteNet-Fermi in networks of increasing size (up to 300 nodes), including samples with mixed traffic profiles — e.g., with complex non-Markovian models — and arbitrary routing and queue scheduling configurations. Our experimental results show that RouteNet-Fermi achieves similar accuracy as computationally-expensive packet-level simulators and scales accurately to larger networks. Our model produces delay estimates with a mean relative error of 6.24% when applied to a test dataset of 1,000 samples, including network topologies one order of magnitude larger than those seen during training. Finally, we have also evaluated RouteNet-Fermi with measurements from a physical testbed and packet traces from a real-life network., This work was supported in part by the Spanish I+D+i Project TRAINER-A funded by the Ministry of Science and Innovation (MCIN)/State Investigation Agency (AEI)/10.13039/501100011033 under Grant PID2020-118011GB-C21, in part by the Catalan Institution for Research and Advanced Studies (ICREA), and in part by the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Early detection of new web tracking methods across 1.5 million sites

  • Castell Uroz, Ismael
  • Sánchez de Mingo, Óscar
  • Barlet Ros, Pere|||0000-0001-7837-0886
Current web tracking practices pose a constant threat to the privacy of Internet users. As a result, the research community has recently proposed different tools to combat well-known tracking methods. However, the early detection of new, previously unseen tracking systems is still an open research problem. In this paper, we present TrackSign+, a novel approach to discovering new web tracking methods. The main idea behind TrackSign+ is the use of code fingerprinting to identify common pieces of code shared across multiple domains. To detect tracking fingerprints, TrackSign+ builds a novel 4-mode network graph that captures the relationship between domains, URLs, online resources, and code fingerprints. We evaluated TrackSign+ with the 1.5M most popular Internet domains, including more than 45M web resources from almost 77M HTTP requests. Our results show that our method can detect new web tracking resources with high precision (over 92%). TrackSign+ was able to detect more than 300k new trackers, 800k new tracking resources, and 4.5M new tracking URLs, not yet detected by most popular pattern lists at the time. Finally, we also validated the effectiveness of TrackSign+ with more than 20 years of historical data from the Internet Archive., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia) ., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Enhancing 5G radio planning with graph representations and deep learning

  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Suárez Varela, José
  • Lutu, Andra
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
The roll out of new mobile network generations poses hard challenges due to various factors such as cost-benefit tradeoffs, existing infrastructure, and new technology aspects. In particular, one of the main challenges for the 5G deployment lies in optimal 5G radio coverage while accounting for diverse service performance metrics. This paper introduces a Deep Learning-based approach to assist in 5G radio planning by utilizing data from previous-generation cells. Our solution relies on a custom graph representation to leverage the information available from existing cells, and employs a Graph Neural Network (GNN) model to process such data efficiently. In our evaluation, we test its potential to model the transition from 4G to 5G NSA using real-world data from a UK mobile network operator. The experimental results show that our solution achieves high accuracy in predicting key performance indicators in new 5G cells, with a Mean Absolute Percentage Error (MAPE) <17% when evaluated on samples from the same area where it was trained. Moreover, we test its generalization capability over various geographical areas not included in the training, achieving a MAPE <19%. This suggests beneficial properties for achieving robust solutions applicable to 5G planning in new areas without the need of retraining., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/ 501100011033. It was also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. The work was also supported by AEON-ZERO (TSI-063000-2021-52) and AEON-CPS (TSI-063000-2021-38), subprojects of AEON coordinated project, funded by the Ministry of Economic Affairs and Digital Transformation and the European UnionNextGenerationEU/PRTR in the UNICO 5G I+D call. Also, it has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Network digital twin: context, enabling technologies, and opportunities

  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Perino, Diego
  • Lopez, Diego
  • Pastor Perales, Antonio Agustín
  • Harvey, Paul
  • Ciavaglia, Laurent
  • Wong, Leon
  • Xiao, Shihan
  • Ram, Vishnu
  • Shi, Xiang
  • Cheng, Xiangle
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
The proliferation of emergent network applications (e.g., telesurgery, metaverse) is increasing the difficulty of managing modern communication networks. These applications entail stringent network requirements (e.g., ultra-low deterministic latency), which hinders network operators to manage their resources efficiently. In this article, we introduce the network digital twin (NDT), a renovated concept of classical network modeling tools whose goal is to build accurate data-driven network models that can operate in real-time. We describe the general architecture of the NDT and argue that modern machine learning (ML) technologies enable building some of its core components. Then, we present a case study that leverages a ML-based NDT for network performance evaluation and apply it to routing optimization in a QoS-aware use case. Lastly, we describe some key open challenges and research opportunities yet to be explored to achieve effective deployment of NDTs in real-world networks., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020- 118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Graph neural networks for communication networks: context, use cases and opportunities

  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Rusek, Krzysztof
  • Geyer, Fabien
  • Cheng, Xiangle
  • Shi, Xiang
  • Xiao, Shihan
  • Scarselli, Franco
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Graph neural networks (GNN) have shown outstanding applications in fields where data is essentially represented as graphs (e.g., chemistry, biology, recommendation systems). In this vein, communication networks comprise many fundamental components that are naturally represented in a graph-structured manner (e.g., topology, routing, signal interference). This position article presents GNNs as a fundamental tool for modeling, control and management of communication networks. GNNs represent a new generation of data-driven models that can accurately learn and reproduce the complex behaviors behind real-world networks. As a result, these models can be applied to a wide variety of networking use cases, such as planning, online optimization, or troubleshooting. The main advantage of GNNs over traditional neural networks lies in their unprecedented generalization capabilities when applied to other networks and configurations unseen during training. This is a critical feature for achieving practical data-driven solutions for networking. This article starts with a brief tutorial on GNNs and some potential applications to communication networks. Then, it presents two state-of-the-art GNN models respectively applied to wired and wireless networks. Lastly, it delves into the key open challenges and opportunities yet to be explored in this novel research area., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Practical spectral efficiency estimation for optical networking

  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Cho, Junho
  • Spadaro, Salvatore|||0000-0002-4100-1726
Assigning the right spectral resources is the key to flex-grid optical networking. Finding the optimal spectral allocation is a daunting task, as there are many variables at play that make accurate network models very complex. From a fiber transmission perspective, several impairments, such as amplified spontaneous emission (ASE) noise from amplifiers or nonlinear interference noise (NLIN) generated through transmission, set a limit on spectral efficiency (SE). From a transceiver perspective, modulation format, signal intensity, and spectral allocation affect the achievable capacity. On top of that, the network conditions are dynamic, causing the channel capacity to change over time. Several models have been proposed to estimate SE, ranging from the simplest to more sophisticated ones. If one is willing to sacrifice a small fraction of accuracy in exchange for a very fast service setup, some bounds can be found to guarantee a static level of service. In this work, we evaluate the degree of inaccuracy introduced by the different strategies and their complexity-accuracy trade-offs., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A one-pass clustering based sketch method for network monitoring

  • Fu, Yongquan
  • An, Lun
  • Shen, Siqi
  • Chen, Kai
  • Barlet Ros, Pere|||0000-0001-7837-0886
Network monitoring solutions need to cope with increasing network traffic volumes, as a result, sketch-based monitoring methods have been extensively studied to trade accuracy for memory scalability and storage reduction. However, sketches are sensitive to skewness in network flow distributions due to hash collisions, and need complicated performance optimization to adapt to line-rate packet streams. We provide Jellyfish, an efficient sketch method that performs one-pass clustering over the network stream. One-pass clustering is realized by adapting the monitoring granularity from the whole network flow to fragments called subflows, which not only reduces the ingestion rate but also provides an efficient intermediate representation for the input to the sketch. Jellyfish provides the network-flow level query interface by reconstructing the network-flow level counters by merging subflow records from the same network flow. We provide probabilistic analysis of the expected accuracy of both existing sketch methods and Jellyfish. Real-world trace-driven experiments show that Jellyfish reduces the average estimation errors by up to six orders of magnitude for per-flow queries, by six orders of magnitude for entropy queries, and up to ten times for heavy-hitter queries., This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61972409; in part by Hong Kong Research Grants Council (RGC) under Grant TRS T41-603/20-R, Grant GRF-16213621, and Grant ITF ACCESS; in part by the Spanish I+D+i project TRAINER-A, funded by MCIN/AEI/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Verification of performance degradation in a telecommunications system due to the uncertainty of human users in the loop

  • Alzate Mejía, Nestor
  • Santos Boada, Germán|||0000-0002-9528-2287
  • Almeida Amazonas, José Roberto de
The intensive use of new technologies that cause more interactions between systems and the daily activities of human users is changing the focus on how network re- sources should be managed. However, these changes can create challenges related to the level of uncertainty that people introduce to the system. In this context, this research study seeks to determine whether people’s uncertainty influences network performance and how significant its impact is. For these purposes, a simulated case study of a Vehicle for Hire application designed to run over a network slicing of a fifth-generation (5G) network. The simulations compared call drop rates in several settings configured to represent different levels of uncertainty, introducing random alterations to free channel planning reserved for the handover process. The simulation results reveal that the uncertainty specifically introduced by people exerts a high negative impact on network performance, evidencing the need to develop an algorithm that considers this uncertainty when managing resources within the 5G network core., This work has been supported by the Spanish Government through project TRAINER-A (PID2020-118011GB-C21) with FEDER contribution. Moreover, it has been supported by the Spanish Thematic Network under contract RED2018-102585-T (Go2Edge) and by the aid granted by the Sinfoni project INV2733 of the Cooperative University of Colombia., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

ML-enabled flow admission control policy for proactive QoS assurance in programmable RINA networks

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Solé Pareta, Josep|||0000-0002-9411-6308
  • Careglio, Davide|||0000-0002-7931-8147
In this paper, we investigate the deployment and performance benefits of a machine learning (ML)-enabled flow admission control policy for programmable networks following the clean slate Recursive InterNetwork Architecture (RINA) design principles. The proposed flow admission control policy is based on RouteNet, a cutting-edge Graph Neural Network (GNN) able to accurately predict per-path packet loss, delay and jitter metrics. Upon arrival of a new flow request, RouteNet can accurately estimate the Quality of Service (QoS) metrics experienced by all active traffic flows if the new incoming one is established in the network. In this way, incoming flow requests are accepted only when the QoS levels of all traffic flows are satisfied appropriately. Throughout the paper, we illustrate our envisioned ML-enabled QoS-aware RINA network scenario, while also disclosing initial proof-of-concept experimental results using the publicly available IRATI RINA prototype., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Building a Digital Twin for network optimization using graph neural networks

  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Network modeling is a critical component of Quality of Service (QoS) optimization. Current networks implement Service Level Agreements (SLA) by careful configuration of both routing and queue scheduling policies. However, existing modeling techniques are not able to produce accurate estimates of relevant SLA metrics, such as delay or jitter, in networks with complex QoS-aware queueing policies (e.g., strict priority, Weighted Fair Queueing, Deficit Round Robin). Recently, Graph Neural Networks (GNNs) have become a powerful tool to model networks since they are specifically designed to work with graph-structured data. In this paper, we propose a GNN-based network model able to understand the complex relationship between the queueing policy (scheduling algorithm and queue sizes), the network topology, the routing configuration, and the input traffic matrix. We call our model TwinNet, a Digital Twin that can accurately estimate relevant SLA metrics for network optimization. TwinNet can generalize to its input parameters, operating successfully in topologies, routing, and queueing configurations never seen during training. We evaluate TwinNet over a wide variety of scenarios with synthetic traffic and validate it with real traffic traces. Our results show that TwinNet can provide accurate estimates of end-to-end path delays in 106 unseen real-world topologies, under different queuing configurations with a Mean Absolute Percentage Error (MAPE) of 3.8%, as well as a MAPE of 6.3% error when evaluated with a real testbed. We also showcase the potential of the proposed model for SLA-driven network optimization and what-if analysis., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/, Spain10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), Spain and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, Spain and the European Social Fund., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

FlowDT: A Flow-aware Digital Twin for computer networks

  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Cheng, Xiangle
  • Shi, Xiang
  • Xiao, Shihan
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Network modeling is an essential tool for network planning and management. It allows network administrators to explore the performance of new protocols, mechanisms, or optimal configurations without the need for testing them in real production networks. Recently, Graph Neural Networks (GNNs) have emerged as a practical solution to produce network models that can learn and extract complex patterns from real data without making any assumptions. However, state-of-the-art GNN-based network models only work with traffic matrices, this is a very coarse and simplified representation of network traffic. Although this assumption has shown to work well in certain use-cases, it is a limiting factor because, in practice, networks operate with flows. In this paper, we present FlowDT a new DL-based solution designed to model computer networks at the fine-grained flow level. In our evaluation, we show how FlowDT can accurately predict relevant per-flow performance metrics with an error of 3.5%, FlowDT’s performance is also benchmarked against vanilla DL models as well as with Queuing Theory., This work has been supported by the Spanish Government through project TRAINER-A (PID2020-118011GB-C21) with FEDER contribution and the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Graphene-based wireless agile interconnects for massive heterogeneous multi-chip processors

  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Guirado Liñan, Robert
  • Taghvaee, Hamidreza|||0000-0001-8732-6086
  • Jain, Akshay|||0000-0002-6986-2720
  • de Santana, Elana Pereira
  • Bolívar, Peter Haring
  • Saeed, Mohamed
  • Negra, Renato
  • Wang, Zhenxing
  • Wang, Kun-Ta
The main design principles in computer architecture have recently shifted from a monolithic scaling-driven approach to the development of heterogeneous architectures that tightly co-integrate multiple specialized processor and memory chiplets. In such data-hungry multi-chip architectures, current Networks-in-Package (NiPs) may not be enough to cater to their heterogeneous and fast-changing communication demands. This position article makes the case for wireless in-package networking as the enabler of efficient and versatile wired-wireless interconnect fabrics for massive heterogeneous processors. To that end, the use of graphene-based antennas and transceivers with unique frequency-beam reconfigurability in the terahertz band is proposed. The feasibility of such a wireless vision and the main research challenges toward its realization are analyzed from the technological, communications, and computer architecture perspectives., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work has been also supported by the European Commission under H2020 grants WiPLASH (GA 863337), 2D-EPL (GA 952792), and Graphene Flagship (GA 881603); the FLAGERA framework under grant TUGRACO (HA 3022/9-1, LE 2440/3-1), the European Research Council under grants WINC (GA 101042080), COMPUSAPIEN (GA 725657), and PROJESTOR (GA 682675), the German Ministry of Education and Research under grant GIMMIK (03XP0210) and the and the German Research Foundation under grant HIPEDI (WA 4139/1-1)., Peer Reviewed, Article signat per 21 autors/es: Sergi Abadal, Robert Guirado, Hamidreza Taghvaee, and Akshay Jain are with the Universitat Politècnica de Catalunya, Spain; Elana Pereira de Santana and Peter Haring Bolívar are with the University of Siegen, Germany; Mohamed Saeed, Renato Negra, Kun-Ta Wang, and Max C. Lemme are with RWTH Aachen University, Germany. Zhenxing Wang, Kun-Ta Wang, and Max C. Lemme are also with AMO GmbH, Germany; Joshua Klein, Marina Zapater, Alexandre Levisse, and David Atienza are with the Swiss Federal Institute of Technology, Switzerland. Marina Zapater is also with the University of Applied Sciences and Arts Western Switzerland; Davide Rossi and Francesco Conti are with the University of Bologna,Italy; Martino Dazzi, Geethan Karunaratne, Irem Boybat, and Abu Sebastian are with IBM Research Europe, Switzerland
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

QAM order selection strategy for energy-efficient probabilistic constellation shaping in flex-grid over multicore fiber optical backbone networks

  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Cho, Junho
  • Spadaro, Salvatore|||0000-0002-4100-1726
Probabilistic constellation shaping (PCS) has become an attractive technology for future optical networks, able to close the gap to channel capacity at any distance by leveraging its superior fine-grained rate adaptability. In order to get as close as possible to the Shannon limit, PCS selects for any signal-to-noise ratio (SNR) the best performing (square) quadrature amplitude modulation (QAM) constellation and forward error correction (FEC) coding rate. However, higher-order QAM constellations are expected to consume more energy per transmitted bit than lower-order ones. So, we investigate in this paper whether carefully dimensioned SNR margins can lower the usage of higher order QAM constellations for end-to-end optical communications in Flex-Grid over multicore fiber (MCF) optical backbone networks, while still keeping high PCS performance levels. Numerical results obtained in two reference backbone networks disclose very significant reductions on the usage of those higher order QAM constellations when adopting the proposed SNR margins for PCS, at expenses of only minor penalties on the spectral efficiency attainable along the precomputed end-to-end paths., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B, with references PID2020-118011GB-C21 and PID2020-118011GB-C22, funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Real-time generation of 3-dimensional representations of static objects using small unmanned aerial vehicles

  • Talarn Bell-lloch, Pau
  • Ollé Ferrayuoli, Bernat
  • Lemic, Filip
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Costa Pérez, Xavier
Recent advances in robotics and nanotechnology resulted in a set of miniaturized Unmanned Aerial Vehicles (UAVs). Such small UAVs are envisioned to operate in hard-to-reach areas for enabling applications such as structural monitoring or content capturing. Towards showcasing this vision, we demonstrate a small UAV-supported setup for real-time autonomous generation of 3-Dimensional (3D) representations of static objects. In the setup, a small UAV (i.e., CrazyFlie 2.1) is envisioned to visit a set of locations, acting as a carrier and power source of a camera sensor. At each location, the sensor is expected to take a picture of the object and report it to the station. The station implements a pipeline for 3D reconstruction based on the pictures taken by the UAV., This work was funded by the MCIN/AEI/10.13039/01100011033/ FEDER/EU HoloMit 2.0 (PID2021-126551OB-C21) and MCIN/AEI/ 10.13039/501100011033 TRAINER-A (PID2020-118011GB-C21)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

GraphCC: a practical graph learning-based approach to congestion control in datacenters

  • Bernárdez Gil, Guillermo
  • Suárez Varela, José
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Congestion Control (CC) plays a fundamental role in optimizing traffic in Datacenter Networks (DCNs). Currently, DCNs implement two main CC protocols: DCTCP and DCQCN. Both protocols are based on Explicit Congestion Notification (ECN), where switches mark packets when they detect congestion. Nowadays, network experts carefully set ECN parameters to optimize the average network performance. However, today’s DCNs experience rapid and abrupt changes that severely affect the network state (e.g., dynamic workloads, incasts), which leads to under-utilization and sub-optimal performance. In this paper we present GraphCC, a framework for in-network CC optimization. GraphCC relies on Multi-agent Reinforcement Learning (MARL) and Graph Neural Networks (GNN), and is compatible with widely deployed ECN-based CC protocols. The proposed solution deploys distributed agents on switches that communicate with their neighbors to cooperate and optimize the global ECN configuration. In our evaluation, we test GraphCC with three real-world traffic workloads, focusing on its capability to accommodate scenarios unseen during training (e.g., traffic changes, failures). We compare GraphCC with a state-of-the-art MARL solution for ECN tuning, and observe that our method outperforms the state-of-the-art baseline in all evaluation scenarios, with improvements up to 20% in average Flow Completion Time, similar mean throughput (within 1%), and significant reductions in buffer occupancy (38.0-85.7%)., This publication is part of the Spanish I+D+i project TRAINER-A (reference PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/ 501100011033, and the research has been partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, and the European Social Fund. This work is also partially supported by the ORIGAMI project, funded by the Smart Networks and Services Joint Undertaking (SNS JU) under the European Union’s Horizon Europe research and innovation programme under Grant Agreement No 101139270, as well as by the CHISTERA grant CHIST-ERA-22-SPiDDS-02 corresponding to the GRAPHS4SEC project (reference PCI2023-145974-2), funded by the Agencia Estatal de Investigación through the PCI 2023 call., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Graphene-based wireless agile interconnects for massive heterogeneous multi-chip processors

  • Abadal Cavallé, Sergi
  • Guirado Liñan, Robert
  • Taghvaee, Hamidreza
  • Jain, Akshay
  • de Santana, Elana Pereira
  • Bolívar, Peter Haring
  • Saeed, Mohamed
  • Negra, Renato
  • Wang, Zhenxing
  • Wang, Kun-Ta
The main design principles in computer architecture have recently shifted from a monolithic scaling-driven approach to the development of heterogeneous architectures that tightly co-integrate multiple specialized processor and memory chiplets. In such data-hungry multi-chip architectures, current Networks-in-Package (NiPs) may not be enough to cater to their heterogeneous and fast-changing communication demands. This position article makes the case for wireless in-package networking as the enabler of efficient and versatile wired-wireless interconnect fabrics for massive heterogeneous processors. To that end, the use of graphene-based antennas and transceivers with unique frequency-beam reconfigurability in the terahertz band is proposed. The feasibility of such a wireless vision and the main research challenges toward its realization are analyzed from the technological, communications, and computer architecture perspectives., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work has been also supported by the European Commission under H2020 grants WiPLASH (GA 863337), 2D-EPL (GA 952792), and Graphene Flagship (GA 881603); the FLAGERA framework under grant TUGRACO (HA 3022/9-1, LE 2440/3-1), the European Research Council under grants WINC (GA 101042080), COMPUSAPIEN (GA 725657), and PROJESTOR (GA 682675), the German Ministry of Education and Research under grant GIMMIK (03XP0210) and the and the German Research Foundation under grant HIPEDI (WA 4139/1-1)., Peer Reviewed, Article signat per 21 autors/es: Sergi Abadal, Robert Guirado, Hamidreza Taghvaee, and Akshay Jain are with the Universitat Politècnica de Catalunya, Spain; Elana Pereira de Santana and Peter Haring Bolívar are with the University of Siegen, Germany; Mohamed Saeed, Renato Negra, Kun-Ta Wang, and Max C. Lemme are with RWTH Aachen University, Germany. Zhenxing Wang, Kun-Ta Wang, and Max C. Lemme are also with AMO GmbH, Germany; Joshua Klein, Marina Zapater, Alexandre Levisse, and David Atienza are with the Swiss Federal Institute of Technology, Switzerland. Marina Zapater is also with the University of Applied Sciences and Arts Western Switzerland; Davide Rossi and Francesco Conti are with the University of Bologna,Italy; Martino Dazzi, Geethan Karunaratne, Irem Boybat, and Abu Sebastian are with IBM Research Europe, Switzerland, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Fast traffic engineering by gradient descent with learned differentiable routing

  • Rusek, Krzysztof
  • Almasan Puscas, Felician Paul
  • Suárez-Varela Maciá, José Rafael
  • Cholda, Piotr
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Emerging applications such as the metaverse, telesurgery or cloud computing require increasingly complex operational demands on networks (e.g., ultra-reliable low latency). Likewise, the ever-faster traffic dynamics will demand network control mechanisms that can operate at short timescales (e.g., sub-minute). In this context, Traffic Engineering (TE) is a key component to efficiently control network traffic according to some performance goals (e.g., minimize network congestion).This paper presents Routing By Backprop (RBB), a novel TE method based on Graph Neural Networks (GNN) and differentiable programming. Thanks to its internal GNN model, RBB builds an end-to-end differentiable function of the target TE problem (MinMaxLoad). This enables fast TE optimization via gradient descent. In our evaluation, we show the potential of RBB to optimize OSPF-based routing (˜25% of improvement with respect to default OSPF configurations). Moreover, we test the potential of RBB as an initializer of computationally-intensive TE solvers. The experimental results show promising prospects for accelerating this type of solvers and achieving efficient online TE optimization., This work was supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University and by the PL-Grid Infrastructure. Also, this publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Graph neural networks for communication networks: context, use cases and opportunities

  • Suárez-Varela Maciá, José Rafael
  • Almasan Puscas, Felician Paul
  • Ferriol Galmés, Miquel
  • Rusek, Krzysztof
  • Geyer, Fabien
  • Cheng, Xiangle
  • Shi, Xiang
  • Xiao, Shihan
  • Scarselli, Franco
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Graph neural networks (GNN) have shown outstanding applications in fields where data is essentially represented as graphs (e.g., chemistry, biology, recommendation systems). In this vein, communication networks comprise many fundamental components that are naturally represented in a graph-structured manner (e.g., topology, routing, signal interference). This position article presents GNNs as a fundamental tool for modeling, control and management of communication networks. GNNs represent a new generation of data-driven models that can accurately learn and reproduce the complex behaviors behind real-world networks. As a result, these models can be applied to a wide variety of networking use cases, such as planning, online optimization, or troubleshooting. The main advantage of GNNs over traditional neural networks lies in their unprecedented generalization capabilities when applied to other networks and configurations unseen during training. This is a critical feature for achieving practical data-driven solutions for networking. This article starts with a brief tutorial on GNNs and some potential applications to communication networks. Then, it presents two state-of-the-art GNN models respectively applied to wired and wireless networks. Lastly, it delves into the key open challenges and opportunities yet to be explored in this novel research area., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

ML-enabled flow admission control policy for proactive QoS assurance in programmable RINA networks

  • Perelló Muntan, Jordi
  • Solé Pareta, Josep
  • Careglio, Davide
In this paper, we investigate the deployment and performance benefits of a machine learning (ML)-enabled flow admission control policy for programmable networks following the clean slate Recursive InterNetwork Architecture (RINA) design principles. The proposed flow admission control policy is based on RouteNet, a cutting-edge Graph Neural Network (GNN) able to accurately predict per-path packet loss, delay and jitter metrics. Upon arrival of a new flow request, RouteNet can accurately estimate the Quality of Service (QoS) metrics experienced by all active traffic flows if the new incoming one is established in the network. In this way, incoming flow requests are accepted only when the QoS levels of all traffic flows are satisfied appropriately. Throughout the paper, we illustrate our envisioned ML-enabled QoS-aware RINA network scenario, while also disclosing initial proof-of-concept experimental results using the publicly available IRATI RINA prototype., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Flow optimization at inter-datacenter networks for application run-time acceleration

  • Serracanta Pujol, Berta
  • Rodríguez Natal, Alberto
  • Maino, Fabio
  • Cabellos Aparicio, Alberto
In the present-day, distributed applications are commonly spread across multiple datacenters, reaching out to edge and fog computing locations. The transition away from single datacenter hosting is driven by capacity constraints in datacenters and the adoption of hybrid deployment strategies, combining on-premise and public cloud facilities. However, the performance of such applications is often limited by extended Flow Completion Times (FCT) for short flows due to queuing behind bursts of packets from concurrent long flows. To address this challenge, we propose a solution to prioritize short flows over long flows in the Software-Defined Wide-Area Network (SD-WAN) interconnecting the distributed computing platforms. Our solution utilizes eBPF to segregate short and long flows, transmitting them over separate tunnels with the same properties. By effectively mitigating queuing delays, we consistently achieve a 1.5 times reduction in FCT for short flows, resulting in improved application response times. The proposed solution works with encrypted traffic and is application-agnostic, making it deployable in diverse distributed environments without modifying the applications themselves. Our testbed evaluation demonstrates the effectiveness of our approach in accelerating the run-time of distributed applications, providing valuable insights for optimizing multi-datacenter and edge deployments., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Accelerating deep reinforcement learning for digital twin network optimization with evolutionary strategies

  • Güemes Palau, Carlos
  • Almasan Puscas, Felician Paul
  • Xiao, Shihan
  • Cheng, Xiangle
  • Shi, Xiang
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
The recent growth of emergent network applications (e.g., satellite networks, vehicular networks) is increasing the complexity of managing modern communication networks. As a result, the community proposed the Digital Twin Networks (DTN) as a key enabler of efficient network management. Network operators can leverage the DTN to perform different optimization tasks (e.g., Traffic Engineering, Network Planning).Deep Reinforcement Learning (DRL) showed a high performance when applied to solve network optimization problems. In the context of DTN, DRL can be leveraged to solve optimization problems without directly impacting the real-world network behavior. However, DRL scales poorly with the problem size and complexity. In this paper, we explore the use of Evolutionary Strategies (ES) to train DRL agents for solving a routing optimization problem. The experimental results show that ES achieved a training time speed-up of 128 and 6 for the NSFNET and GEANT2 topologies respectively., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Unveiling the potential of graph neural networks for BGP anomaly detection

  • Latif Martínez, Hamid
  • Paillissé Vilanova, Jordi
  • Yang, Jinze
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
The Border Gateway Protocol (BGP) is central to the global connectivity of the Internet, enabling fast and efficient dissemination of routing information. Hence, detecting any anomaly concerning BGP announcements is of critical importance to ensure the continuous operation of Internet services. Typically, BGP anomaly detection algorithms have relied on features of the BGP messages, such as the average length of the AS_PATH attribute, the volume of messages, or the type of message (announcement or withdrawal). Even though these algorithms provide good performance, they do not take into account the BGP topology, that is, the graph of ASes created by the BGP announcements. In this paper we investigate if such topology can be useful to predict BGP anomalies. We leverage Graph Neural Networks (GNN), a subset of the Neural Network (NN) family that is designed to process graph-structured data. We propose a GNN model to detect BGP anomalies and study its generalization capability. We compare its performance with two baseline models: a Support Vector Machine (SVM) and a Multilayer Perceptron (MLP), two Machine Learning (ML) techniques used in state-of-the-art solutions. Our GNN model achieves an accuracy of 79.6% using a weakly supervised dataset of 300 anomalies and is able to outperform the two baseline models., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Wavelet-enhanced graph neural networks: towards non-parametric network traffic modeling

  • Güemes Palau, Carlos
  • Ferriol Galmés, Miquel
  • Paillissé Vilanova, Jordi
  • López Brescó, Albert
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Network modeling is crucial for the design, management, and optimization of modern telecommunications and data networks. Recent advancements in Machine Learning (ML), specifically Graph Neural Networks (GNNs), offer promising solutions but rely on parameterized traffic representations, necessitating retraining for new traffic patterns. This paper explores integrating the Discrete Wavelet Transform (DWT) with GNNs to enhance network traffic modeling. By leveraging wavelets, which decompose signals into both time and frequency components, we aim to encode traffic patterns without assuming specific distributions, improving model adaptability and accuracy. We modify the state-of-the-art RouteNet-Fermi model to incorporate wavelet-based traffic encoding and evaluate its performance across different synthetic and real traffic scenarios. Our findings show that wavelet-based encoding handles unseen traffic distributions with minimal impact on performance, unlike traditional parameter-based approaches. This work represents a step forward in bridging the gap between non-parametric traffic representation and advanced network modeling, offering a promising solution for dynamic and complex network environments., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA). Carlos Güemes is funded by the Joan Oró predoctoral program, from the Secretariat for Universities and Research, part of the Ministry of Research and Universities of the Government of Catalonia, and the European Social Fund Plus (ref. BDNS 657443). Jordi Paillisse is funded by NextGen EU, Ministry of Universities and Recovery, Transformation and Resilience Plan, through a call from UPC (Grant Ref. 2022 UPC-MSC-93871)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case

  • Almasan Puscas, Felician Paul
  • Suárez-Varela Maciá, José Rafael
  • Rusek, Krzysztof
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Deep Reinforcement Learning (DRL) has shown a dramatic improvement in decision-making and automated control problems. Consequently, DRL represents a promising technique to efficiently solve many relevant optimization problems (e.g., routing) in self-driving networks. However, existing DRL-based solutions applied to networking fail to generalize, which means that they are not able to operate properly when applied to network topologies not observed during training. This lack of generalization capability significantly hinders the deployment of DRL technologies in production networks. This is because state-of-the-art DRL-based networking solutions use standard neural networks (e.g., fully connected, convolutional), which are not suited to learn from information structured as graphs. In this paper, we integrate Graph Neural Networks (GNN) into DRL agents and we design a problem specific action space to enable generalization. GNNs are Deep Learning models inherently designed to generalize over graphs of different sizes and structures. This allows the proposed GNN-based DRL agent to learn and generalize over arbitrary network topologies. We test our DRL+GNN agent in a routing optimization use case in optical networks and evaluate it on 180 and 232 unseen synthetic and real-world network topologies respectively. The results show that the DRL+GNN agent is able to outperform state-of-the-art solutions in topologies never seen during training., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501- 100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. This work was also supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University and by the PL-Grid Infrastructure., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

TrackSign-labeled web tracking dataset

  • Castell Uroz, Ismael
  • Barlet Ros, Pere
Recent studies show that more than 95% of the websites available on the Internet contain at least one of the so-called web tracking systems. These systems are specialized in identifying their users by means of a plethora of different methods. Some of them (e.g., cookies) are very well known by most Internet users. However, the percentage of websites including more "obscure" and privacy-threatening systems, such as fingerprinting methods identifying a user's computer, is constantly increasing. Detecting those methods on today's Internet is very difficult, as almost any website modifies its content dynamically and minimizes its code in order to speed up loading times. This minimization and dynamicity render the website code unreadable by humans. Thus, the research community is constantly looking for new ways to discover unknown web tracking systems running under the hood. In this paper, we present a new dataset containing tracking information for more than 76 million URLs and 45 million online resources, extracted from 1.5 million popular websites. The tracking labeling process was done using a state-of-the-art discovery web tracking algorithm called TrackSign. The dataset also contains information about online security and the relation between the domains, the loaded URLs, and the online resource behind each URL. This information can be useful for different kinds of experiments, such as locating privacy-threatening resources, identifying security threats, or determining characteristics of the URL network graph., This publication is part of the Spanish I+D+i project TRAINER-A (ref.∼PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Enhancing 5G radio planning with graph representations and deep learning

  • Almasan Puscas, Felician Paul
  • Suárez Varela, José
  • Lutu, Andra
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
The roll out of new mobile network generations poses hard challenges due to various factors such as cost-benefit tradeoffs, existing infrastructure, and new technology aspects. In particular, one of the main challenges for the 5G deployment lies in optimal 5G radio coverage while accounting for diverse service performance metrics. This paper introduces a Deep Learning-based approach to assist in 5G radio planning by utilizing data from previous-generation cells. Our solution relies on a custom graph representation to leverage the information available from existing cells, and employs a Graph Neural Network (GNN) model to process such data efficiently. In our evaluation, we test its potential to model the transition from 4G to 5G NSA using real-world data from a UK mobile network operator. The experimental results show that our solution achieves high accuracy in predicting key performance indicators in new 5G cells, with a Mean Absolute Percentage Error (MAPE) <17% when evaluated on samples from the same area where it was trained. Moreover, we test its generalization capability over various geographical areas not included in the training, achieving a MAPE <19%. This suggests beneficial properties for achieving robust solutions applicable to 5G planning in new areas without the need of retraining., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/ 501100011033. It was also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. The work was also supported by AEON-ZERO (TSI-063000-2021-52) and AEON-CPS (TSI-063000-2021-38), subprojects of AEON coordinated project, funded by the Ministry of Economic Affairs and Digital Transformation and the European UnionNextGenerationEU/PRTR in the UNICO 5G I+D call. Also, it has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Application of linear regression in latency estimation in packet-switched 5G xHaul networks

  • Klinkowski, Miroslaw
  • Perelló Muntan, Jordi
  • Careglio, Davide
In this work, we aim at investigating the applicability of machine learning (ML), namely, a linear regression (LR) model for estimation of flows latencies in packet-switched 5G xHaul networks. The analysis is performed in a network scenario in which the switches are connected using high-capacity fiber links., The work was supported by National Science Centre, Poland under Grant No. 2018/31/B/ST7/03456. Moreover, it was also supported by the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Evaluation of joint controller placement for latency and reliability-aware control plane

  • Rasol, Kurdman Abdulrahman Rasol
  • Domingo Pascual, Jordi
The separation of the forwarding and control planes in software-defined networking provides flexibility for network management. The Controller Placement Problem (CPP) is an important issue affecting network performance. This paper presents an evaluation of the Joint Latency and Reliability-Aware Controller Placement (LRCP) optimization model. LRCP provides network administrators with flexible choices to simultaneously achieve a trade-off between the switch-To-controller latency and the controller-To-controller latency, including the reliability aspect using alternative backup paths. Control plane latency (CPL) is used as the evaluation metric and it is defined as the sum of average switch-To-controller latency and the average inter-controller latency. For each optimal placement in the network, the control plane latency using the real latencies of the real network topology is computed. Results from the control plane latency metric show how the number and location of controllers influence the reliability of the network. In the event of a single link failure, the real CPL for LRCP placements is computed and assesses how good the LRCP placements are. The CPL metric is used to compare with other models using latency and reliability metrics., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work has been also partially funded by the Spanish Ministry of Economy and Competitiveness, under contract TEC 2017-90034-C2-1-R (ALLIANCE)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

RouteNet-Erlang: A graph neural network for network performance evaluation

  • Ferriol Galmés, Miquel
  • Rusek, Krzysztof
  • Suárez-Varela Maciá, José Rafael
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Wu, Bo
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Network modeling is a fundamental tool in network research, design, and operation. Arguably the most popular method for modeling is Queuing Theory (QT). Its main limitation is that it imposes strong assumptions on the packet arrival process, which typically do not hold in real networks. In the field of Deep Learning, Graph Neural Networks (GNN) have emerged as a new technique to build data-driven models that can learn complex and non-linear behavior. In this paper, we present RouteNet-Erlang, a pioneering GNN architecture designed to model computer networks. RouteNet-Erlang supports complex traffic models, multi-queue scheduling policies, routing policies and can provide accurate estimates in networks not seen in the training phase. We benchmark RouteNet-Erlang against a state-of-the-art QT model, and our results show that it outperforms QT in all the network scenarios., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Practical spectral efficiency estimation for optical networking

  • Gené Bernaus, Joan M.
  • Perelló Muntan, Jordi
  • Cho, Junho
  • Spadaro, Salvatore
Assigning the right spectral resources is the key to flex-grid optical networking. Finding the optimal spectral allocation is a daunting task, as there are many variables at play that make accurate network models very complex. From a fiber transmission perspective, several impairments, such as amplified spontaneous emission (ASE) noise from amplifiers or nonlinear interference noise (NLIN) generated through transmission, set a limit on spectral efficiency (SE). From a transceiver perspective, modulation format, signal intensity, and spectral allocation affect the achievable capacity. On top of that, the network conditions are dynamic, causing the channel capacity to change over time. Several models have been proposed to estimate SE, ranging from the simplest to more sophisticated ones. If one is willing to sacrifice a small fraction of accuracy in exchange for a very fast service setup, some bounds can be found to guarantee a static level of service. In this work, we evaluate the degree of inaccuracy introduced by the different strategies and their complexity-accuracy trade-offs., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

ePrivo.eu: An online service for automatic web tracking discovery

  • Castell Uroz, Ismael
  • Douha Prieto, Ismael
  • Basart Dotras, Meritxell
  • Mesegué Molina, Pol
  • Barlet Ros, Pere
Given the pervasiveness of web tracking practices on the Internet, many countries are developing and enforcing new privacy regulations to ensure the rights of their citizens. However, discovering websites that do not comply with those regulations is becoming very challenging, given the dynamic nature of the web or the use of obfuscation techniques. This work presents ePrivo, a new online service that can help Internet users, website owners, and regulators inspect how privacy-friendly a given website is. The system explores all the content of the website, including traffic from third parties and dynamically modified content. The ePrivo service combines different state-of-the-art tracking detection and classification methods, including TrackSign, to discover both previously known and zero-day tracking methods. After 6 months of service, ePrivo detected the largest browsing history trackers and more than 40k domains including cookies with a lifespan longer than one year, which is forbidden in some countries., This work was supported in part by the Spanish I+D+i Project TRAINER-A, funded by MCIN/AEI/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

QAM order selection strategy for energy-efficient probabilistic constellation shaping in flex-grid over multicore fiber optical backbone networks

  • Perelló Muntan, Jordi
  • Gené Bernaus, Joan M.
  • Cho, Junho
  • Spadaro, Salvatore
Probabilistic constellation shaping (PCS) has become an attractive technology for future optical networks, able to close the gap to channel capacity at any distance by leveraging its superior fine-grained rate adaptability. In order to get as close as possible to the Shannon limit, PCS selects for any signal-to-noise ratio (SNR) the best performing (square) quadrature amplitude modulation (QAM) constellation and forward error correction (FEC) coding rate. However, higher-order QAM constellations are expected to consume more energy per transmitted bit than lower-order ones. So, we investigate in this paper whether carefully dimensioned SNR margins can lower the usage of higher order QAM constellations for end-to-end optical communications in Flex-Grid over multicore fiber (MCF) optical backbone networks, while still keeping high PCS performance levels. Numerical results obtained in two reference backbone networks disclose very significant reductions on the usage of those higher order QAM constellations when adopting the proposed SNR margins for PCS, at expenses of only minor penalties on the spectral efficiency attainable along the precomputed end-to-end paths., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B, with references PID2020-118011GB-C21 and PID2020-118011GB-C22, funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

GAT-AD: Graph Attention Networks for contextual anomaly detection in network monitoring

  • Latif Martínez, Hamid
  • Suárez Varela, José
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Network anomaly detection is essential to promptly detect and fix issues in the network. Particularly, detecting traffic anomalies enables the early detection of configuration errors, malicious activities, or equipment malfunctions that could lead to severe impact on the network. In this paper, we present GAT-AD, a Deep Learning-based anomaly detection solution for network monitoring systems, which integrates a custom neural network model based on Graph Attention Networks (GAT). Our solution monitors aggregated traffic on origin–destination flows and automatically defines contexts that group flows with similar past activity. The neural network model within GAT-AD can be efficiently trained in a self-supervised manner. We evaluate our solution against two state-of-the-art anomaly detection baselines also based on graph representations and Deep Learning, in two different datasets: (i) WaDi, which is a well-known dataset for anomaly detection in a distributed sensor network, and (ii) Abilene, where we inject synthetically-generated anomalies into a dataset with real-world traffic from a large-scale backbone network. The results show that GAT-AD outperforms the two anomaly detection baselines: in WaDi by 14.1% in recall and 10.07% in F1-score, and in the Abilene dataset by ˜ 17.5% recall with respect to the best baseline., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), Spain. This work was also supported by the CHISTERA grant CHIST-ERA-22-SPiDDS-02 corresponding to the GRAPHS4SEC project (reference no PCI2023-145974-2) funded by the Agencia Estatal de Investigación, Spain through the PCI 2023 call. This work was also supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union – NextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-063000-2021-52). This work was partially supported by the ORIGAMI project, funded by the Smart Networks and Services Joint Undertaking (SNS JU), Spain under the European Union’s Horizon Europe research and innovation programme under Grant Agreement No 101139270., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Demystifying content-blockers: Measuring their impact on performance and quality of experience

  • Castell Uroz, Ismael
  • Sánz García, Rubén
  • Solé Pareta, Josep
  • Barlet Ros, Pere
With the evolution of the online advertisement and tracking ecosystem, content-blockers have become the reference tool for improving the security, privacy and browsing experience when surfing the Internet. It is also commonly believed that using content-blockers to stop unsolicited content decreases the time needed for loading websites. In this work, we perform a large-scale study on the actual improvements of using content-blockers in terms of performance and quality of experience. For measuring it, we analyze the page size and loading times of the 100K most popular websites, as well as the most relevant QoE metrics, such as the Speed Index, Time to Interactive or the Cumulative Layout Shift, for the subset of the top 10K of them. Our experiments show that using content-blockers results in small improvements in terms of performance. However, contrary to popular belief, this has a negligible impact in terms of loading time and quality of experience. Moreover, in the case of small and lightweight websites, the overhead introduced by content-blockers can even result in decreased performance. Finally, we evaluate the improvement in terms of QoE based on the Mean Opinion Score (MOS) and find that two of the three studied content-blockers present an overall decrease between 3% and 5% instead of the expected improvement., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Detecting contextual network anomalies with graph neural networks

  • Latif Martínez, Hamid
  • Suárez-Varela Maciá, José Rafael
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Detecting anomalies on network traffic is a complex task due to the massive amount of traffic flows in today’s networks, as well as the highly-dynamic nature of traffic over time. In this paper, we propose the use of Graph Neural Networks (GNN) for network traffic anomaly detection. We formulate the problem as contextual anomaly detection on network traffic measurements, and propose a custom GNN-based solution that detects traffic anomalies on origin-destination flows. In our evaluation, we use real-world data from Abilene (6 months), and make a comparison with other widely used methods for the same task (PCA, EWMA, RNN). The results show that the anomalies detected by our solution are quite complementary to those captured by the baselines (with a max. of 36.33% overlapping anomalies for PCA). Moreover, we manually inspect the anomalies detected by our method, and find that a large portion of them can be visually validated by a network expert (64% with high confidence, 18% with mid confidence, 18% normal traffic). Lastly, we analyze the characteristics of the anomalies through two paradigmatic cases that are quite representative of the bulk of anomalies., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/50110-0011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA). This work was supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European Union – NextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-063000-2021-52). It has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Evaluating the impact of the guard band width on the benefits of probabilistic constellation shaping in future flex-grid over multicore fibre optical backbone networks

  • Perelló Muntan, Jordi
  • Gené Bernaus, Joan M.
  • Cho, Junho
  • Spadaro, Salvatore
Probabilistic constellation shaping (PCS) has emerged as an advanced modulation technique that provides a fine-grained software-defined trade-off between achievable spectral efficiency (SE) and transmission reach to deliver optimal channel capacity at any distance. This paper quantifies the network throughput benefits resulting from adopting PCS in future Flex-Grid over multicore fibre optical backbone networks, compared to using traditional uniform modulation formats. In particular, different inter-channel guard band width configurations are accounted in our study, aiming to set guidelines on the technological requirements imposed to network spectrum selective switches (SSS) to take full PCS advantage in future optical backbone networks., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Atom: Neural traffic compression with spatio-temporal graph neural networks

  • Almasan Puscas, Felician Paul
  • Rusek, Krzysztof
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Storing network traffic data is key to efficient network management; however, it is becoming more challenging and costly due to the ever-increasing data transmission rates, traffic volumes, and connected devices. In this paper, we explore the use of neural architectures for network traffic compression. Specifically, we consider a network scenario with multiple measurement points in a network topology. Such measurements can be interpreted as multiple time series that exhibit spatial and temporal correlations induced by network topology, routing, or user behavior. We present Atom, a neural traffic compression method that leverages spatial and temporal correlations present in network traffic. Atom implements a customized spatio-temporal graph neural network design that effectively exploits both types of correlations simultaneously. The experimental results show that Atom can outperform GZIP’s compression ratios by 50%-65% on three real-world networks., This work was supported by the Spanish Ministry of Economic Affairs and Digital Transformation and the European UnionNextGeneration EU, in the framework of the Recovery Plan, Transformation and Resilience (PRTR) (Call UNICO I+D 5G 2021, refs. number TSI-063000-2021-3, TSI-063000-2021-38, and TSI-0630002021-52). It has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement no. 101017109 “DAEMON”. This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. It was also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund. Krzysztof Rusek was supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University of Science and Technology., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Probabilistic constellation shaping in flex-grid over multicore fibre optical backbone networks: an energy savings evaluation

  • Perelló Muntan, Jordi
  • Gené Bernaus, Joan M.
  • Cho, Junho
  • Spadaro, Salvatore
Probabilistic constellation shaping (PCS) has been shown to close the gap to channel capacity at any distance, by providing a fine-grained software-defined trade-off between achievable spectral efficiency and transmission reach. Previous works on PCS performance evaluation in Flex-Grid over multicore fibre optical backbone networks have already noted its superior performance when compared to traditional modulation formats, as well as its potential to lower associated network capital expenditures (CAPEX) by allowing, for example, a reduction in the required number of transceivers to handle the offered traffic demands. This paper investigates the potential of PCS to lower network energy consumption, as a way to contribute to the eco-friendliness and sustainability of next-generation optical backbone networks. © 2024 IEEE., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Early detection of new web tracking methods across 1.5 million sites

  • Castell Uroz, Ismael
  • Sánchez de Mingo, Óscar
  • Barlet Ros, Pere
Current web tracking practices pose a constant threat to the privacy of Internet users. As a result, the research community has recently proposed different tools to combat well-known tracking methods. However, the early detection of new, previously unseen tracking systems is still an open research problem. In this paper, we present TrackSign+, a novel approach to discovering new web tracking methods. The main idea behind TrackSign+ is the use of code fingerprinting to identify common pieces of code shared across multiple domains. To detect tracking fingerprints, TrackSign+ builds a novel 4-mode network graph that captures the relationship between domains, URLs, online resources, and code fingerprints. We evaluated TrackSign+ with the 1.5M most popular Internet domains, including more than 45M web resources from almost 77M HTTP requests. Our results show that our method can detect new web tracking resources with high precision (over 92%). TrackSign+ was able to detect more than 300k new trackers, 800k new tracking resources, and 4.5M new tracking URLs, not yet detected by most popular pattern lists at the time. Finally, we also validated the effectiveness of TrackSign+ with more than 20 years of historical data from the Internet Archive., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia) ., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Evaluation of probabilistic constellation shaping performance in Flex Grid over multicore fiber dynamic optical backbone networks [Invited]

  • Perelló Muntan, Jordi
  • Gené Bernaus, Joan M.
  • Spadaro, Salvatore
In this paper, we present a worst-case methodology for estimating the attainable spectral efficiency over end-to-end paths across a Flex Grid over multicore fiber (MCF) optical network. This methodology accounts for physical link noise, as well as for the signal-to-noise ratio in the Add module (SNR TX ) of spatial-division-multiplexing-enabled reconfigurable optical add and drop multiplexers (SDM-ROADMs), introducing a dominant noise contribution over that of their Bypass and Drop modules. The proposed methodology is subsequently used to quantify the benefits that probabilistic constellation shaping (PCS) can bring to Flex-Grid/MCF dynamic optical backbone networks, compared to using traditional polarization-multiplexed modulation formats. In a first step, insight is provided into the spectral efficiency attainable along the precomputed end-to-end paths in two reference backbone networks, either using PCS or traditional modulation formats. Moreover, in each one of these networks, two SNR TX values are identified: the SNR TX yielding the maximum average paths’ spectral efficiency, as well as an SNR TX that, although slightly degrading the average paths’ spectral efficiency (by 10%), would yet enable a cost-effective SDM-ROADM Add module implementation. Extensive simulations are conducted to analyze PCS offered load gains under 1% bandwidth blocking probability. Furthermore, the study lastly focuses on finding out whether lower fragmentation levels in Flex-Grid/MCF dynamic optical backbone networks can push PCS benefits even further., Funding: Agencia Estatal de Investigación (PID2020-118011GB-C21, PID2020-118011GB-C22, RED2018-102585-T)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Building a Digital Twin for network optimization using graph neural networks

  • Ferriol Galmés, Miquel
  • Suárez-Varela Maciá, José Rafael
  • Paillissé Vilanova, Jordi
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Network modeling is a critical component of Quality of Service (QoS) optimization. Current networks implement Service Level Agreements (SLA) by careful configuration of both routing and queue scheduling policies. However, existing modeling techniques are not able to produce accurate estimates of relevant SLA metrics, such as delay or jitter, in networks with complex QoS-aware queueing policies (e.g., strict priority, Weighted Fair Queueing, Deficit Round Robin). Recently, Graph Neural Networks (GNNs) have become a powerful tool to model networks since they are specifically designed to work with graph-structured data. In this paper, we propose a GNN-based network model able to understand the complex relationship between the queueing policy (scheduling algorithm and queue sizes), the network topology, the routing configuration, and the input traffic matrix. We call our model TwinNet, a Digital Twin that can accurately estimate relevant SLA metrics for network optimization. TwinNet can generalize to its input parameters, operating successfully in topologies, routing, and queueing configurations never seen during training. We evaluate TwinNet over a wide variety of scenarios with synthetic traffic and validate it with real traffic traces. Our results show that TwinNet can provide accurate estimates of end-to-end path delays in 106 unseen real-world topologies, under different queuing configurations with a Mean Absolute Percentage Error (MAPE) of 3.8%, as well as a MAPE of 6.3% error when evaluated with a real testbed. We also showcase the potential of the proposed model for SLA-driven network optimization and what-if analysis., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/, Spain10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), Spain and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, Spain and the European Social Fund., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

ASTrack: Automatic detection and removal of web tracking code with minimal functionality loss

  • Castell Uroz, Ismael
  • Fukuda, Kensuke
  • Barlet Ros, Pere
Recent advances in web technologies make it more difficult than ever to detect and block web tracking systems. In this work, we propose ASTrack, a novel approach to web tracking detection and removal. ASTrack uses an abstraction of the code structure based on Abstract Syntax Trees to selectively identify web tracking functionality shared across multiple web services. This new methodology allows us to: (i) effectively detect web tracking code even when using evasion techniques (e.g., obfuscation, minification, or webpackaging); and (ii) safely remove those portions of code related to tracking purposes without affecting the legitimate functionality of the website. Our evaluation with the top 10k most popular Internet domains shows that ASTrack can detect web tracking with high precision (98%), while discovering about 50k tracking code pieces and more than 3,400 new tracking URLs not previously recognized by most popular privacy-preserving tools (e.g., uBlock Origin). Moreover, ASTrack achieved a 36% reduction in functionality loss in comparison with the filter lists, one of the safest options available. Using a novel methodology that combines computer vision and manual inspection, we estimate that full functionality is preserved in more than 97% of the websites., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also par-tially supported by the NII internship program., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A multidisciplinary model to quantify human uncertainty in human-centric cyber-physical-social systems: A 5G application use case

  • Alzate Mejía, Nestor
  • Perelló Muntan, Jordi
  • Santos Boada, Germán
  • Almeida Amazonas, José Roberto de
The emerging Human-Centric Networks (HCN) paradigm shifts the passive role of individuals to an active one, intertwining the uncertainty of network resource usage with human dynamics, which are difficult to analyze and predict. This phenomenon implies an increase in reciprocal interactions between Cyber-Physical-Social Systems (CPSS) and human activities, presenting the challenge of efficiently allocating network resources while taking into account qualitative human uncertainty. In this study, we propose a conceptual model that addresses and quantifies such uncertainties. The proposed model is characterized by its adaptability to various CPSS applications, facilitating its integration into existing applications and future innovations. The adaptability of the model is based on the application of the sociological concept of Boundary Objects (BO), which allows for the structuring of system components and the generation of a reference architecture that facilitates systematic problem solving. To evaluate the model, we propose a use case related to a Vehicle for Hire (VFH) application operating within a 5G network slice. The integration of the proposed model with the OMNET++ simulation framework has allowed to demonstrate the effectiveness of the model in intricate computational environments and have shown its capacity to incorporate previously overlooked elements that are essential for the optimal allocation of resources in CPSS. This study proposes a methodology for comprehending and mitigating the consequences of human uncertainty, emphasizing the significance of a multidisciplinary approach to resource allocation in sophisticated technological systems., This work was supported in part by the Spanish I+D+i Project TRAINER-A, funded by Ministerio de Ciencia, Innovación y Universidades (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the aid granted by the Sinfoni Project INV3164 of the Cooperative University of Colombia., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Reducing the number of transceivers with probabilistic constellation shaping in flex-grid over MCF optical backbone networks

  • Perelló Muntan, Jordi
  • Gené Bernaus, Joan M.
  • Cho, Junho
  • Spadaro, Salvatore
This paper quantifies the potential reduction in the number of required transceivers that the use of probabilistic constellation shaping (PCS) can bring to Flex-Grid over multicore fiber (MCF) optical backbone networks, which can directly lead to a reduction in network capital expenditure (CAPEX). Results from two different backbone networks illustrate that PCS can significantly decrease the number of required transceivers compared to using traditional modulation formats, thanks to the finer granularity in spectral efficiency. The observed reduction becomes more prominent (up to 22.3%) as the traffic profile bit-rates and the network physical distances increase., This publication is part of the Spanish I+D+i projects TRAINER-A and TRAINER-B (refs. PID2020-118011GB-C21 and PID2020-118011GB-C22), funded by MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

ENERO: Efficient real-time WAN routing optimization with Deep Reinforcement Learning

  • Almasan Puscas, Felician Paul
  • Xiao, Shihan
  • Cheng, Xiangle
  • Shi, Xiang
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Wide Area Networks (WAN) are a key infrastructure in today’s society. During the last years, WANs have seen a considerable increase in network’s traffic and network applications, imposing new requirements on existing network technologies (e.g., low latency and high throughput). Consequently, Internet Service Providers (ISP) are under pressure to ensure the customer’s Quality of Service and fulfill Service Level Agreements. Network operators leverage Traffic Engineering (TE) techniques to efficiently manage the network’s resources. However, WAN’s traffic can drastically change during time and the connectivity can be affected due to external factors (e.g., link failures). Therefore, TE solutions must be able to adapt to dynamic scenarios in real-time. In this paper we propose Enero, an efficient real-time TE solution based on a two-stage optimization process. In the first one, Enero leverages Deep Reinforcement Learning (DRL) to optimize the routing configuration by generating a long-term TE strategy. To enable efficient operation over dynamic network scenarios (e.g., when link failures occur), we integrated a Graph Neural Network into the DRL agent. In the second stage, Enero uses a Local Search algorithm to improve DRL’s solution without adding computational overhead to the optimization process. The experimental results indicate that Enero is able to operate in real-world dynamic network topologies in 4.5 s on average for topologies up to 100 links., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/ 10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Toward deep application-network integration: architectures, progress and opportunities

  • Serracanta Pujol, Berta
  • Gao, Kai
  • Ros Giralt, Jordi
  • Rodríguez Natal, Alberto
  • Contreras Murillo, Luis Miguel
  • Yang, Richard
  • Cabellos Aparicio, Alberto
With the rise of a new generation of applications (e.g., virtual and augmented reality, artificial intelligence, etc.) demanding stringent performance requirements, the need for networking solutions and architectures that can enable a higher quality of experience (QoE) has become increasingly important. While jointly optimizing application and network may increase the applications' QoE and simultaneously improve the utilization of network resources, such a paradigm has had limited success in real production networks. However, with the combination of revolutionary trends in computer processing demands, networking capabilities, and sustainable business models, it is high time the community explores the full potential of deeper integration between application and network. In this tutorial article, recent trends observed over the past few years are systematically reviewed. These include the paradigm shift in modern communication services toward computing-driven applications, such as on-site AI training, advances in programmable network technologies like software defined networking (SDN), and new business models incentivizing collaboration and cooperation between parties. Following this, successful scenarios that benefit from various forms of deeper network-application integration are reported, highlighting their considerable potential. A unified framework is then introduced, providing an overview of possible architecture paradigms for network-application integration and bringing awareness to existing abstractions, mechanisms, tools, and their potential combinations. The article concludes with a discussion of several remaining challenges in building practical network-application integrated systems., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Real-time generation of 3-dimensional representations of static objects using small unmanned aerial vehicles

  • Talarn Bell-lloch, Pau
  • Ollé Ferrayuoli, Bernat
  • Lemic, Filip
  • Abadal Cavallé, Sergi
  • Costa Pérez, Xavier
Recent advances in robotics and nanotechnology resulted in a set of miniaturized Unmanned Aerial Vehicles (UAVs). Such small UAVs are envisioned to operate in hard-to-reach areas for enabling applications such as structural monitoring or content capturing. Towards showcasing this vision, we demonstrate a small UAV-supported setup for real-time autonomous generation of 3-Dimensional (3D) representations of static objects. In the setup, a small UAV (i.e., CrazyFlie 2.1) is envisioned to visit a set of locations, acting as a carrier and power source of a camera sensor. At each location, the sensor is expected to take a picture of the object and report it to the station. The station implements a pipeline for 3D reconstruction based on the pictures taken by the UAV., This work was funded by the MCIN/AEI/10.13039/01100011033/ FEDER/EU HoloMit 2.0 (PID2021-126551OB-C21) and MCIN/AEI/ 10.13039/501100011033 TRAINER-A (PID2020-118011GB-C21)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A one-pass clustering based sketch method for network monitoring

  • Fu, Yongquan
  • An, Lun
  • Shen, Siqi
  • Chen, Kai
  • Barlet Ros, Pere
Network monitoring solutions need to cope with increasing network traffic volumes, as a result, sketch-based monitoring methods have been extensively studied to trade accuracy for memory scalability and storage reduction. However, sketches are sensitive to skewness in network flow distributions due to hash collisions, and need complicated performance optimization to adapt to line-rate packet streams. We provide Jellyfish, an efficient sketch method that performs one-pass clustering over the network stream. One-pass clustering is realized by adapting the monitoring granularity from the whole network flow to fragments called subflows, which not only reduces the ingestion rate but also provides an efficient intermediate representation for the input to the sketch. Jellyfish provides the network-flow level query interface by reconstructing the network-flow level counters by merging subflow records from the same network flow. We provide probabilistic analysis of the expected accuracy of both existing sketch methods and Jellyfish. Real-world trace-driven experiments show that Jellyfish reduces the average estimation errors by up to six orders of magnitude for per-flow queries, by six orders of magnitude for entropy queries, and up to ten times for heavy-hitter queries., This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61972409; in part by Hong Kong Research Grants Council (RGC) under Grant TRS T41-603/20-R, Grant GRF-16213621, and Grant ITF ACCESS; in part by the Spanish I+D+i project TRAINER-A, funded by MCIN/AEI/10.13039/501100011033, under Grant PID2020-118011GB-C21; and in part by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Evaluating a multidisciplinary model for managing human uncertainty in 5G cyber-physical-social systems

  • Alzate Mejía, Nestor
  • Perelló Muntan, Jordi
  • Santos Boada, Germán
  • Almeida Amazonas, José Roberto de
This paper presents a comprehensive evaluation of the previously introduced multidisciplinary model to quantify human uncertainty (MMtQHU) within a realistic 5G-enabled cyber–physical–social systems (CPSS) environment. The MMtQHU, which integrates human, social, and environmental factors into CPSS modeling, is applied to the Ingolstadt traffic scenario (InTAS), a detailed urban simulation reflecting high-traffic conditions. By modeling unpredictable driver behaviors, such as deviations from optimal routes, the study assesses the model’s effectiveness in managing human-induced uncertainties in vehicle-for-hire (VFH) applications. The evaluation shows that human uncertainty significantly impacts 5G network resource allocation and traffic dynamics. A comparative analysis of traditional resource allocation methods reveals their limitations in handling the dynamic nature of human behavior. These findings underscore the necessity for advanced, adaptive strategies, potentially leveraging artificial intelligence and machine learning to enhance the resilience and efficiency of 5G networks in CPSS environments. The study offers valuable insights for future advancements in robust and adaptive 5G infrastructure by highlighting the critical role of integrating human behavior into CPSS models., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GBC21) funded by MCIN/AEI/10.13039/501100011033 and by the aid granted by the Sinfoni project of the Cooperative University of Colombia., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

RouteNet-Fermi: network modeling with graph neural networks

  • Ferriol Galmés, Miquel
  • Paillissé Vilanova, Jordi
  • Suárez-Varela Maciá, José Rafael
  • Rusek, Krzysztof
  • Xiao, Shihan
  • Shi, Xiang
  • Cheng, Xiangle
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Network models are an essential block of modern networks. For example, they are widely used in network planning and optimization. However, as networks increase in scale and complexity, some models present limitations, such as the assumption of Markovian traffic in queuing theory models, or the high computational cost of network simulators. Recent advances in machine learning, such as Graph Neural Networks (GNN), are enabling a new generation of network models that are data-driven and can learn complex non-linear behaviors. In this paper, we present RouteNet-Fermi, a custom GNN model that shares the same goals as Queuing Theory, while being considerably more accurate in the presence of realistic traffic models. The proposed model predicts accurately the delay, jitter, and packet loss of a network. We have tested RouteNet-Fermi in networks of increasing size (up to 300 nodes), including samples with mixed traffic profiles — e.g., with complex non-Markovian models — and arbitrary routing and queue scheduling configurations. Our experimental results show that RouteNet-Fermi achieves similar accuracy as computationally-expensive packet-level simulators and scales accurately to larger networks. Our model produces delay estimates with a mean relative error of 6.24% when applied to a test dataset of 1,000 samples, including network topologies one order of magnitude larger than those seen during training. Finally, we have also evaluated RouteNet-Fermi with measurements from a physical testbed and packet traces from a real-life network., This work was supported in part by the Spanish I+D+i Project TRAINER-A funded by the Ministry of Science and Innovation (MCIN)/State Investigation Agency (AEI)/10.13039/501100011033 under Grant PID2020-118011GB-C21, in part by the Catalan Institution for Research and Advanced Studies (ICREA), and in part by the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Verification of performance degradation in a telecommunications system due to the uncertainty of human users in the loop

  • Alzate Mejía, Nestor
  • Santos Boada, Germán
  • Almeida Amazonas, José Roberto de
The intensive use of new technologies that cause more interactions between systems and the daily activities of human users is changing the focus on how network re- sources should be managed. However, these changes can create challenges related to the level of uncertainty that people introduce to the system. In this context, this research study seeks to determine whether people’s uncertainty influences network performance and how significant its impact is. For these purposes, a simulated case study of a Vehicle for Hire application designed to run over a network slicing of a fifth-generation (5G) network. The simulations compared call drop rates in several settings configured to represent different levels of uncertainty, introducing random alterations to free channel planning reserved for the handover process. The simulation results reveal that the uncertainty specifically introduced by people exerts a high negative impact on network performance, evidencing the need to develop an algorithm that considers this uncertainty when managing resources within the 5G network core., This work has been supported by the Spanish Government through project TRAINER-A (PID2020-118011GB-C21) with FEDER contribution. Moreover, it has been supported by the Spanish Thematic Network under contract RED2018-102585-T (Go2Edge) and by the aid granted by the Sinfoni project INV2733 of the Cooperative University of Colombia., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

On the stability of the Kubernetes Horizontal Autoscaler control loop

  • Serracanta Pujol, Berta
  • Lukács, Andor
  • Rodríguez Natal, Alberto
  • Cabellos Aparicio, Alberto
  • Rétvári, Gábor
Kubernetes is a widely used platform for deploying and managing containerized applications due to its efficient elastic capabilities. The Horizontal Pod Autoscaler (HPA) in Kubernetes independently adjusts the number of pods for each service, yet these services often operate in an interconnected manner. This study aims to understand the effects of autoscaling events on a graph of interconnected services. To achieve this, we apply control theory to model the HPA’s behavior. We analyze the stability of this model, perform numerical simulations, and deploy a real testbed to evaluate the performance. Our findings demonstrate that the control theory-based model accurately predicts the HPA’s behavior, ensuring system stability with CPU utilization meeting desired thresholds and no traffic loss after a transitional period. The model provides insights into optimizing resource scheduling and improving application performance in Kubernetes environments. Additionally, we extend our model to the whole service graph to understand how individual scaling decisions influence the complex graphs of cloud applications., This work was supported in part by the Spanish I+D+i Project TowaRds fully AI-empowered NetwoRks, subproject A (TRAINER-A), funded by Ministerio de Ciencia e Innovación (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033 under Grant PID2020-118011GB-C21; in part by the Catalan Institution for Research and Advanced Studies (ICREA) through the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia; in part by the European Social Fund; and in part by the National Research, Development and Innovation Fund of Hungary under Grant OTKA/ANN-135606, Grant OTKA/FK-135074, and Grant OTKA/FK-134604., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Network digital twin: context, enabling technologies, and opportunities

  • Almasan Puscas, Felician Paul
  • Ferriol Galmés, Miquel
  • Paillissé Vilanova, Jordi
  • Suárez-Varela Maciá, José Rafael
  • Perino, Diego
  • Lopez, Diego
  • Pastor Perales, Antonio Agustín
  • Harvey, Paul
  • Ciavaglia, Laurent
  • Wong, Leon
  • Xiao, Shihan
  • Ram, Vishnu
  • Shi, Xiang
  • Cheng, Xiangle
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
The proliferation of emergent network applications (e.g., telesurgery, metaverse) is increasing the difficulty of managing modern communication networks. These applications entail stringent network requirements (e.g., ultra-low deterministic latency), which hinders network operators to manage their resources efficiently. In this article, we introduce the network digital twin (NDT), a renovated concept of classical network modeling tools whose goal is to build accurate data-driven network models that can operate in real-time. We describe the general architecture of the NDT and argue that modern machine learning (ML) technologies enable building some of its core components. Then, we present a case study that leverages a ML-based NDT for network performance evaluation and apply it to routing optimization in a QoS-aware use case. Lastly, we describe some key open challenges and research opportunities yet to be explored to achieve effective deployment of NDTs in real-world networks., This publication is part of the Spanish I+D+i project TRAINER-A (ref.PID2020- 118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA) and the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia and the European Social Fund., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Detecting and analyzing mouse tracking in the wild

  • Urpí Bricollé, Marcel
  • Castell Uroz, Ismael
  • Barlet Ros, Pere
Nowadays, most websites collect personal information about their users in order to identify them and personalize their services. Among the tools used to that end, fingerprinting is one of the most advanced and precise methods, given the huge amount of features they can collect and combine to build a robust identifier of the user. Although many fingerprinting techniques have recently been studied in the literature, the use and prevalence of mouse tracking, a method that collects information about the computer pointer, is still unexplored in detail. In this work, we propose a new methodology to detect this tracking method and measure its actual usage on the top 80,000 most popular websites. Our results show that about 1.2% of the analyzed websites use some sort of mouse tracking, including some popular websites within the top-1k ranking., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GB-C21), funded by MCIN/ AEI/10.13039/501100011033. This work is also supported by the Catalan Institution for Research and Advanced Studies (ICREA Academia)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

FlowDT: A Flow-aware Digital Twin for computer networks

  • Ferriol Galmés, Miquel
  • Cheng, Xiangle
  • Shi, Xiang
  • Xiao, Shihan
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Network modeling is an essential tool for network planning and management. It allows network administrators to explore the performance of new protocols, mechanisms, or optimal configurations without the need for testing them in real production networks. Recently, Graph Neural Networks (GNNs) have emerged as a practical solution to produce network models that can learn and extract complex patterns from real data without making any assumptions. However, state-of-the-art GNN-based network models only work with traffic matrices, this is a very coarse and simplified representation of network traffic. Although this assumption has shown to work well in certain use-cases, it is a limiting factor because, in practice, networks operate with flows. In this paper, we present FlowDT a new DL-based solution designed to model computer networks at the fine-grained flow level. In our evaluation, we show how FlowDT can accurately predict relevant per-flow performance metrics with an error of 3.5%, FlowDT’s performance is also benchmarked against vanilla DL models as well as with Queuing Theory., This work has been supported by the Spanish Government through project TRAINER-A (PID2020-118011GB-C21) with FEDER contribution and the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

GraphCC: a practical graph learning-based approach to congestion control in datacenters

  • Bernárdez Gil, Guillermo
  • Suárez Varela, José
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Congestion Control (CC) plays a fundamental role in optimizing traffic in Datacenter Networks (DCNs). Currently, DCNs implement two main CC protocols: DCTCP and DCQCN. Both protocols are based on Explicit Congestion Notification (ECN), where switches mark packets when they detect congestion. Nowadays, network experts carefully set ECN parameters to optimize the average network performance. However, today’s DCNs experience rapid and abrupt changes that severely affect the network state (e.g., dynamic workloads, incasts), which leads to under-utilization and sub-optimal performance. In this paper we present GraphCC, a framework for in-network CC optimization. GraphCC relies on Multi-agent Reinforcement Learning (MARL) and Graph Neural Networks (GNN), and is compatible with widely deployed ECN-based CC protocols. The proposed solution deploys distributed agents on switches that communicate with their neighbors to cooperate and optimize the global ECN configuration. In our evaluation, we test GraphCC with three real-world traffic workloads, focusing on its capability to accommodate scenarios unseen during training (e.g., traffic changes, failures). We compare GraphCC with a state-of-the-art MARL solution for ECN tuning, and observe that our method outperforms the state-of-the-art baseline in all evaluation scenarios, with improvements up to 20% in average Flow Completion Time, similar mean throughput (within 1%), and significant reductions in buffer occupancy (38.0-85.7%)., This publication is part of the Spanish I+D+i project TRAINER-A (reference PID2020-118011GB-C21), funded by MCIN/AEI/10.13039/ 501100011033, and the research has been partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, and the European Social Fund. This work is also partially supported by the ORIGAMI project, funded by the Smart Networks and Services Joint Undertaking (SNS JU) under the European Union’s Horizon Europe research and innovation programme under Grant Agreement No 101139270, as well as by the CHISTERA grant CHIST-ERA-22-SPiDDS-02 corresponding to the GRAPHS4SEC project (reference PCI2023-145974-2), funded by the Agencia Estatal de Investigación through the PCI 2023 call., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

MAGNNETO: A graph neural network-based multi-agent system for traffic engineering

  • Bernárdez Gil, Guillermo
  • Suárez-Varela Maciá, José Rafael
  • López Brescó, Albert
  • Shi, Xiang
  • Xiao, Shihan
  • Cheng, Xiangle
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
Current trends in networking propose the use of Machine Learning (ML) for a wide variety of network optimization tasks. As such, many efforts have been made to produce ML-based solutions for Traffic Engineering (TE), which is a fundamental problem in Internet Service Provider (ISP) networks. Nowadays, state-of-the-art TE optimizers rely on traditional optimization techniques, such as Local search, Constraint Programming, or Linear programming. In this paper, we present MAGNNETO, a distributed ML-based framework that leverages Multi-Agent Reinforcement Learning and Graph Neural Networks for distributed TE optimization. MAGNNETO deploys a set of agents across the network that learn and communicate in a distributed fashion via message exchanges between neighboring agents. Particularly, we apply this framework to optimize link weights in Open Shortest Path First (OSPF), with the goal of minimizing network congestion. In our evaluation, we compare MAGNNETO against several state-of-the-art TE optimizers in more than 75 topologies (up to 153 nodes and 354 links), including realistic traffic loads. Our experimental results show that, thanks to its distributed nature, MAGNNETO achieves comparable performance to state-of-the-art TE optimizers with significantly lower execution times. Moreover, our ML-based solution demonstrates a strong generalization capability to successfully operate in new networks unseen during training., This publication is part of the Spanish I+D+i project TRAINER-A (ref. PID2020-118011GBC21), funded by MCIN/AEI/10.13039/501100011033. This work is also partially funded by the Catalan Institution for Research and Advanced Studies (ICREA), the Secretariat for Universities and Research of the Ministry of Business and Knowledge of the Government of Catalonia, and the European Social Fund., Peer Reviewed, Postprint (author's final draft)