Discovering the Influences of Complex Network Effects on Recovering Large Scale Multiagent Systems

Algorithm 3

𝐶𝑜𝑛𝑔𝑒𝑠𝑡𝑖𝑜𝑛(𝑖,𝑗).

(1) 𝜇←𝑤;

(2) for each agent 𝑖∈𝑠(𝑖)  do

(3) if agent 𝑖 was not been visited then

(4)  𝑥←𝐹_max−(𝜇+𝑓(𝑖,𝑗));

(5)  if  𝑥<0  then

(6)   𝜀←𝐹_max−𝑓(𝑖,𝑗);

(7)   return the link (𝑖,𝑗) is congested;

(8)  end  if

(9)  if  𝜇≠0  then

(10)    𝑡←𝐶_max−(𝜀+𝑟(𝑗));

(11)   end  if

(12)   if  𝑡≤0  then

(13)   return the agent 𝑗 is congested;

(14)   else

(15)   if  𝑡≤𝜀  then

(16)    𝜇←𝑡;

(17)    return the agent 𝑗 is congested;

(18)   else

(19)    𝜇←𝜀;

(20)   end  if

(21)  end  if

(22) end  if

(23) end  for