Scalable Node-Centric Route Mutation for Defense of Large-Scale Software-Defined Networks

Algorithm 3

Heuristic route mutation for delay-tolerant traffic.

Input:  ; ; ; the accumulative traffic of each node

; the current route of each flow ; ; and the

initial .

Output:  

(1) Let

(2) repeat

(3) Run Steps (3) to (10) of Algorithm 1.

(4) substitute , , (), , and into (8a), (8b), (8c), and (8d), and solve the optimal

solution using the Simplex method;

(5) Arrange in decreasing order so that .

(6) for    do

(7) Let .

(8) repeat

(9) Let ;

(10) Offload traffic flows from node to detour by solving (9) for , given ;

(11) Update

;

;

.

(12) until no traffic flow can be further offloaded from node , or .

(13) end for

(14) until or .