Hybrid network flow scheduling method and switch

Abstract

The embodiment of the present invention discloses a hybrid network flow scheduling method. The hybrid network flow includes three network flows of type 1, type 2 and type 3, wherein the type 1 network flow is a network flow with a deadline, and the The type 2 network flow is a network flow with no deadline but a known size, the type 3 network flow is a network flow with no deadline and an unknown size, and the mixed network flow is transmitted on a link, and the link has a bandwidth , the scheduling method includes: assigning the type 1 network flow to the queue with the highest priority, calculating a congestion window according to a formula, occupying the bandwidth corresponding to the congestion window and sending the type 1 network flow to the link Network flow; assign the type 2 and type 3 network flows to other priority queues, occupy the type 1 network flow and use the remaining bandwidth to send the type 2 and type 3 network flows to the link; this The embodiment of the invention also discloses a switch. By adopting the invention, the FCT of the network flow without the deadline can be improved while most of the network flows with the deadline are completed before the deadline.

Description

technical field [0001] The invention relates to the communication field, in particular to a hybrid network flow scheduling method and a switch. Background technique [0002] A cloud application injects a network flow into a data center network (DCN, Datacenter Network). The network flows can be divided into three categories. [0003] Type 1: Network streams with deadlines. For some applications, such as web search, recommendation, and advertisement, the generated web streams usually have deadlines. The size of these network streams with deadlines is also usually easy to obtain in advance. For these applications, delay will affect their user experience. Therefore, these applications will set some delay conditions for network streams, such as deadlines. For traffic that only contains this type of network flow, an algorithm based on EDF (Earliest Deadline First, the earliest deadline first) (for example, pFabric that gives higher priority to network flows with earlier deadl...

AI Technical Summary

Problems solved by technology

PIAS works for network flows of unknown size, but not for others

PIAS treats all network flows as network flows with neither deadline nor size, which obviously affects network flows with no deadline

[0020] In addition to not being able to handle mixed flows well, many of the above scheduling algorithms require significant changes to switches, or complex control planes to set rates for each network flow, which makes them ineffective in practical applications. difficult to implement

[0021] All in all, existing scheduling algorithms cannot satisfy the following three requirements at the same time:

Images