Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks

Algorithm 1

Multicast scheduling algorithm with Markov chains (MSaMC).

Input: Incoming flow , link remaining bandwidth , the number of destination edge switches ,  .

Output: Multicast links with the minimum blocking probability.

// Step  1: identify available core switches

for to do

 Select an uplink ;

 if and then

  Select the core switch and add it into the set ;

 end if

end for

// Step  2: select appropriate core switches

Calculate the blocking probability of available downlinks at time-slot , , by equation (13);

for to do

 Find the core switch(es) in that are connected to a destination edge switch in ;

 if There are multiple core switches to be found then

  Select the core switch with the minimum blocking probability and deliver it to the appropriate set of core switches ;

 else

  Deliver the core switch to the set ;

 end if

 Remove destination edge switches that the selected core switch from can reach;

 Update the set of remaining core switches in ;

end for

// Step  3: establish the optimal pathes

Connect the links between source edge switch and destination edge switches through appropriate core switches in the set ;

Send configuration signals to corresponding devices in multicast subnetwork;