1 | Initialize R P k ={1,⋯,M k }, T mac(k)=0 and \(\widehat {T}_{\text {mac}}(k)={T}_{b}(k)\), estimate the transmission rate \(\widehat {r}_{k}.\) |
2 | Calculate the transmission capacity \(c_{k}=\widehat {T}_{\text {mac}}(k) \times \widehat {r}_{k}.\) |
3 | Determine optimal packet scheduling strategy τ k for the packets in R P k . |
4 | Update the set of unscheduled packets R P k according to τ k and determine the number of frames that these new scheduled packets are attributed to, N mac(k). |
5 | Calculate the playback time that these new received packets can support, \(\widehat {T}_{\text {mac}}(k)=N_{\text {mac}}(k)/F_{pr}\). F pr is the playback frame rate. |
6 | Update the playback time that the packets in the MAC queue can support, \(T_{\text {mac}}(k)=T_{\text {mac}}(k)+\widehat {T}_{\text {mac}}(k)\). |
7 | If \(\widehat {T}_{\text {mac}}(k)>0\) and R P k ≠∅, it means that during the time interval \(\widehat {T}_{\text {mac}}(k)\), the packets left in R P k still have the chance to be scheduled. |
8 | Do step 2, 3, 4, 5, 6. |
9 | End for If |
10 | Output R P k and T mac(k) |