In particular, they propose efficient heuristic algorithms for scheduling flows in a centrally scheduled multi-hop WiMAX network.
Over this core subcarrier allocation strategy, we assume the use of a simple low-complexity distributed maximal scheduling flow strategy [26].
In addition we utilize the connection-based scheduling flow control scheme that we have presented in the context of WiMAX in [24].
On top of this model, we have applied an existing hybrid design-time/run-time scheduling flow initially developed for multiprocessor systems.
When they are not expected, organizational agents, with enough power to do that, are allowed to modify the scheduled flow of activities for an individual patient under the only constraint of justifying their decision.
Meanwhile, the Scheduler should no longer schedule traffic flows on the link that went down.
To schedule two flows, however, we need to assign three links ℓ1,3, ℓ2,3, and ℓ3,4: one time slot, one time slot, and two time slots, respectively.
To schedule all flows, Algorithm 2 is proposed to assign each link one or more time slots according to the link load.
Figure 8 The schedule period under the link schedule without traffic flows.
In practice, the traffic load through each link can be determined once the routing algorithm terminates correctly, and in general, a link is possibly scheduled multiple times - assigned with multiple time slots - for scheduling all flows.
