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

Algorithm 1

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) for    do

(4) for    do

(5) if    then

(6) construct , using depth-first search, and calculate .

(7) end if

(8) end for

(9) end for

(10) calculate , and using (3);

(11) substitute , , (), , and into the EMD problem (4a), (4b), (4c), (4d), (4e), and (4f),

and solve the problem optimally using the binary branch and bound/cut method;

(12) update

;

;

(13) until stops changing; or in other words, .