Layout-Independent Wireless Facility Constructing and Scheduling for Data Center Networks

Algorithm 2

Route calculation.

   Input: Topology graph , , route length limit

   Output: a set of routes for

(1) Tabu list , Route set , Node set ;

(2) for each node in set do

(3)  if the length of the path from to is larger than

    then

(4)    Break;

(5)  end

(6)  for each neighbor a of node do

(7)    if a is equal to then

(8)     Add the path from to in the tree to ;

(9)     Add the nodes in the path to except ;

(10)   else

(11)     if a is already included in then

(12)      Cut and the subtree rooted at from

        the tree;

(13)     end

(14)   end

(15)   Add to if ;

(16)  end

(17)  Remove from ;

(18) end

(19) Return