Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis

Algorithm 1

HPARND-BL.

(1)   Solve PAR ⇒(𝑠𝑡𝑎𝑡𝑢𝑠,𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛);

(2)   Remove PICs to match flows and set FE=∅ and FV={𝑣:𝑣∉𝑇𝑁};

(3)   Initialize 𝑃𝑟𝑒𝑣_𝑐𝑜𝑛𝑠=𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛;

(4)   repeat

(5)  Sort vertices (greatest spare capacity);

(6)  repeat

(7)   Disable the first vertex ∉FV →𝑣;

(8)   Set FV=FV∪𝑣;

(9)   Solve PAR ⇒(𝑠𝑡𝑎𝑡𝑢𝑠,𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛);

(10)  if (𝑠𝑡𝑎𝑡𝑢𝑠==𝑆𝑜𝑙𝑣𝑒_𝑆𝑢𝑐𝑐𝑒𝑒𝑑𝑒𝑑 AND 𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛<𝑃𝑟𝑒𝑣_𝑐𝑜𝑛𝑠) then

(11)    Remove vertex 𝑣;

(12)    Update 𝑃𝑟𝑒𝑣_𝑐𝑜𝑛𝑠=𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛;

(13)  else

(14)    Enable vertex 𝑣;

(15)  end if

(16)  until (𝑠𝑡𝑎𝑡𝑢𝑠==𝑆𝑜𝑙𝑣𝑒_𝑆𝑢𝑐𝑐𝑒𝑒𝑑𝑒𝑑 OR FV==𝑉)

(17)  until (FV==𝑉)

(18)  repeat

(19)  Sort links (greatest spare capacity);

(20)  repeat

(21)   Select the first link ∉FE →𝑢𝑣;

(22)   Disable one PIC from selected link 𝑢𝑣;

(23)   Solve PAR ⇒(𝑠𝑡𝑎𝑡𝑢𝑠,𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛);

(24)   if (𝑠𝑡𝑎𝑡𝑢𝑠==𝑆𝑜𝑙𝑣𝑒_𝑆𝑢𝑐𝑐𝑒𝑒𝑑𝑒𝑑 AND 𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛<𝑃𝑟𝑒𝑣_𝑐𝑜𝑛𝑠) then

(25)    Remove PIC from 𝑢𝑣;

(26)    Update 𝑃𝑟𝑒𝑣_𝑐𝑜𝑛𝑠=𝑃𝑜𝑤𝑒𝑟_𝐶𝑜𝑛𝑠𝑢𝑚𝑝𝑡𝑖𝑜𝑛;

(27)   else

(28)    Enable PIC and FE=FE∪𝑢𝑣;

(29)   end if

(30)  until (𝑠𝑡𝑎𝑡𝑢𝑠==𝑆𝑜𝑙𝑣𝑒_𝑆𝑢𝑐𝑐𝑒𝑒𝑑𝑒𝑑 OR FE==𝐸)

(31)  until (FE==𝐸)