Open World Learning Graph Convolution for Latency Estimation in Routing Networks
This addresses the challenge of accurate latency estimation in Software Defined Networking, offering a more robust solution for network management, though it is incremental as it builds on existing graph-based methods.
The paper tackles the problem of routing network status estimation by proposing a Graph Neural Network approach that extrapolates to unseen feature distributions and handles open-world inputs, showing improved prediction accuracy, computational efficiency, and generalization compared to conventional deep-learning models.
Accurate routing network status estimation is a key component in Software Defined Networking. However, existing deep-learning-based methods for modeling network routing are not able to extrapolate towards unseen feature distributions. Nor are they able to handle scaled and drifted network attributes in test sets that include open-world inputs. To deal with these challenges, we propose a novel approach for modeling network routing, using Graph Neural Networks. Our method can also be used for network-latency estimation. Supported by a domain-knowledge-assisted graph formulation, our model shares a stable performance across different network sizes and configurations of routing networks, while at the same time being able to extrapolate towards unseen sizes, configurations, and user behavior. We show that our model outperforms most conventional deep-learning-based models, in terms of prediction accuracy, computational resources, inference speed, as well as ability to generalize towards open-world input.