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

Algorithm 4

(𝑣₁,…,𝑣_𝛼−𝜆)^#_𝐷 = MDDT[𝐼].

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

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

Step_2: for  {all 𝑢∈𝑈^B and 𝑣∈𝑉}  do

    𝑋[𝑢][𝑣]←0;𝑌[𝑢][𝑣]←0;

   end  for

   for  {all 𝑢∈𝑈^B⧵𝑆 and 𝑣∈𝑉⧵𝑆}  do

    Compute 𝑌[𝑢][𝑣] by (26) and 𝑋[𝑢][𝑣] by (25);

   end for

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