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

Algorithm 2

Route mutation for delay-bounded traffic.

Input:  ; ; ; the accumulative traffic of each node

; the current route of each flow ; ; the initial

; ; and the initial .

Output:  

(1) Let and .

(2) repeat

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

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

incorporating (5), and solve the problem optimally using the binary branch and bound/cut method;

(5) update

;

;

;

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