|
RouteNet: Leveraging Graph Neural Networks for
^* G' {( X1 I; a/ M+ S+ _; W' MNetwork Modeling and Optimization in SDN
$ B* R! J5 q* B E- X7 E* a4 Z: B3 _ L$ x* N4 a. E( T
0 [' G5 t& |* j& z: eNetwork modeling is a key enabler to achieve
& _0 b# M& o9 }4 J' g! N0 @& M# F! beffificient network operation in future self-driving Software
O/ ?, X$ F+ @ L- FDefifined Networks. However, we still lack functional network- v: _) d) D. g( e' j
models able to produce accurate predictions of Key Performance
5 f; U$ G4 o+ FIndicators (KPI) such as delay, jitter or loss at limited cost.
2 k0 A# K! i9 {In this paper we propose RouteNet, a novel network model based
) S+ l3 J9 |+ X9 ~0 @9 } bon Graph Neural Network (GNN) that is able to understand
* G: z5 X8 Q) M3 b) Fthe complex relationship between topology, routing, and input. ]. d; D/ }+ e; H
traffific to produce accurate estimates of the per-source/destination5 \+ v, `' \1 s. b$ L* v# v
per-packet delay distribution and loss. RouteNet leverages the
+ t) i7 {0 B( r% Aability of GNNs to learn and model graph-structured information
- v) M% }; }2 sand as a result, our model is able to generalize over arbitrary/ A; I! a, b' L- K* k% I
topologies, routing schemes and traffific intensity. In our eval; I" U$ W' m5 y6 w9 N( u9 {6 B: l- c
uation, we show that RouteNet is able to predict accurately( O9 f: m, ~7 U* f
the delay distribution (mean delay and jitter) and loss even in
4 o+ G8 P& v9 W) K$ H8 `/ Ytopologies, routing and traffific unseen in the training (worst case% P4 U$ r0 S( l. A: {
MRE = 15.4%). Also, we present several use cases where we, a% T. w1 l- g. f" Y
leverage the KPI predictions of our GNN model to achieve1 E2 t1 Z9 P& Q1 U, j
effificient routing optimization and network planning., P# Q. \) v f" a+ A4 k+ {5 e% K( s
Q7 U4 c: h, r
! t; }* @7 h2 M' f3 u; b |