Network flow scheduling method, device and computer readable medium

Abstract

The invention provides a network flow scheduling method, device and computer-readable medium. The method includes: determining at least two network flows that currently need to be transmitted in order; determining the proportional relationship between the number of data packets contained in each of the at least two network flows; according to each of the network flows in the proportional relationship Obtain the reference number corresponding to the proportional coefficient and create a scheduling array according to the reference number; fill in the sequence numbers of the at least two network flows as elements in the scheduling array in order, wherein the sequence number of each network flow is in the The number in the scheduling array is the same as the number of data packets it contains; according to the scheduling array, a scheduling result is obtained through a randomized algorithm; and the at least two network streams are transmitted according to the scheduling result. The scheme of the invention can realize fair scheduling of network flows.

Description

technical field [0001] The present invention relates to the field of network transmission, and in particular, to a network flow scheduling method, device and computer-readable medium. Background technique [0002] On the same physical port, in order to simulate a real network environment with a high degree of discretization and randomization, users may configure many streams. For the scheduling of a large number of flows, the currently commonly used scheduling methods are sequential scheduling or interspersed scheduling according to the proportional relationship of the flows. [0003] However, whether it is sequential scheduling or interspersed scheduling, the first scheduled flow is always the first flow. From the perspective of fairness and randomness, such scheduling methods cannot achieve fair scheduling. [0004] Therefore, a method is needed to achieve fair scheduling of network flows. SUMMARY OF THE INVENTION [0005] Embodiments of the present invention provide a...

AI Technical Summary

Problems solved by technology

[0003] However, whether it is sequential scheduling or interspersed scheduling, the first scheduled flow is always the first flow. From the perspective of fairness and randomness, such a scheduling method cannot achieve fair scheduling.

Images