RouteNet-Fermi: Network Modeling With GNN (Analysis And Re-implementation)
Shourya Verma, Simran Kadadi, Swathi Jayaprakash, Arpan Kumar Mahapatra, Ishaan Jain
TL;DR
RouteNet-Fermi addresses the challenge of predicting network performance in complex, large-scale networks using a Graph Neural Network that models interactions among flows, queues, and links. This work extends RouteNet-Fermi with LSTM and simple RNN variants alongside the original GRU, enabling direct comparisons of recurrent architectures within the GNN framework. The contributions include an extended, flexible implementation, evaluation across Fat Tree, real traffic, and traffic-model datasets, and analysis of memory, gradient flow, and throughput trade-offs in recurrent cells. The results indicate that LSTM generally yields strongest accuracy for delay and traffic patterns, GRU offers a robust efficiency-accuracy balance, and RNNs struggle with large, bursty networks, informing design choices for data-driven network modeling.
Abstract
Network performance modeling presents important challenges in modern computer networks due to increasing complexity, scale, and diverse traffic patterns. While traditional approaches like queuing theory and packet-level simulation have served as foundational tools, they face limitations in modeling complex traffic behaviors and scaling to large networks. This project presents an extended implementation of RouteNet-Fermi, a Graph Neural Network (GNN) architecture designed for network performance prediction, with additional recurrent neural network variants. We improve the the original architecture by implementing Long Short-Term Memory (LSTM) cells and Recurrent Neural Network (RNN) cells alongside the existing Gated Recurrent Unit (GRU) cells implementation. This work contributes to the understanding of recurrent neural architectures in GNN-based network modeling and provides a flexible framework for future experimentation with different cell types.
