As mentioned above, high buffer occupancy is undesirable in a shared-media network so that each neighboring node should have only a buffer space reservation; hence, a maximum m equal to the number of its neighboring nodes while a minimum m equal to 1 in the case of Tc = 1.
The buffer occupancy is then discretized with a discretization interval Δ such that l = L/Δ>>1 is an integer.
In addition, they have a shared buffer, where the priority of the shared buffer occupancy is to HPC traffic.
Here, the EF buffer occupancy is reduced compared with the RR and static WRR.
However, in real hardware, the buffer depth is always finite and the buffer occupancy is time-varying.
The idea is that if the buffer occupancy is low and the frame is not complex, then QP is reduced by 1 to improve the visual quality.
If the buffer occupancy is high and the frame complexity is high, then QP is adjusted by 1 to reduce excessive buffer fill-up.
Let F k (x) denote the stationary probability that the buffer occupancy is less than or equal to x, given that the video source is in state k.
However, in practical systems, the client buffer occupancy is one of the most important factors to help ensure good communication quality.
For example, if a Fano decoder ℱ m finishes decoding one codeword and its input buffer occupancy is lower than that of another input buffer, i.e., ℬ n, it is possible to schedule the decoder ℱ m to help decoding another codeword in the input buffer ℬ n, thus to reduce Q n to avoid potential buffer overflow or frame erasure.
