The invention requests to protect an equal priority
packet scheduling strategy based on dynamic adjustment of a cache region, and belongs to the technical field of
network communication and
data exchange. According to the strategy, on the premise that the equal priority
data scheduling fairness is guaranteed, the
resource allocation weight of each group can be calculated by relying on a cache region dynamic adjustment mechanism and combining real-time loads, then efficient scheduling of
data transmission is achieved, and the scheduling efficiency is improved. In order to solve the problems of cache congestion and resource waste under the same priority scene, the method provides an innovative technical path, and comprises the following steps of: according to
system parameter configuration, obtaining a data packet state table for randomly and dynamically generating data packets;
simulation is started according to the data packet state table, the current initial time is 0, whether a data packet is received at present is judged, the data packet is received, and the data packet is classified into a corresponding
priority queue according to the
priority number. And calculating whether the priority buffer area in the time period corresponding to the packet needs to be changed when the packet arrives. And judging whether the data packets in the low-priority queues are subjected to priority improvement or not. And traversing the priority queues from high to low, and arranging a packet taking sequence according to the
priority scheduling factor for the same priority. A data packet is selected and taken out, and a SEG-DCAS
queue scheduling
algorithm is completed; the method improves the
system throughput, is small in calculation amount, and is easy for
engineering realization.