LFLluís Fàbrega

Lluís Fàbrega

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Lluís Fàbrega has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GNNetSlice: A GNN-based performance model to support network slicing in B5G networks

    by Miquel Farreras, Jordi Paillissé, Lluís Fàbrega, Pere Vilà


  • Open Access

    Generation of a network slicing dataset: The foundations for AI-based B5G resource management

    by Miquel Farreras, Jordi Paillissé, Lluís Fàbrega, Pere Vilà


  • Open Access

    Improving Network Delay Predictions Using GNNs

    by Miquel Farreras, Paola Soto, Miguel Camelo, Lluís Fàbrega, Pere Vilà

    Autonomous network management is crucial for Fifth Generation (5G) and Beyond 5G (B5G) networks, where a constantly changing environment is expected and network configuration must adapt accordingly. Modeling tools are required to predict the impact on performance (packet and delay loss) when new traffic demands arrives and when changes in routing paths are applied in the network. Mathematical analysis and network simulators are techniques for modeling networks but both have limitations, as the former provides low accuracy and the latter requires high execution times. To overcome these limitations, machine learning (ML) algorithms, and more specifically, graph neural networks (GNNs), are proposed for network modeling due to their ability to capture complex relationships from graph-like data while predicting network properties with high accuracy and low computational requirements. However, one of the main issues when using GNNs is their lack of generalization capability to larger networks, i.e., when trained in small networks (in number of nodes, paths length, links capacity), the accuracy of predictions on larger networks is poor. This paper addresses the GNN generalization problem by the use of fundamental networking concepts. Our solution is built from a baseline GNN model called RouteNet (developed by Barcelona Neural Networking Center-Universitat Politècnica de Catalunya (BNN-UPC)) that predicts the average delay in network paths, and through a number of simple additions significantly improves the prediction accuracy in larger networks. The improvement ratio compared to the baseline model is 101, from a 187.28% to a 1.828%, measured by the Mean Average Percentage Error (MAPE). In addition, we propose a closed-loop control context where the resulting GNN model could be potentially used in different use cases.


  • Open Access

    Improving network delay predictions using GNNs

    by Miquel Farreras, Paola Soto, Miguel Camelo, Lluís Fàbrega, Pere Vilà

    Autonomous network management is crucial for Fifth Generation (5G) and Beyond 5G (B5G) networks, where constant environmental changes must be predicted, adapting network configurations accordingly. Model-ing tools are required to predict the impact on performance when new traffic combinations and routings are applied in the network. Mathematical analysis and network simulators are techniques to model modern networks but have limitations of low accuracy or high execution times, respectively. To overcome these limitations, Machine Learning (ML) algorithms, and more concretely, Graph Neural Networks (GNNs), are proposed to model modern networks due to their ability to capture complex relationships from graph-like data while predicting network properties with high accuracy. However, one of the main issues when using GNNs is that they cannot generalize to larger networks, when different input data (i.e. smaller network topologies, and shorter paths) are provided for training and predictions (e.g., larger network topolo-gies, larger paths). This paper addresses the GNN generalization problem by leveraging networking concepts and analysis to improve a base-line model. The results applied on the RouteNet baseline developed by Barcelona Neural Networking Center-Universitat Politècnica de Catalunya (BNN-UPC) significantly improve the model’s accuracy in larger graphs. In addition, we propose a closed-loop control context where the resulting GNN model could be potentially used in different use cases.

  • Low time complexity algorithms for path computation in Cayley Graphs

    by D. Aguirre-Guerrero, G. Ducoffe, L. Fàbrega, P. Vilà, D. Coudert


  • Evaluation of Cayley Graphs for Parallel Computer Systems

    by Daniela Aguirre-Guerrero, Andreu Manosa, Lluis Fabrega, Pere Vila

    Some topology properties that determine the performance and robustness of parallel computer systems include fault-tolerance, latency, load-balancing and support for a high number of end points. This paper analyses the impact of graph symmetry on these properties. Through a comparison between Cayley Graphs (CGs) and classical topologies for parallel computer systems, we show that many families of CGs provide optimal values for the mentioned properties.

  • Routing at Large Scale: Advances and Challenges for Complex Networks

    by Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio, Alok Kumar, Christian Glacet, David Coudert, Nicolas Nisse, Lluis Fabrega, Pere Vila, et al.

    A wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one of the well known classes of complex networks in which nodes' degrees follow a power-law distribution. The design of scalable, adaptive and resilient routing schemes in such networks is very challenging. In this article we present an overview of required routing functionality, categorize the potential design dimensions of routing protocols among existing routing schemes, and analyze experimental results and analytical studies performed so far to identify the main trends/trade-offs and draw main conclusions. Besides traditional schemes such as hierarchical/shortest-path path-vector routing, the article pays attention to advances in compact routing and geometric routing since they are known to significantly improve scalability in terms of memory space. The identified trade-offs and the outcomes of this overview enable more careful conclusions regarding the (un-)suitability of different routing schemes to large-scale complex networks and provide a guideline for future routing research.


  • Geometric Routing With Word-Metric Spaces

    by Miguel Camelo, Dimitri Papadimitriou, Lluis Fabrega, Pere Vila

    As a potential solution to the compact routing problem, geometric routing has been proven to be both simple and heuristically effective. These routing schemes assign some (virtual) coordinates in a metric space to each network vertex through the process called embedding. By forwarding packets to the closest neighbor to the destination, they ensure a completely local process with the routing table bounded in size by the maximum vertex degree. In this letter, we present an embedding of any finite connected graph into a metric space generated by algebraic groups, and we prove that it is greedy (guaranteed packet delivery). Then, we present a specialized compact routing scheme relying on this embedding for scale-free graphs. Evaluation through simulation on several Internet topologies shows that the resulting stretch remains below the theoretical upper bounds.


  • Cayley-Graph-Based Data Centers and Space Requirements of a Routing Scheme Using Automata

    by Miguel Camelo, Pere Vila, Lluis Fabrega, Dimitri Papadimitriou

    Modern data centers connect tens of thousands of computers by an interconnection network. The design of such networks implies the selection of an appropriate routing scheme for them. Those schemes need to be efficient with respect to time and space requirements. Cayley Graphs (CG) has been proposed as models for large-scale interconnection networks with excellent properties and very efficient routing schemes. In a previous work, we presented a fast general-purpose shortest path routing scheme for CG with compact routing tables. The scheme uses the concept the Automatic Structures (AS) of a group. However, the size of such structures was not considered into the complexity analysis. Therefore, this paper evaluates the required space to keep such structures and the several intermediate finite state automata that arise during the process of constructing such AS. We perform the evaluation on six well-known families of CG. The results show which structures are space-efficient to implement the scheme, and how the size of such structures depends on the so-called k-fellow traveler property.


  • Efficient Routing in Data Center with Underlying Cayley Graph

    by Miguel Camelo, Dimitri Papadimitriou, Lluís Fàbrega, Pere Vilà