Message-Passing Neural Networks Learn Little's Law

Abstract

The paper presents a solution to the problem of universal representation of graphs exemplifying communication network topologies with the help of neural networks. The proposed approach is based on message-passing neural networks (MPNN). The approach enables us to represent topologies and operational aspects of networks. The usefulness of the solution is illustrated with a case study of delay prediction in queuing networks. This shows that performance evaluation can be provided without having to apply complex modeling. In consequence, the proposed solution makes it possible to effectively apply methods elaborated in the field of machine learning in communications.

arXiv comment4 pages, 1 figure, 1 table, 1 algorith, Accepted for publication in IEEE Communications letters if citing, please cite the IEEE paper

References in corpus (6)

• Emergence of scaling in random networks
• Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
• Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
• Neural Message Passing for Quantum Chemistry
• Molecular Graph Convolutions: Moving Beyond Fingerprints
• Knowledge-Defined Networking

Cited by in corpus (8)

• RouteNet: Leveraging Graph Neural Networks for network modeling and optimization in SDN
• Graph-based Deep Learning for Communication Networks: A Survey
• Unveiling the potential of Graph Neural Networks for network modeling and optimization in SDN
• Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking
• GNN-Geo: A Graph Neural Network-based Fine-grained IP geolocation Framework
• Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search
• gSuite: A Flexible and Framework Independent Benchmark Suite for Graph Neural Network Inference on GPUs
• On the Robustness of Deep Learning-predicted Contention Models for Network Calculus