Base Station Throughput Scheduling Buffering

The patent applies local quality by making the tail packet removal determination dependent on the local condition of whether the buffer is empty. This local condition (buffer empty status) serves as a quality indicator that determines whether tail packet removal should be applied, thereby adapting the statistical method to different packet-incoming scenarios (centralized vs. discrete) while maintaining measurement precision in each specific context

The patent changes the parameter used for tail packet removal determination from a fixed rule to a dynamic parameter (buffer empty status). By monitoring whether the buffer is empty or not, the system adapts its behavior to match the actual traffic pattern, enabling accurate performance measurement across varying scenarios without requiring separate statistical methods for each scenario type

The patent extracts and removes the tail packet from the statistical calculation when the buffer becomes empty. This extraction principle eliminates the harmful effect of including small packets in discrete scenarios that would otherwise distort the scheduled throughput index, while maintaining the productivity of continuous scheduling operations in centralized scenarios where the buffer remains non-empty

Instead of removing tail packets based on absolute packet size thresholds, the patent inverts the approach by removing tail packets based on the buffer empty status condition. This inversion allows the system to distinguish between meaningful small packets in centralized scenarios (where buffer remains full) and insignificant small packets in discrete scenarios (where buffer becomes empty), thereby improving measurement precision without sacrificing scheduling efficiency