Dynamic Packet Prioritization Preventing Queue Starvation

The patent applies dynamics by making the value of n adaptive rather than fixed. The system dynamically adjusts n based on real-time network conditions, specifically monitoring the state of high and low priority queues. When the high priority queue accumulates too many packets, n is reduced to allow low priority queue service; when the high priority queue is clear, n is increased to accelerate mice flows. This dynamic adjustment resolves the contradiction between accelerating mice flows and preventing low priority queue starvation.

The patent changes the parameter n based on system state. By monitoring queue lengths and adjusting n accordingly, the system transitions between different prioritization intensities. This parameter change allows the system to optimize mice flow acceleration when conditions permit while preventing low priority queue starvation when high priority traffic dominates, thus resolving the technical contradiction.

The system dynamically adjusts n upward when the high priority queue is empty or has few packets, allowing mice flows to receive sufficient prioritization for acceleration. When high priority traffic increases, n is reduced to ensure low priority queue service. This dynamic behavior resolves the contradiction by adapting prioritization intensity to current traffic conditions rather than using a fixed conservative value.

The patent implements parameter changes by adjusting n based on queue state monitoring. When conditions are favorable (low high priority queue occupancy), n is increased to maximize mice flow acceleration. When high priority traffic dominates, n is decreased to prevent low priority queue starvation. This parameter adaptation resolves the contradiction between preventing starvation and accelerating mice flows.

The patent implements periodic action by intermittently servicing the low priority queue based on the state of the high priority queue. Instead of continuous strict priority service, the system periodically allows low priority queue service when the high priority queue is empty or below a threshold. This periodic interruption of strict priority service prevents low priority queue starvation while maintaining mice flow reliability during critical periods.

The patent uses the high priority queue state as an intermediary condition to control access to the low priority queue. The state of the high priority queue mediates whether packets from the low priority queue can be serviced. This intermediary mechanism allows the system to balance between protecting mice flows (when high priority queue is clear) and preventing low priority queue starvation (when high priority queue is occupied), resolving the contradiction between reliability and starvation prevention.