She makes herself – at most – available.
In this example, the available MASs in I 1 are insufficient (m1 = 4).
In this example, I 2 in SF1 has available MASs that meet the requirement.
To find available MASs, this policy tries equal and then higher-indexed isozones in SF0 first.
where y j is the number of available MASs in each zone with I j.
We denote the number of available MASs for BE traffic in SF0, SF1, and SF2 on each MAS index q ∈ {1,...., M} by N q ∈ {0, 1, 2, 3} and classify the MASs on an SF into as a set of S N q ⊂ { 1, …, M }, where M is the maximum number of MASs in an SF.
The number of available MASs with isozone j, denoted by m j, is expressed as m j = 2 j y j, y j ∈ { 0, …, 16 }, (4).
Incoming BE flows share available MASs with other existing BE flows in a fair manner, and do not follow the symmetric assignment property.
where P SF is the number of assigned resources, A S F the set of available isozones j with each SF, and mj,lthe available MASs with I j and SF l.
The first arriving flow 1 in Figure 11a transmits through six MASs sequentially, i.e. SF2, SF0, SF0, SF0, X, SF0, X, SF0, where X indicates 'not available' MAS at the given time.
