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

Procedure 1

Procedure CMRP.

Input: an undirected edge-weighted graph 𝐺=(𝑉,𝐸,𝑝);

Output: all-pairs MRP’s of 𝐺 (namely  Π(𝐺)=(𝑉,Π,𝑝));

Step_1:  for  {𝑖=1,2,…,|𝑉| and 𝑗=1,2,…,|𝑉|}  do

     𝑝⁽⁰⁾(𝑖,𝑗)←𝑃_𝑖,𝑗;

   end  for

Step_2:  for  𝑘=1,2,…,|𝑉|  do

    for  {𝑖=1,2,…,|𝑉| and 𝑗=1,2,…,|𝑉|}  do

     if  𝑖=𝑗  then

      𝑝^(𝑘)(𝑖,𝑗)←∞;

     else

      Compute 𝑝^(𝑘)(𝑖,𝑗) by (29);

     end  if

    end  for

   end  for