Method for scheduling packet feedback based on short time fairness

Abstract

The invention discloses a packet feedback scheduling method based on short-term fairness. The method quotes actual service amount obtained at various clients as feedback information, and weights wi' of the clients in a scheduler are adjusted by judging whether the clients obtain fair service; when the clients fail to reach the service amount specified by preset weights wi of the clients, the system correspondingly increases the weights wi' of the clients in the scheduler to compensate the bandwidth obtained by the allocation; and when the service amount obtained by the clients exceeds that specified by the preset weights wi, the system correspondingly reduces the weights wi' of the clients in the scheduler to reduce the bandwidth obtained by the allocation to implement the punishment. In the method, the weights of the clients in the scheduler can perform on-line adjustment according to the actual service amount obtained by the clients, which strengthens the robustness and the self-adaptability of the system, improves the ability of the system to realize the short-term fairness at the same time, and provides more fair QoS for the clients.

Description

technical field

[0001] The invention belongs to the field of router queue management and packet scheduling, in particular to a packet feedback scheduling method based on short-term fairness. Background technique

[0002] The Quality of Service (QoS) of a computer network refers to a series of service requests that the network needs to meet in the process of transmitting data streams. Specifically, it can be quantified as bandwidth, packet delay, delay jitter, packet loss rate, throughput, etc.

[0003] In the early days of the development of Internet technology, the main business scope was focused on some specific application systems without time limit, such as web browsing, file transfer protocol, e-mail, etc. These services were not sensitive to the QoS of the network, and the network structure at that time was simple. Bandwidth is also very limited. However, with the rapid development of high-speed network technology and multimedia technology, many application services ...

Examples

Embodiment Construction

[0071] specific implementation

[0072] According to the existing literature on the WF2Q+ algorithm, we can draw the control block diagram of the WF2Q+ algorithm as follows figure 1 . Among them, the kernel of the scheduler is the scheduling mechanism of WF2Q+, which uses the minimum qualified virtual completion time mechanism. And its input is the preset weight w of each data source i , the output is the packet of the data source selected by the scheduler (i.e. the kth packet of data source i). From the control block diagram of the WF2Q+ algorithm, we can see that the existing WF2Q+ algorithm is an open-loop control and has no feedback link. Therefore, when a new client joins the cache queue, its non-empty queue changes, and the WF2Q+ controller cannot obtain information in time, which makes the system unable to adapt, and the short-term fairness is poor.

[0073] In order to enhance the robustness and adaptability of the WF2Q+ algorithm, we redesigned the fixed schedul...

technical field

[0001] The invention belongs to the field of router queue management and packet scheduling, in particular to a packet feedback scheduling method based on short-term fairness. Background technique

[0002] The Quality of Service (QoS) of a computer network refers to a series of service requests that the network needs to meet in the process of transmitting data streams. Specifically, it can be quantified as bandwidth, packet delay, delay jitter, packet loss rate, throughput, etc.

[0003] In the early days of the development of Internet technology, the main business scope was focused on some specific application systems without time limit, such as web browsing, file transfer protocol, e-mail, etc. These services were not sensitive to the QoS of the network, and the network structure at that time was simple. Bandwidth is also very limited. However, with the rapid development of high-speed network technology and multimedia technology, many application services ...

Examples

Embodiment Construction

[0071] specific implementation

[0072] According to the existing literature on the WF2Q+ algorithm, we can draw the control block diagram of the WF2Q+ algorithm as follows figure 1 . Among them, the kernel of the scheduler is the scheduling mechanism of WF2Q+, which uses the minimum qualified virtual completion time mechanism. And its input is the preset weight w of each data source i , the output is the packet of the data source selected by the scheduler (i.e. the kth packet of data source i). From the control block diagram of the WF2Q+ algorithm, we can see that the existing WF2Q+ algorithm is an open-loop control and has no feedback link. Therefore, when a new client joins the cache queue, its non-empty queue changes, and the WF2Q+ controller cannot obtain information in time, which makes the system unable to adapt, and the short-term fairness is poor.

[0073] In order to enhance the robustness and adaptability of the WF2Q+ algorithm, we redesigned the fixed schedul...

Images