Search

CN-120711538-B - Scheduling method, system and device

CN120711538BCN 120711538 BCN120711538 BCN 120711538BCN-120711538-B

Abstract

The application discloses a scheduling method, a scheduling system and a scheduling device, which are used for providing a feasible way for avoiding random back-off conflict of an air interface. The method comprises the steps that a control node receives service information respectively reported by N network nodes, wherein the service information is used for indicating information of service data which needs to be transmitted by the network nodes through channels, N is a positive integer, the control node determines M network nodes scheduled in a current scheduling period according to the service information respectively reported by the N network nodes, M is a positive integer, and the control node sends first scheduling information to the M network nodes, wherein the first scheduling information is used for indicating permission of the M network nodes to compete for channels.

Inventors

  • CHEN JINDOU
  • Gan shuang
  • SI XIAOSHU

Assignees

  • 华为技术有限公司

Dates

Publication Date
20260505
Application Date
20220223

Claims (16)

  1. 1. The scheduling system is characterized by comprising a control node and N network nodes, wherein N is a positive integer, the control node is connected with the N network nodes through optical fibers, each network node in the N network nodes is communicated with a terminal device through a channel, and the control node is used for scheduling the N network nodes to perform channel competition; The N network nodes are used for reporting service information to the control node respectively; The control node is configured to: receiving service information respectively reported by the N network nodes; According to the service information respectively reported by the N network nodes, M network nodes scheduled in the current scheduling period are determined, wherein M is a positive integer, and M is smaller than or equal to N; Sending a first scheduling message to the M network nodes; Receiving first response messages respectively reported by the M network nodes; according to the first response message and the service information, P network nodes scheduled in the next scheduling period are determined, wherein P is a positive integer, and P is smaller than or equal to N; And sending a second scheduling message to the P network nodes.
  2. 2. The system of claim 1, wherein the first response message is for indicating that the network node contends for the channel.
  3. 3. The system of claim 2, wherein the second scheduling message is used to indicate that the P network nodes are allowed to contend for a channel.
  4. 4. A system according to any of claims 1-3, wherein said M network nodes are further adapted to receive said first scheduling message and to contend for a channel in accordance with said first scheduling message, respectively.
  5. 5. A system according to any one of claims 1-3, characterized in that the N network nodes are specifically configured to periodically report traffic information to the control node, respectively.
  6. 6. A system according to any of claims 1-3, characterized in that the service information comprises at least one of a service type, a service traffic, a service delay, a service priority.
  7. 7. A system according to any of claims 1-3, characterized in that the traffic information is information indicating traffic data that the network node needs to transmit over a channel.
  8. 8. A system according to any of claims 1-3, characterized in that the first scheduling message is used to indicate that the M network nodes are allowed to contend for a channel.
  9. 9. The scheduling method is characterized by being applied to a scheduling system, the system comprises a control node and N network nodes, N is a positive integer, the control node is connected with the N network nodes through optical fibers, each network node in the N network nodes is communicated with terminal equipment through channels, the control node is used for scheduling the N network nodes to conduct channel competition, and the method comprises the following steps: the N network nodes report service information to the control node respectively; The control node receives service information respectively reported by the N network nodes, and determines M network nodes scheduled in a current scheduling period according to the service information respectively reported by the N network nodes, wherein M is a positive integer, and M is smaller than or equal to N; Receiving first response messages respectively reported by the M network nodes; according to the first response message and the service information, P network nodes scheduled in the next scheduling period are determined, wherein P is a positive integer, and P is smaller than or equal to N; And sending a second scheduling message to the P network nodes.
  10. 10. The method of claim 9, wherein the first response message is used to indicate that the network node contends for the channel.
  11. 11. The method of claim 10, wherein the second scheduling message is used to indicate that the P network nodes are allowed to contend for a channel.
  12. 12. The method according to any one of claims 9-11, further comprising: The M network nodes respectively receive the first scheduling message and compete for channels according to the first scheduling message.
  13. 13. The method according to any one of claims 9-11, wherein the N network nodes report service information to a control node respectively, specifically comprising: And the N network nodes respectively report the service information to the control node periodically.
  14. 14. The method according to any of claims 9-11, characterized in that the service information comprises at least one of a service type, a service traffic, a service delay, a service priority.
  15. 15. The method according to any of claims 9-11, wherein the traffic information is information indicating traffic data that the network node needs to transmit over a channel.
  16. 16. The method according to any of claims 9-11, wherein the first scheduling message is used to indicate that the M network nodes are allowed to contend for a channel.

