Service scheduling method and apparatus

1 . A service scheduling method, applied to a wireless fidelity (Wi-Fi) network system, the service scheduling method comprising:

obtaining, by a sending node, a waiting delay and a category of each data frame in a plurality of data frames at a current moment, wherein the waiting delay of the data frame is a duration in which the data frame waits for being scheduled by the sending node;

determining, by the sending node, a service priority of each data frame based on the category of each data frame;

determining, by the sending node from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame, wherein the preset delay of the data frame is a preset upper limit value of a waiting delay, and the preset upper limit value of the waiting delay is less than a communication delay of the data frame; and

sending, by the sending node, the target frame to a receiving node at the current moment.

2 . The service scheduling method according to claim 1 , wherein the determining, by the sending node from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame comprises:

comparing, by the sending node, a value relationship between the waiting delay of each data frame and the preset delay of the data frame; and

determining, by the sending node, the target frame based on a comparison result and the service priority of each data frame.

3 . The service scheduling method according to claim 2 , wherein the determining, by the sending node, the target frame based on a comparison result and the service priority of each data frame comprises:

determining, by the sending node when determining that the plurality of data frames comprise candidate data frames, that the target frame is a data frame with a highest service priority in the candidate data frames, wherein a waiting delay of the candidate data frame is longer than a preset delay of the candidate data frame.

4 . The service scheduling method according to claim 2 , wherein the determining, by the sending node, the target frame based on a comparison result and the service priority of each data frame comprises:

determining, by the sending node when determining that the waiting delay of each data frame in the plurality of data frames is less than the preset delay of the data frame, that the target frame is a data frame with a highest service priority and a longest waiting delay in the plurality of data frames.

5 . The service scheduling method according to claim 1 , wherein the obtaining, by the sending node, a category of each data frame comprises:

determining, by the sending node, the category of each data frame based on the communication delay of each data frame, wherein communication delays of data frames of one category belong to one preset delay range; or

determining, by the sending node, a service type of each data frame, and determining the category of each data frame based on the service type of each data frame, wherein data frames of one category have a same service type.

6 . The service scheduling method according to claim 1 , wherein the service scheduling method further comprises:

determining, by the sending node, a service scenario of each data frame; and

performing, by the sending node, the following steps for the service scenario of each data frame:

establishing, by the sending node when determining that stored sessions do not comprise a session of a first service scenario of a first data frame, the session of the first service scenario with the receiving node, wherein the first data frame is any one of the plurality of data frames, and the session of the first service scenario is for the sending node to transmit a data frame of the first service scenario to the receiving node.

7 . The service scheduling method according to claim 6 , wherein when the sending node is an access point and the receiving node is a station, the service scheduling method further comprises:

sending, by the sending node, scheduling information to the receiving node when determining that duration in which no data frame of the first service scenario is received is longer than a preset delay of the first data frame in the session of the first service scenario, wherein the scheduling information indicates that the receiving node feeds back data information of the first service scenario to the sending node; and

receiving, by the sending node, feedback information from the receiving node, wherein the feedback information comprises the data frame of the first service scenario.

8 . The service scheduling method according to claim 7 , wherein the service scheduling method further comprises:

receiving, by the sending node, indication information from the receiving node, wherein the indication information is sent when determining that duration in which no data frame of the first service scenario is sent is longer than a delay threshold in the session of the first service scenario, and a value of the delay threshold is less than the preset delay of the first data frame; and

restarting, by the sending node after receiving the indication information, timing for the duration in which no data frame of the first service scenario is received.

9 . A service scheduling apparatus, used in a sending node, wherein the sending node is used in a wireless fidelity (Wi-Fi) network system, and the apparatus comprises:

a processor, configured to obtain a waiting delay and a category of each data frame in a plurality of data frames at a current moment, determine a service priority of each data frame based on the category of each data frame, and determine, from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame, wherein the waiting delay of the data frame is a duration in which the data frame waits for being scheduled by the processor, the preset delay of the data frame is a preset upper limit value of a waiting delay, and the preset upper limit value of the waiting delay is less than a communication delay of the data frame; and

a transmit circuit, configured to send, to a receiving node at the current moment, the target frame determined by the processor.

10 . The service scheduling apparatus according to claim 9 , wherein the processor is specifically configured to:

compare a value relationship between the waiting delay of each data frame and the preset delay of the data frame; and

determine the target frame based on a comparison result and the service priority of each data frame.

