A Semistructured Random Identifier Protocol for Anonymous Communication in SDN Network

Algorithm 1

Building routing table.

Input: network topology

Output: Routing table for each switch in

/*  building the routing table with directly connected

neighbors  */

(1)foreach  switch    in    do

(2)foreach  neighbor    in    do

(3) calcVidDistance(, );

(4) .getConnectingPort();

(5) getPrefixWithLevel(, );

(6).addOutputToLevel(, );

(7)end

(8)end

/*  find all gateways of each switch on each level  */

(9)foreach  switch    in    do

(10)foreach  switch    in    and    do

(11)foreach  level    in    do

(12)if  .isGatewayOf(, )  then

(13).addGateway(, );

(14)end

(15)end

(16)end

(17)end

/*  find a nexthop for each gateway by recursively

looking up the routing table  */

(18)foreach  switch    in    do

(19)foreach  level    in    do

(20) .getGateway();

(21) .findNexthopRecursively();

(22) .getConnectingPort();

(23) getPrefixWithLevel(, );

(24).addOutputToLevel(, );

(25)end

(26)end