Description

Scheduling method, system and device The present application is a divisional application, the application number of which is 202210167775.2, the application date of which is 2022, 02, 23, the entire contents of which are incorporated herein by reference. Technical Field The embodiment of the application relates to the technical field of optical communication, in particular to a scheduling method, a scheduling system and a scheduling device. Background Currently in wireless local area networks (wireless localarea network, WLANs), wireless fidelity (WIRELESS FIDELITY, wi-Fi) channels are commonly shared by Access Points (APs) and Stations (STAs). The AP and STA each use a set of enhanced distributed channel access (enhanced distribution CHANNEL ACCESS, EDCA) parameters to compete for the Wi-Fi channel for transmission opportunities. The AP may adjust EDCA parameters by determining the network status. However, with the development of networks, more devices in a home network, the probability that multiple devices compete for Wi-Fi channels at the same time is also increasing. Multiple devices competing for Wi-Fi channels at the same time may generate random backoff conflict, resulting in packet failure, reducing network throughput, and increasing service delay. Therefore, how to avoid random back-off collision of the air interface, it is worth researching to improve the transmission efficiency in the network. Disclosure of Invention The embodiment of the application provides a scheduling method, a scheduling system and a scheduling device, which are used for providing a feasible way to avoid random back-off conflict of an air interface, so that the transmission efficiency of the whole network in a network can be improved. In a first aspect, the application provides a scheduling method, which comprises the steps that a control node receives service information respectively reported by N network nodes, wherein the service information is used for indicating information of service data which needs to be transmitted by the network nodes through channels, N is a positive integer, the control node determines M network nodes scheduled in a current scheduling period according to the service information respectively reported by the N network nodes, M is a positive integer, M is smaller than or equal to N, and the control node sends first scheduling information to the M network nodes, wherein the first scheduling information is used for indicating permission of the M network nodes to compete for the channels. In the method, centralized control of a plurality of network nodes can be realized through the control nodes in the network, and the sequence of allowing each network node to send data can be decided through statistics of service information of each network node. Thus, in the network, the network node which the control node schedules in each scheduling period is allowed to contend for the channel in the current scheduling period so that data can be transmitted through the channel, and the network node which is not scheduled needs to wait for the scheduling result of the next scheduling period. Compared with the mode that each network node in the related art freely competes for channels, the method can avoid random back-off conflict of air interfaces, each network node can realize sequential transmission of data according to centralized control of the control nodes, and therefore transmission efficiency of the whole network in the network can be improved. In one possible design, the method further comprises the steps that the control node receives first response messages respectively reported by the M network nodes, wherein the first response messages are used for indicating the network nodes to compete for channels, the control node determines P network nodes scheduled in the next scheduling period according to the first response messages and service information respectively reported by the N network nodes, P is a positive integer and is smaller than or equal to N, and the control node sends second scheduling messages to the P network nodes, wherein the second scheduling messages are used for indicating that the P network nodes are allowed to compete for channels. In the design, the control node can timely decide the scheduling result of the next scheduling period according to the state of M network nodes competing channels scheduled in the current scheduling period, so that the transmission efficiency and performance of the whole network can be improved through centralized scheduling control of the control node. In one possible design, the method further comprises the control node updating traffic information of the network node by at least one of: In a first mode, the control node receives second response messages respectively reported by the M network nodes, where the second response messages are used to indicate service information updated by the network nodes before or after the service data transmission in the