11 . The service scheduling apparatus according to claim 10 , wherein the processor is specifically configured to:

determine, when determining that the plurality of data frames comprise candidate data frames, that the target frame is a data frame with a highest service priority in the candidate data frames, wherein a waiting delay of the candidate data frame is longer than a preset delay of the candidate data frame.

12 . The service scheduling apparatus according to claim 10 , wherein the processor is specifically configured to:

determine, when determining that the waiting delay of each data frame in the plurality of data frames is less than the preset delay of the data frame, that the target frame is a data frame with a highest service priority and a longest waiting delay in the plurality of data frames.

13 . The service scheduling apparatus according to claim 9 , wherein the processor is specifically configured to:

determine the category of each data frame based on the communication delay of each data frame, wherein communication delays of data frames of one category belong to one preset delay range; or

determine a service type of each data frame, and determine the category of each data frame based on the service type of each data frame, wherein data frames of one category have a same service type.

14 . The service scheduling apparatus according to claim 9 , wherein the processor is further configured to:

determine a service scenario of each data frame; and

perform the following steps for the service scenario of each data frame:

establishing, when determining that stored sessions do not comprise a session of a first service scenario of a first data frame, the session of the first service scenario with the receiving node, wherein the first data frame is any one of the plurality of data frames, and the session of the first service scenario is for transmitting a data frame of the first service scenario to the receiving node.

15 . The service scheduling apparatus according to claim 14 , wherein when the sending node is an access point and the receiving node is a station, the service scheduling apparatus further comprises a receive circuit, wherein

the transmit circuit is further configured to send scheduling information to the receiving node when determining duration in which no data frame of the first service scenario is received is longer than a preset delay of the first data frame in the session of the first service scenario, wherein the scheduling information indicates that the receiving node feeds back data information of the first service scenario to the transmit circuit; and

the receive circuit is configured to receive feedback information from the receiving node, wherein the feedback information comprises the data frame of the first service scenario.

16 . The service scheduling apparatus according to claim 15 , wherein

the receive circuit is further configured to receive indication information from the receiving node, wherein the indication information is sent when determining that duration in which no data frame of the first service scenario is sent is longer than a delay threshold in the session of the first service scenario, and a value of the delay threshold is less than the preset delay of the first data frame; and

the processor is further configured to restart, after the indication information is received, timing for the duration in which no data frame of the first service scenario is received.

17 . A service scheduling apparatus, comprising:

a processor; and

a memory coupled to the processor storing computer program code, and the computer program code comprised of computer instructions that, when executed by the processor, cause the service scheduling apparatus to perform operations comprising:

obtaining a waiting delay and a category of each data frame in a plurality of data frames at a current moment;

determining a service priority of each data frame based on the category of each data frame;

determining, from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame, wherein the waiting delay of the data frame is duration in which the data frame waits for being scheduled by the processor, the preset delay of the data frame is a preset upper limit value of a waiting delay, and the preset upper limit value of the waiting delay is less than a communication delay of the data frame; and

sending, to a receiving node at the current moment, the target frame determined by the processor.

18 . A computer-readable storage medium, wherein the computer-readable storage medium comprises computer instructions; and when the computer instructions are run on a service scheduling apparatus, the service scheduling apparatus is caused to:

obtain a waiting delay and a category of each data frame in a plurality of data frames at a current moment;

determine a service priority of each data frame based on the category of each data frame;

determine, from the plurality of data frames, a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame, wherein the waiting delay of the data frame is duration in which the data frame waits for being scheduled by the processor, the preset delay of the data frame is a preset upper limit value of a waiting delay, and the preset upper limit value of the waiting delay is less than a communication delay of the data frame; and

send, to a receiving node at the current moment, the target frame determined by the processor.

19 . The service scheduling apparatus according to claim 17 , wherein the determining a target frame that is preferentially sent at the current moment based on the waiting delay, a preset delay, and the service priority of each data frame comprises:

comparing a value relationship between the waiting delay of each data frame and the preset delay of the data frame; and

determining the target frame based on a comparison result and the service priority of each data frame.

20 . The service scheduling apparatus according to claim 19 , wherein the determining the target frame based on a comparison result and the service priority of each data frame comprises:

determining, when determining that the plurality of data frames comprise candidate data frames, that the target frame is a data frame with a highest service priority in the candidate data frames, wherein a waiting delay of the candidate data frame is longer than a preset delay of the candidate data frame.