Database Reference
In-Depth Information
Figure 7.7 Bandwidth scheduling algorithm for “lazy” data transfer
startTime and deadline , the bandwidth scheduling is conducted based on the new over-
all agenda (line 14) until all the bandwidth for transferring the data file is allocated.
The complexity of the bandwidth scheduling algorithm is O ( nm 2 ).
In Figure 7.8 , we present a bandwidth scheduling process to better illustrate the
algorithm. Take the agenda example shown in Figure 7.4 as the overall agenda of the
link for transferring data file D from device A to device B . maximumBW is initialized
as the maximum transfer speed between A and B whereas minimumBW is calculated
according to the maximum data transfer duration and the data file size. The start time
Figure 7.8 Bandwidth scheduling process example
Search WWH ::




Custom Search