Many-to-Many Multicast Routing Schemes under a Fixed Topology

Algorithm 2

(𝑣₁,…,𝑣_𝛼−𝜆)^∗_D = MCDT[𝐼].

Step_1: Use the Floyd’s algorithm to find all-pairs shortest paths

   and then obtain Σ_𝑐(𝐺)=(𝑉,Σ_𝑐,𝑐);

Step_2:  for  {all 𝑢∈𝑈,𝑣∈𝑉}  do

    𝐶[𝑢][𝑣]←0;

   end  for

   for  {all 𝑢∈𝑈⧵𝑆,𝑣∈𝑉⧵𝑆}  do

    Compute 𝐶[𝑢][𝑣] by (23);

   end  for

Step_3: Trace out (𝑣₁,…,𝑣_𝛼−𝜆)^∗_D top-down from 𝑟 of 𝑇;