Journal of Electrical and Computer Engineering

Research Article

Multidomain Hierarchical Resource Allocation for Grid Applications

Algorithm 1

Resource allocation greedy algorithm.
1: Set 𝑅 𝑒 π‘ž 𝑒 𝑒 𝑠 𝑑 𝐿 𝑖 𝑠 𝑑 = { }
2: Calculate 𝛼 𝑖 βˆ’ 𝐿 𝑖 , βˆ€ 𝑖 ∈ 1 , . . . , 𝑛
3: while 𝛼 𝑖 βˆ’ 𝐿 𝑖 β‰  0 , βˆ€ 𝑖 ∈ 1 , . . . , 𝑛 do
4 ∢  Set 𝑑 𝑒 𝑠 𝑑 = 𝑖 , such that ( 𝛼 𝑖 βˆ’ 𝐿 𝑖 ) is max
5 ∢  Set 𝑆 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 𝐿 𝑖 𝑠 𝑑 = { 𝑖 } , βˆ€ 𝑖 ∈ 1 , . . . , 𝑛 & 𝛼 𝑖 βˆ’ 𝐿 𝑖 ≀ 0
6 ∢  for each 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 ∈ 𝑆 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 𝐿 𝑖 𝑠 𝑑 do
7 ∢ Calculate 𝑃 π‘Ž 𝑑 β„Ž 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 , 𝑑 𝑒 𝑠 𝑑 and
𝑃 π‘Ž 𝑑 β„Ž π‘Š π‘Ž 𝑖 𝑑 𝑖 𝑛 𝑔 𝑇 𝑖 π‘š 𝑒 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 , 𝑑 𝑒 𝑠 𝑑
8 ∢  end for
9 ∢ Select 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 from 𝑆 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 𝐿 𝑖 𝑠 𝑑 such that
   𝑃 π‘Ž 𝑑 β„Ž π‘Š π‘Ž 𝑖 𝑑 𝑖 𝑛 𝑔 𝑇 𝑖 π‘š 𝑒 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 , 𝑑 𝑒 𝑠 𝑑 is minimum
1 0 ∢ Set 𝑉 π‘Ž 𝑙 𝑒 𝑒 𝑇 π‘œ 𝑇 π‘Ÿ π‘Ž 𝑛 𝑠 𝑓 𝑒 π‘Ÿ = π‘š 𝑖 𝑛 [ π‘Ž 𝑏 𝑠 ( 𝛼 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 βˆ’
   𝐿 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 ) , π‘Ž 𝑏 𝑠 ( 𝛼 𝑑 𝑒 𝑠 𝑑 βˆ’ 𝐿 𝑑 𝑒 𝑠 𝑑 ) ]
1 1 ∢   𝑅 𝑒 π‘ž 𝑒 𝑒 𝑠 𝑑 𝐿 𝑖 𝑠 𝑑 + = 𝑛 𝑒 𝑀 𝑇 π‘Ž 𝑠 π‘˜ ( 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 , 𝑑 𝑒 𝑠 𝑑 ,
    𝑉 π‘Ž 𝑙 𝑒 𝑒 𝑇 π‘œ 𝑇 π‘Ÿ π‘Ž 𝑠 𝑓 𝑒 π‘Ÿ , 𝑃 π‘Ž 𝑑 β„Ž 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 , 𝑑 𝑒 𝑠 𝑑 , 𝑇 π‘Ÿ π‘Ž 𝑛 𝑠 𝑓 𝑒 π‘Ÿ 𝑇 𝑖 π‘š 𝑒 )
1 2 ∢  Set 𝐿 𝑠 π‘œ 𝑒 π‘Ÿ 𝑐 𝑒 βˆ’ = 𝑉 π‘Ž 𝑙 𝑒 𝑒 𝑇 π‘œ 𝑇 π‘Ÿ π‘Ž 𝑛 𝑠 𝑓 𝑒 π‘Ÿ
1 3 ∢  Set 𝐿 𝑑 𝑒 𝑠 𝑑 + = 𝑉 π‘Ž 𝑙 𝑒 𝑒 𝑇 π‘œ 𝑇 π‘Ÿ π‘Ž 𝑛 𝑠 𝑓 𝑒 π‘Ÿ
1 4 ∢  Update links with the new reservations
15: end while
16: Populate 𝑅 𝑒 π‘ž 𝑒 𝑒 𝑠 𝑑 𝐿 𝑖 𝑠 𝑑