|
RouteNet: Leveraging Graph Neural Networks for
- P; s, `# m, J0 Q) \' @8 CNetwork Modeling and Optimization in SDN
- q7 P' d3 D2 e. q) r1 m& ^, T5 o( F9 k5 d1 T
8 I6 j; ?8 K* t) k& L; SNetwork modeling is a key enabler to achieve
! {/ i7 F) {* T3 Reffificient network operation in future self-driving Software) P+ d: \6 Y, ]! E& |
Defifined Networks. However, we still lack functional network8 E7 I) T6 B; a% R$ q
models able to produce accurate predictions of Key Performance
' H4 O" q- Z: l( oIndicators (KPI) such as delay, jitter or loss at limited cost.4 H9 e( p% e6 |2 ^& }
In this paper we propose RouteNet, a novel network model based
" [% l( G8 Y/ [. M8 V2 q9 Ron Graph Neural Network (GNN) that is able to understand
7 e$ Q! P. L! _& Y- zthe complex relationship between topology, routing, and input, _* z! H4 c( A
traffific to produce accurate estimates of the per-source/destination% U; L. S; [# O7 d
per-packet delay distribution and loss. RouteNet leverages the
/ l! }1 [) f7 ^ability of GNNs to learn and model graph-structured information
% `1 e8 l* ~8 C, ?8 o3 O6 m7 @% band as a result, our model is able to generalize over arbitrary
5 n9 L& Y7 u+ _/ C! c) c) \topologies, routing schemes and traffific intensity. In our eval' U: [2 q, x7 Z% e
uation, we show that RouteNet is able to predict accurately7 _, }4 E: g+ C9 A/ W
the delay distribution (mean delay and jitter) and loss even in
3 Z0 Y0 V) _) N$ j: w$ s7 Y; _+ h Xtopologies, routing and traffific unseen in the training (worst case+ [. E7 e1 V2 d: N: M: ^8 G9 |
MRE = 15.4%). Also, we present several use cases where we5 r; ~/ S9 ~$ V; G& {
leverage the KPI predictions of our GNN model to achieve% r7 C/ p: K4 ~; J! d
effificient routing optimization and network planning.
7 r( l9 W0 u5 ^/ T! B9 R2 L( b& f( H- C. _8 u! M9 j
3 g* V' @1 a! b2 E) t2 o! e% M
|