Fair flow scheduling algorithm based on smooth time window

Abstract

The invention relates to a fair flow scheduling algorithm based on a smooth time window, which is a packet scheduling algorithm under the busy state of a network, the fair flow scheduling algorithm has higher control precision and fairness and can be used in IP network optimization fields such as harmful network flow purification, flow shaping, service quality assurance and the like.

Description

A Fair Traffic Scheduling Algorithm Based on Smooth Time Window technical field The invention is a data packet scheduling algorithm under the busy state of the network, which has high precision and fairness. It can be used in IP network optimization fields such as harmful network traffic purification, traffic shaping, and service quality assurance. Background technique IP network bandwidth is a scarce resource, but with the popularization of computer networks and the improvement of applications, various useless or harmful network traffic has occupied a large amount of bandwidth resources, making important applications impossible to implement. Therefore, in the busy state of the network, how to effectively schedule in order to maximize the productivity of the network bandwidth has become a topic of concern to us. At present, there are many mature scheduling algorithms, such as FIFO (first in first out), HTB (hierarchical token bucket), RED (random early detection), CBQ (c...

AI Technical Summary

Problems solved by technology

At present, there are many mature scheduling algorithms, such as FIFO (first in first out), HTB (hierarchical token bucket), RED (random early detection), CBQ (class-based queue), SFQ (random fair queue), etc. The algorithm can perform data packet scheduling very well, but there are also some problems, such as poor control accuracy, large fluctuations, difficulty in balancing performance and fairness, and difficulty in deployment.

Images