“…Specifically, after each side builds Input: Initial matching Θ; ∀ , , Output: ( ) , ∀ , (1) function Transfer(Θ, , ) (2) for All controllers, ∀ , do (3) for Each switch s ∈ Θ( ) do (4) for controller c ∈ \{ } do (5) Find the transfer pair ( , , ) with minimum TR( , , ) (6) endfor (7) if TR( , , ) < 0 then (8) Update: Θ ← transfer( , , ) (9) end if (10) end for (11) end for (12) Transform Θ to ( ) (13) end function Algorithm 3: Optimal mapping algorithm. the preference list based on the above definitions, switches start to propose to their most preferred controllers.…”