Scheduling method, system and device

Abstract

The invention discloses a scheduling method, a scheduling system and a scheduling device, which are used for providing a feasible way to avoid random backoff conflicts of air interfaces. The method comprises: a control node receiving service information reported by N network nodes respectively, the service information being used for indicating information of service data needing to be transmitted by the network nodes through a channel, N being a positive integer; the control node determines M network nodes scheduled in the current scheduling period according to the service information reported by the N network nodes respectively, and M is a positive integer; and the control node sends a first scheduling message to the M network nodes, wherein the first scheduling message is used for indicating that the M network nodes are allowed to compete for channels.

Description

[0001] This application is a divisional application. The application number of the original application is 202411414673.1, and the original application date is October 10, 2024. The entire content of the original application is incorporated into this application by reference. Technical Field

[0002] The embodiments of the present application relate to the field of optical communication technology, and in particular to a scheduling method, system, and device. Background Art

[0003] In current wireless local area networks (WLANs), Wi-Fi channels are typically shared by access points (APs) and stations (STAs). APs and STAs each use a set of enhanced distributed channel access (EDCA) parameters to compete for Wi-Fi channels and obtain transmission opportunities.

[0004] APs can adjust EDCA parameters based on network status. However, with the development of networks and the increasing number of devices in home networks, the probability of multiple devices competing for Wi-Fi channels at the same time is increasing. Multiple devices competing for Wi-Fi channels at the same time can cause random backoff conflicts, leading to packet failures, reduced network throughput, and increased service latency.

[0005] Therefore, it is worth studying how to avoid random backoff conflicts on the air interface and improve the transmission efficiency in the network. Summary of the Invention

[0006] The embodiments of the present application provide a scheduling method, system, and device to provide a feasible way to avoid random backoff conflicts in the air interface, thereby improving the transmission efficiency of the entire network.

[0007] In a first aspect, the present application provides a scheduling method, which includes: a control node receives service information reported respectively by N network nodes, where the service information is used to indicate information about service data that the network node needs to transmit through a channel, and N is a positive integer; the control node determines the M network nodes scheduled in the current scheduling period based on the service information reported respectively by the N network nodes, where M is a positive integer and is less than or equal to N; the control node sends a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for the channel.

[0008] In this method, centralized control of multiple network nodes can be achieved through the control node in the network. By collecting statistics on the service information of each network node, the order in which each network node is allowed to send data can be determined. In this way, in the network, the network nodes scheduled by the control node in each scheduling cycle are allowed to compete for the channel in the current scheduling cycle so that they can send data through the channel, while the network nodes that are not scheduled need to wait for the scheduling results of the next scheduling cycle. Compared with the method of each network node freely competing for the channel in the related art, this method can avoid random backoff conflicts in the air interface. Each network node can achieve sequential data transmission according to the centralized control of the control node, thereby improving the transmission efficiency of the entire network.

[0009] In one possible design, the method also includes: the control node receives a first response message reported respectively by the M network nodes, the first response message being used to indicate that the network node competes for the channel; the control node determines the P network nodes to be scheduled in the next scheduling period based on the first response message and the service information reported respectively by the N network nodes, where P is a positive integer and is less than or equal to N; the control node sends a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for the channel.

[0010] In this design, the control node can make timely decisions on the scheduling results for the next scheduling period based on the status of the M network nodes competing for the channel in the current scheduling period, thereby improving the transmission efficiency and performance of the entire network through centralized scheduling control of the control node.

[0011] In one possible design, the method further includes: the control node updating the service information of the network node by at least one of the following methods:

[0012] Mode 1: The control node receives second response messages reported respectively by the M network nodes, where the second response messages are used to indicate service information updated by the network nodes before or after service data transmission in the current scheduling period is completed;

[0013] Mode 2: The control node receives updated service information periodically reported by the N network nodes.

[0014] In this design, the control node can obtain the latest business status of the network nodes in a timely manner based on the latest business information reported by the network nodes, thereby obtaining more accurate decision-making results and further improving the transmission efficiency of the entire network.

[0015] In one possible design, the service information includes but is not limited to at least one of the following information: service type, service traffic, service delay, and service priority; the control node determines the M network nodes scheduled in the current scheduling period based on the service information respectively reported by the N network nodes, which can be implemented as follows: if the service information respectively reported by the N network nodes contains the service type, the priority of the network node is determined according to the service type and the pre-configured service type priority; if the service information respectively reported by the N network nodes contains the service traffic, the priority of the network node is determined according to the service traffic; if the service information respectively reported by the N network nodes contains the service delay, the priority of the network node is determined according to the service delay; if the service information respectively reported by the N network nodes contains the service priority, the priority of the network node is determined according to the service priority; the control node determines the M network nodes scheduled in the current scheduling period based on the priority of the network node.

[0016] In this design, the control node can more accurately decide the order in which network nodes are scheduled based on the statistical business information of the network nodes, thereby improving the transmission efficiency of the entire network and enhancing network performance.

[0017] In one possible design, before the control node sends the first scheduling message to the M network nodes, the method also includes: if the control node receives a first request message reported by the first network node, or if the control node determines that the service information of the first network node also includes priority request information, then determining that the first network node requests priority occupation of the channel; wherein the first request message or the priority request information is used to request priority occupation of the channel to send or receive first data; after receiving the first indication message reported by the first network node, the control node starts scheduling for the current scheduling period, and the first indication message is used to indicate that the first network node has sent or received the first data; or, after receiving the first indication message reported by the first network node, the control node starts scheduling of the second network node in the current scheduling period, and the second network node and the first network node meet preset conditions; the preset conditions include the following information: the second network node and the first network node are in the same channel, the first network node detects that the signal strength of the second network node is greater than a specified threshold, or the second network node detects that the signal strength of the first network node is greater than a specified threshold.

[0018] In this design, the network can also be designed to have network nodes with special needs that can prioritize requesting to occupy channels. The control node can prioritize network nodes with priority channel occupation needs to transmit services through the channel in a timely manner based on the needs of the network nodes, thereby avoiding problems such as increased latency and decreased network throughput caused by the network nodes' failure to process services in a timely manner, and thus improving the performance of the entire network.

[0019] In one possible design, the first scheduling message includes the following information: a network node identifier and scheduling start information. In this design, centralized scheduling of network nodes by the control node can avoid conflicts caused by free competition and random backoff among network nodes and improve the transmission efficiency of the entire network.

[0020] In one possible design, the service information or the first scheduling message is sent via one of the following methods: a custom data frame, an Ethernet frame, or an Optical Network Terminal Management Control Interface (OMCI) protocol frame. In this design, interactive messages between the control node and the network node can be implemented by adding a new frame or by reusing an existing frame, thereby implementing the method provided by this application and avoiding random backoff conflicts on the air interface.

[0021] In second aspect, an embodiment of the present application provides a scheduling method, which includes: a network node reports service information to a control node, wherein the service information is used to indicate information about service data that the network node needs to transmit through a channel; the network node receives a first scheduling message sent by the control node, wherein the first scheduling message is used to indicate that the network node is allowed to compete for a channel; and the network node competes for a channel according to the first scheduling message.

[0022] In one possible design, the method further includes: the network node reporting a first response message to the control node, where the first response message is used to indicate that the network node has competed for a channel.

[0023] In one possible design, the method further includes: the network node updating the service information to the control node in at least one of the following manners:

[0024] Mode 1: The network node reports a second response message to the control node, where the second response message is used to indicate service information updated by the network node before or after service data transmission in the current scheduling period is completed;

[0025] Method 2: The network node periodically reports updated service information.

[0026] In one possible design, the service information includes at least one of the following information: service type, service traffic, service delay, and service priority.

[0027] In one possible design, the method also includes: if the network node detects that there is first data to be sent or received, reporting a first request message to the control node, the first request message is used to request priority occupation of the channel to send or receive the first data; or, if the network node detects that there is first data to be sent or received, carrying priority request information through the service information, the priority request information is used to request priority occupation of the channel to send or receive the first data; after the network node has sent or received the first data, reporting a first indication message to the control node, the first indication message is used to indicate that the network node has sent or received the first data.

[0028] In one possible design, the first scheduling message includes the following information: network node identification and start scheduling information.

[0029] In one possible design, the business information or the first scheduling message is sent in one of the following ways: a custom data frame, an Ethernet frame, or an OMCI protocol frame.

[0030] In a third aspect, an embodiment of the present application provides a scheduling system, which includes a control node and N network nodes; wherein, the control node can execute the method provided in any possible design of the above-mentioned first aspect, and each of the network nodes can execute the method provided in any possible design of the above-mentioned second aspect.

[0031] In a fourth aspect, an embodiment of the present application provides a scheduling device, comprising a transceiver unit and a processing unit. The functions performed by the transceiver unit and the processing unit may correspond to the steps of the control node involved in any possible design or implementation of the first aspect.

[0032] In a fifth aspect, an embodiment of the present application provides a scheduling device, comprising a transceiver unit and a processing unit. The functions performed by the transceiver unit and the processing unit may correspond to the steps performed by the network node involved in any possible design or implementation of the second aspect.

[0033] In a sixth aspect, an embodiment of the present application further provides a network device, comprising one or more processors, the processors being coupled to a memory, the memory storing computer program code, and the computer program code comprising computer instructions. The processor executes the computer instructions in the memory to execute the method provided in any possible design of the first aspect above. Optionally, the network device further comprises a communication interface, and the processor is coupled to the communication interface. The communication interface may be a transceiver or an input / output interface; when the network device is a chip included in the network device, the communication interface may be the input / output interface of the chip. Optionally, the transceiver may be a transceiver circuit, and the input / output interface may be an input / output circuit.

[0034] In a seventh aspect, an embodiment of the present application further provides a network device, comprising one or more processors and a memory, wherein the memory is coupled to the processor, and the memory stores computer program code, wherein the computer program code comprises computer instructions. The processor executes the computer instructions in the memory to execute the method provided in any possible design of the second aspect above. Optionally, the network device further comprises a communication interface, and the processor is coupled to the communication interface. The communication interface may be a transceiver or an input / output interface; when the network device is a chip included in the network device, the communication interface may be the input / output interface of the chip. Optionally, the transceiver may be a transceiver circuit, and the input / output interface may be an input / output circuit.

[0035] In an eighth aspect, an embodiment of the present application further provides a wireless networking system, comprising the network device provided in the sixth aspect above, and N network devices provided in the seventh aspect above.

[0036] In the ninth aspect, an embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a computer, the method provided in any possible design of the first aspect is implemented, or the method provided in any possible design of the second aspect is implemented.

[0037] In the tenth aspect, an embodiment of the present application also provides a computer program product, which includes: computer program code, which, when the computer program code is executed by the processor of the network device, enables the network device to execute the method in any possible design of the above-mentioned first aspect, or enables the network device to execute the method in any possible design of the above-mentioned second aspect.

[0038] In an eleventh aspect, embodiments of the present application further provide a chip for reading and executing a software program stored in a memory to implement the method in any possible design of the first aspect, or to implement the method in any possible design of the second aspect. The memory may be connected to the chip, or the memory may be built into the chip.

[0039] For the beneficial effects of any of the second to eleventh aspects, please refer to the beneficial effects of various possible designs in the first aspect, which will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 This is a schematic diagram of a possible WLAN network architecture according to an embodiment of the present application;

[0041] Figure 2 This is a schematic diagram of the EDCA parameter set in an embodiment of the present application;

[0042] Figure 3 This is a schematic diagram of possible EDCA parameters configured on the STA side in an embodiment of the present application;

[0043] Figure 4 A schematic diagram of a possible contention channel in an embodiment of the present application;

[0044] Figure 5A This is a schematic diagram of the topology of an optical communication system applied to FTTR in an embodiment of the present application;

[0045] Figure 5B This is a schematic diagram of the topology of another optical communication system applied to a home network in an embodiment of the present application;

[0046] Figure 6 This is one of the flow charts of a possible scheduling method in an embodiment of the present application;

[0047] Figure 7A This is a second flow chart of a possible scheduling method in an embodiment of the present application;

[0048] Figure 7B An example of the first request message provided for this application;

[0049] Figure 7C An example of the first indication message provided in this application;

[0050] Figure 8 Examples of scheduling messages provided for this application;

[0051] Figure 9 This is a third flow chart of a possible scheduling method in an embodiment of the present application;

[0052] Figure 10 An example of the first response message provided for this application;

[0053] Figure 11 An example of a second response message provided in this application;

[0054] Figures 12A to 12E An example of an Ethernet frame provided in an embodiment of the present application;

[0055] Figure 13 An example of the OMCI protocol frame provided in an embodiment of the present application;

[0056] Figure 14 This is a structural diagram of a scheduling device in an embodiment of the present application;

[0057] Figure 15 This is a structural diagram of another scheduling device in an embodiment of the present application;

[0058] Figure 16 This is a schematic diagram of the structure of a chip provided in an embodiment of the present application. DETAILED DESCRIPTION

[0059] It should be understood that “one embodiment”, “one implementation”, “one implementation method” or “one example” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, “in one embodiment”, “an implementation method”, “one implementation method” or “in an example” appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in the various embodiments of the present application, the size of the sequence numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0060] Additionally, the terms "system" and "network" are often used interchangeably herein. The term "and / or" herein simply describes an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " herein generally indicates that the associated objects are in an "or" relationship. It should be understood that in the embodiments of this application, "B corresponding to A" means that B is associated with A and that B can be determined based on A. However, it should also be understood that determining B based on A does not mean determining B solely based on A; B can also be determined based on A and / or other information. Furthermore, unless otherwise indicated, ordinal numbers such as "first" and "second" in the embodiments of this application are used to distinguish between multiple objects and are not intended to limit the order, timing, priority, or importance of multiple objects. Furthermore, the terms "including" and "having" in the embodiments of this application, the claims, and the accompanying drawings are not exclusive. For example, a process, method, system, product, or device that includes a series of steps or modules is not limited to the listed steps or modules and may also include steps or modules that are not listed.

[0061] See also Figure 1 Figure 1 shows a schematic diagram of a possible WLAN network architecture, which includes a wireless controller (also referred to as a "control node" in this embodiment), a wireless access point (also referred to as a "network node" in this embodiment), and a terminal device. The wireless controller is used to configure services and radio frequency for the access point. A wireless access point, also referred to as an access point (AP), provides service access to associated STAs. Terminal devices, acting as STAs, can associate with access points.

[0062] Terminal devices may include mobile phones (or "cellular" phones), computers with mobile terminal devices, portable, pocket-sized, handheld, or computer-built mobile devices, etc. For example, personal communication service (PCS) phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), and other devices. Terminal devices may also be computers, tablet computers, e-readers, etc., or smart home devices such as smart TVs and smart speakers. As an example and not a limitation, in the embodiments of the present application, the terminal device may also be a wearable device. Wearable devices may also be called wearable smart devices or smart wearable devices, etc., which are a general term for wearable devices that are intelligently designed and developed using wearable technology for everyday wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothing or accessories. Wearable devices are not just hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. In a broad sense, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets for vital sign monitoring, smart helmets, smart jewelry, etc.

[0063] It should be noted that the Wi-Fi channel is shared by the AP and STA. Currently, the AP and STA each use a set of enhanced distributed channel access (EDCA) parameters to compete for the Wi-Fi channel and obtain transmission opportunities. The configuration of EDCA parameters is determined by the AP. Each AP configures its own EDCA parameters and broadcasts them to each STA connected to the AP. Multiple STAs accessing the same AP need to follow the same set of EDCA parameters broadcast by the AP. The AP can broadcast EDCA parameters through Beacon frames. The Beacon frame is a periodically triggered management frame defined by the 802.11WLAN protocol. The Beacon frame carries a variety of necessary information in the network. The Beacon frame includes an EDCA parameter set broadcast by the AP to the STA. The Beacon frame can also include an EDCA parameter set used by the AP itself. The EDCA parameter set element includes a quality of service (QoS) parameter set. Among them, the QoS parameter set includes the STA's QoS parameters for different access categories (AC). The access category can also be called an access category. Access categories include: AC_BE (best effort), AC_BK (background), AC_VI (video), and AC_VO (voice). Each access category has QoS parameters (i.e., access channel configuration parameters), such as the minimum and maximum sizes of the exponential contention window (ECM) and the transmission opportunity (TXOP) limit. By setting different values ​​for the QoS parameters for each access category, some multimedia real-time services (such as AC_VI and AC_VO services) can have more opportunities to access the channel, thereby reducing the latency of multimedia real-time services, making data transmission of multimedia real-time services smoother, and improving the user experience.

[0064] For example, see Figure 2 The following table shows the EDCA parameter set included in the Beacon frame. The element ID is the unique identifier of the EDCA parameter set element, used to distinguish it from other elements. The length is the parameter length of the EDCA parameter set element, excluding the element ID and length fields.

[0065] The quality of service information (QoS info) field also includes a sub-option, which is the EDCA parameter set update counter (EDCA parameter set updatecount), which is used to notify the terminal whether the EDCA parameter set elements have changed.

[0066] The EDCA parameter set element also includes a parameter record field for each access category. Each parameter record field defines the QoS parameters when the STA executes the access category, such as Figure 2 As shown, the parameter record field of each access category includes AC index (ACI) / arbitration interframe space number (AIFSN), exponential contention window, and transmission opportunity (TXOP) limit.

[0067] ACI / AIFSN includes AIFSN. AIFSN indicates the number of time slots after the short interframe space (SIFS) period that an AP (or STA) waits to access the network. The smaller the value of this parameter, the shorter the time the AP (or STA) waits to access the Wi-Fi channel.

[0068] ECW is the contention window size of EDCA. This value determines the average backoff time. The smaller the value, the shorter the average backoff time. The ECW parameters include the minimum ECW size (ECWmin) and the maximum ECW size (ECWmax).

[0069] The TXOP limit specifies the time a STA can occupy a Wi-Fi channel to transmit data. The larger the value, the longer the STA can occupy the channel.

[0070] The AP broadcasts the EDCA parameter set element to the STA. The EDCA parameter set element includes the QoS parameter set set by the AP for the STA to process each access category. The AP configures different QoS parameters for different access categories. For example, a smaller AIFSN, ECWmin and ECWmax, and a larger TxOP are configured for AC_VI and AC_VO that require real-time transmission, while a larger AIFSN, ECWmin and ECWmax, and a smaller TxOP are configured for other access categories, so that AC_VI and AC_VO services have a higher priority when accessing the Wi-Fi channel, while other services have a lower priority, meeting the needs of real-time services and obtaining a better service experience. As an example, a possible EDCA parameter configured on the STA side is as follows: Figure 3 shown.

[0071] See also Figure 4 As shown, after receiving the EDCA parameter set element, when the STA needs to use the channel to send service data, the STA monitors whether the channel is busy. When it detects that the channel is idle, it starts the AIFS (AIFS = SIFS (16us) + AIFSN (AC) × slot (9us)) countdown. Figure 4 As shown, the higher the priority of the AC service, the shorter the AIFS. When the AIFS countdown reaches 0, the backoff countdown begins. The backoff countdown is determined by CWmin. The backoff countdown of each STA is randomly selected from 0 to CWmin, and the backoff countdown time = backoff countdown * slot (9us). The higher the priority of the AC, the smaller the initial value of CWmin, and the probability of the randomly obtained backoff countdown being smaller. It can seize the channel first. After seizing the channel, the duration of occupying the channel is determined according to the value of TxOP. VI and VO services can occupy the channel longer than BE and BK. In addition, AP usually also needs to use the channel to send service data, such as some control information, etc. The current implementation method of AP competing for the channel is different from Figure 4 The implementation method shown in STA is similar.

[0072] As mentioned in the background, with the development of the internet, more and more devices are being added to home networks, and the likelihood of multiple devices competing for Wi-Fi channels at the same time is increasing. Consequently, multiple devices competing for Wi-Fi channels at the same time can cause random backoff conflicts, leading to packet failures, reduced network throughput, and increased service latency.

[0073] In view of this, an embodiment of the present application provides a scheduling method to provide a feasible way to avoid random backoff conflicts in the air interface, thereby improving the efficiency of data transmission through channels in the wireless network and improving the overall network performance of the wireless network.

[0074] The embodiments of the present application can be applied to WLAN deployment methods that use fiber to the room (FTTR). In FTTR, optical fiber is laid to each room, and home gateway interconnection is achieved by deploying edge network devices in each room. FTTR can meet the high requirements of new business applications such as online education, home office, and home entertainment for bandwidth, latency, etc. The edge network device can be an edge ONT, or an AP, or a sub fiber unit (SFU), which can also serve as a network node in a wireless network. In the FTTR application scenario, a gateway device is deployed to manage the edge network device. The gateway device can be an optical gateway, ONT, PON gateway, or main fiber unit (MFU), etc., which can also serve as a control node in a wireless network.

[0075] As an example, see Figure 5A Figure 1 shows a schematic diagram of the topology of an optical communication system for FTTR. An optical communication system for FTTR includes at least an optical gateway, an optical splitter, and multiple edge optical network terminals (edge ​​ONTs). In the embodiments of this application, the edge ONT may also be referred to as an EDGE ONT or an Edge ONT. The optical gateway can communicate with multiple EDGE ONTs via an optical splitter. The optical communication system also includes an optical line terminal (OLT). The optical gateway is deployed between the OLT and the edge ONT. In the FTTR scenario, the optical gateway is connected to a home information box via fiber-to-the-home (FTTH) and then to each room via an optical splitter. An edge ONT is deployed in each room, and the optical gateway at the information box collaboratively manages multiple edge ONTs. In the FTTR architecture, multiple ONTs are connected to the optical gateway via optical fiber, and control and management resources do not occupy Wi-Fi air interfaces. Compared to multi-AP Wi-Fi cascading solutions, this can improve the real-time management of the optical gateway. Terminal devices can access the edge ONT to achieve network communication.

[0076] As another example, see Figure 5B Figure 2 shows another optical communication system topology for home networking applications. An optical communication system includes at least an optical network terminal (ONT) and multiple access points (APs). The ONT coordinates and manages the APs deployed in each room.

[0077] The optical communication system of FTTR can adopt a passive optical network (PON). PON can be a gigabit passive optical network (GPON), an Ethernet passive optical network (EPON), a 10Gb / s Ethernet passive optical network (10G-EPON), a time and wavelength division multiplexing passive optical network (TWDM-PON), a 10Gb passive optical network (XG-PON), or a 10Gb symmetric passive optical network (XGS-PON). New technologies evolving in the future will increase the rate of PON to 25Gbps, 50Gbps, or even 100Gbps, so this application can also apply PON with a higher transmission rate.

[0078] In the embodiments of this application, the advantages of the gateway device's collaborative management of edge network devices in the FTTR architecture are utilized. The network device centrally decides the order in which edge network devices compete for channels, thereby avoiding random backoff conflicts and optimizing the performance of the entire network. It should be noted that this application can also be applied to non-FTTR architectures. Any communication system architecture consisting of control nodes and network nodes can be applied to the embodiments of this application. The above is only an example of the FTTR architecture and is not a limitation.

[0079] The method provided in the embodiments of the present application is described in detail below with reference to the accompanying drawings.

[0080] See Figure 6 , which is an interactive flow chart of a scheduling method provided in an embodiment of the present application.

[0081] Step 601: The control node receives N network nodes (such as Figure 6The network nodes 1 to N shown in the figure (it should be noted that network nodes 1 to N are only used to distinguish) report service information respectively. The service information is used to indicate the service data that the network node needs to transmit through the channel, and N is a positive integer. Exemplary service information may include, but is not limited to, the following information: service type, service flow, service latency, and service priority. It should be noted that the control node itself can also serve as a network node. In this scenario, the N network nodes may also include the control node. In this case, the control node can receive its own reported service information through internal reporting or other means.

[0082] Illustratively, the control node may receive service information of network nodes multiple times. When deciding the network node to be scheduled in the current scheduling period in each scheduling period, the control node may make a centralized decision based on the latest service information of each network node.

[0083] In an optional embodiment, N network nodes may periodically report service information, for example, reporting service information once per second, so that the control node can make centralized scheduling decisions based on the latest service information of each network node, thereby improving the scheduling accuracy and overall network performance in the wireless network. Among them, each network node may also be set with a different period. For example, a network node with more terminal devices may be set with a shorter period, while a network node with fewer terminal devices may be set with a longer period. Furthermore, when the present application is implemented, each network node may also monitor the service traffic conditions in different time periods, and may set different periods in different time periods. For example, a longer period may be set in the early morning, and a shorter period may be set in the evening. In this way, on the one hand, scheduling accuracy can be guaranteed, and on the other hand, resource consumption of network nodes and control nodes can be reduced.

[0084] In another optional embodiment, the network node may also report updated service information to the control node each time it is scheduled and before or after completing service data transmission via the channel, so that the control node can promptly obtain the latest service information of the network node and thereby generate more accurate scheduling decisions. This can be implemented as follows: after the network node scheduled in the previous scheduling cycle competes for the channel and before or after completing service data transmission, the control node receives a second response message reported by the network node, and obtains the latest service information of the network node based on the second response message, to accurately determine the network node to be scheduled in the current scheduling cycle.

[0085] It should be noted that this application does not limit the implementation method of each network node reporting business information to the control node. Some network nodes (for example, unscheduled network nodes) may update business information through periodic reporting. There may also be some scheduled network nodes that report updated business information through a second response message in a timely manner when being scheduled, or the scheduled network nodes may also update business information through periodic reporting at the same time.

[0086] Furthermore, after receiving updated service information from a network node, the control node updates previously acquired service information for the network node. Optionally, the control node may discard historical service information based on the updated service information and use the updated service information as the service information for the network node. Alternatively, the control node may incrementally update previously acquired service information for the network node based on the updated service information. This implementation may be determined based on actual scenarios.

[0087] Moreover, in the scenario where a wireless network is initially constructed or there are newly online network nodes (for example, a newly added network node or a network node that is restarted after a power outage), each network node can report initial service information. On the one hand, it can notify the control node of the existence of the newly added network node, and on the other hand, it can enable the control node to obtain the service information of the network node. On the other hand, the control node provided in the embodiment of the present application has the function of centrally scheduling network nodes to send data. If the network node does not receive the service information of the network node, or fails to successfully receive the response message of the network node after scheduling the network node, the control node can also actively send scheduling information for testing to avoid scheduling anomalies due to equipment failure, message transmission loss, and other problems. For example, when the control node cannot determine the scheduled network node based on the service information of the network node, it can schedule the connected network nodes in turn through scheduling messages.

[0088] Step 602: The control node determines the M network nodes (such as Figure 6 , where network nodes 1 to network nodes M are merely for distinction), where M is a positive integer; it is understood that M is less than or equal to N. Furthermore, if the control node determines that there are no scheduled network nodes in the current scheduling period (i.e., M is 0, for example, when each network node remains silent), the control node may make a decision on the next scheduling period after a preset duration; the preset duration may be determined based on a set scheduling period, and the duration corresponding to the scheduling period may be different within different time ranges.

[0089] Among them, on the basis of avoiding the conflict problem of air interface competition, in order to improve the overall network performance and transmission efficiency of the wireless network, the control node can also determine that there is no interference between the M scheduled network nodes. Optionally, if the first network node and the second network node are in different channels, it can be determined that there is no interference between the two, and the control node can schedule the first network node and the second network node at the same time in the current scheduling period. Another option is that if the first network node and the second network node are far apart and there is no overlapping coverage area between the two, it can also be determined that there is no interference between the two, and the control node can schedule the first network node and the second network node at the same time in the current scheduling period; wherein, if the first network node and the second network node cannot scan each other, or even if they scan each other, the detected signal strength is less than or equal to a specified threshold, it can be determined that the distance between the two is far and there is no interference.

[0090] In an optional embodiment, the control node may determine the priority of the network node according to at least one of the following methods, but not limited to, and then decide which network nodes to enable scheduling according to the priority of the network node:

[0091] 1) If the service information reported by the N network nodes respectively includes the service type, the priority of the network node is determined according to the service type and a pre-configured service type priority.

[0092] For example, the service type can be represented as AC_BE, AC_BK, AC_VI, and AC_VO in the aforementioned embodiment. If the service type of the network node is a multimedia real-time service (such as AC_VI or AC_VO type service), it can be determined that the network node has a higher priority. It should be noted that the pre-configured service type can also be configured using other types, and the priority corresponding to each service type can also be pre-configured according to the actual application scenario, which is not limited in this application.

[0093] 2) If the service information reported by the N network nodes respectively includes the service traffic, the priority of the network node is determined according to the service traffic. The larger the service traffic of the network node, the higher the priority of the network node can be determined by the control node. In this way, priority scheduling of network nodes with large service traffic demands can be achieved through this implementation. For example, assuming that the network includes network node 1 and network node 2, the service traffic reported by network node 1 is 1024MB, and the service traffic reported by network node 2 is 10MB. Since the service traffic of network node 1 is greater than that of network node 2, the control node can give priority to scheduling network node 1. In this way, problems such as excessive storage pressure in the network due to the inability of network node 1 to send services can be avoided.

[0094] 3) If the service information reported by the N network nodes respectively includes the service delay, the priority of the network node is determined according to the service delay.

[0095] The higher the service delay requirement of a network node, the higher the priority the control node determines the network node to have; or, the greater the service delay of a network node, the higher the priority the control node can determine the network node to have. In this way, this implementation method can meet the delay requirements of some services; for example, if the delay requirement of service 1 is less than 7ms, and service 2 has no delay requirement, the control node can give priority to scheduling network node 1 that requests to transmit service 1. It can also avoid affecting the transmission efficiency of the entire network when the network node with a larger service delay is scheduled; for example, assuming that the network contains network node 1 and network node 2, the service delay reported by network node 1 is 10s, and the service delay reported by network node 2 is 1s. Since the service delay of network node 1 is greater than that of network node 2, the control node can give priority to scheduling network node 1.

[0096] 4) If the service information reported by the N network nodes respectively includes the service priority, the priority of the network node is determined according to the service priority.

[0097] For example, the service priority can be pre-set, for example, service 1 is pre-set as the highest priority and service 2 is pre-set as the lowest priority. Alternatively, it can be determined based on user account information. For example, if user 1 has a VIP membership on a designated platform, the network node will identify the service data corresponding to user 1 as having service priority when transmitting the service corresponding to the designated platform.

[0098] When determining the priority of a network node based on multiple of the above methods, the control node can also combine the weights corresponding to each method to determine the priority of the network node. For example, the weight corresponding to service priority can be 50%, the weight corresponding to service type can be 20%, the weight corresponding to service flow can be 15%, and the weight corresponding to service latency can be 15%. In this way, the control node can comprehensively consider the various scenarios of service data of each network node to obtain more accurate decision results.

[0099] It should be noted that in the above methods, the control node can also directly schedule the network node based on the information contained in the service information of the network node, without indirectly determining the priority of the network node first and then determining the scheduled network node.

[0100] In another optional embodiment, if there is a need for a first network node to send or receive first data first, the control node may also determine not to start scheduling for the current scheduling period based on the request of the first network node, and reserve a certain time window for the first network node so that the first network node can occupy the channel first; or, schedule the first network node first, for example, schedule the first network node first before scheduling the M network nodes of the current period.

[0101] In one possible scenario, the majority of services in wireless networks today are Transmission Control Protocol (TCP). The throughput of TCP services is often affected by round-trip time (RTT). This refers to the delay between the start of data transmission at the sender and the receipt of an acknowledgment from the receiver. A smaller RTT indicates a higher TCP throughput. In this scenario, if interference occurs on the air interface due to contention, the time required for TCP acknowledgment (ACK) messages increases, leading to a higher RTT and, in turn, impacting the transmission efficiency of the entire network.

[0102] Based on this, when implementing this application, each network node can detect whether there is a need to preferentially occupy a channel to send or receive first data. For example, in the above scenario, it is necessary to preferentially occupy a channel to receive a TCP ACK message to avoid increasing the RTT. Assuming that there is a need for a first network node to send or receive first data, the first network node can report a first request message, which is used to request preferential occupation of a channel to transmit the first data; alternatively, the first network node can also carry priority request information for requesting preferential occupation of a channel when reporting service information (or sending a first response message or a second response message, etc.).

[0103] Specifically, the priority request information includes a request type (Request Type), which is used to identify the type of scheduling requested by the network node to the control node. Optionally, the length of the request type field is 1 byte:

[0104]

[0105] As can be seen from the above table, if the 0th bit of the request type field is 0, it indicates the default downlink scheduling, that is, the network node accepts the scheduling of the control node in the downlink direction by default;

[0106] If the 0th bit of the request type field is 1, it indicates a downlink scheduling request, that is, the network node requests the control node to perform priority scheduling on it in the downlink direction so as to preferentially occupy the downlink channel;

[0107] If the first and second bits of the request type field are 00, it indicates default uplink scheduling, that is, the network node accepts the scheduling of the control node in the uplink direction by default;

[0108] If the first and second bits of the request type field are 01, it indicates an uplink scheduling request, that is, the network node requests the control node to perform priority scheduling on it in the uplink direction so as to preferentially occupy the uplink channel. For example, the network node requests the control node to send a trigger frame to it to trigger the network node to immediately occupy the uplink channel.

[0109] If the first and second bits of the request type field are 10, it indicates an air interface reservation request. The network node requests the control node to reserve an air interface for it in the uplink direction so that the network node can preferentially occupy the uplink channel.

[0110] It is easy to understand that if all bits of the request type field are 0, it means that the network node accepts the scheduling of the control node in the uplink and downlink directions by default.

[0111] If the control node receives the first request message or obtains the priority request information from other messages sent by the network node, it can determine that the first network node has a need to occupy the channel with priority. During the implementation of this application, based on the actual configuration of the network, the control node can send back an authorization message to notify the first network node that it is allowed to occupy the channel with priority; or the control node can directly adjust the decision or order of centralized scheduling based on the priority request of the first network node. Under this configuration, the first network node can directly transmit data through the channel after sending the first request message or priority request information.

[0112] Optionally, the control node may determine not to start scheduling in the current scheduling period, or to prioritize scheduling of the first network node, or not to start scheduling of the second network node that may interfere with the first network node in the current scheduling period, based on the priority request information included in the first request message or service information. Figure 7A , which is a schematic diagram of an interaction process of a scheduling method provided in an embodiment of the present application. Before the control node performs scheduling of the current scheduling period in step 603, the control node and the network node may also have the following interaction process:

[0113] Step 701: If a first network node detects that there is first data to be sent or received, for example, after a network node sends 2 to 3 TCP data to a receiver, the receiver will reply with a TCP ACK message. Based on this, each network node can count the number of TCP data sent. If the number is greater than a preset number threshold (assuming it is n, n can be 2 or 3, etc.), it can be determined that the network node has first data to be sent or received. The first network node can be any network node among the N network nodes. Figure 7A The first network node is taken as an example; in a specific implementation, the first network node may also be any network node among the M network nodes, which is not limited in this application.

[0114] Step 702: The first network node reports a first request message, where the first request message is used to request priority in occupying a channel to send or receive first data. Figure 7B , which is an example of a first request message provided in an embodiment of the present application. The first request message may include, but is not limited to, the following information: message type, network node identifier, priority request, and reserved bits. The message type may indicate that the message is a first request message, and the network node identifier may indicate the first network node. The reserved bits are fields reserved for functions to be developed or undeveloped, and are used to extend message functionality. The reserved bits in subsequent embodiments are similar and will not be described again.

[0115] In step 703, the control node determines, based on the first request message, not to enable scheduling for the current scheduling period; or to prioritize scheduling the first network node; or to determine not to enable scheduling for a second network node that meets a preset condition with the first network node in the current scheduling period. The preset condition includes the following information: the second network node and the first network node are on the same channel, and the first network node detects that the signal strength of the second network node is greater than a specified threshold, or the second network node detects that the signal strength of the first network node is greater than a specified threshold. In other words, if the second network node and the first network node compete for the channel simultaneously, a backoff conflict may occur. Conversely, if the first and second network nodes are on different channels, or if there is no overlapping coverage due to a large distance, then even if the first and second network nodes transmit data simultaneously through the channel, there will be no backoff conflict. Based on this, the control node can improve data transmission efficiency by allowing multiple network nodes to compete for the channel.

[0116] Furthermore, if the control node determines that the first network node is one of the M network nodes scheduled in the current scheduling period, the control node can continue scheduling in the current scheduling period. This not only satisfies the first network node's need to prioritize channel occupation, but also ensures the transmission efficiency of the entire network.

[0117] Step 704: The first network node determines that the first data has been sent or received.

[0118] Step 705: The first network node reports a first indication message, where the first indication message is used to indicate that the first network node has sent or received the first data. Optionally, if the control node determines in step 703 not to enable scheduling for the current scheduling period, then scheduling for the current scheduling period can be restored according to the first indication message. Alternatively, if the control node determines in step 703 not to enable scheduling for the second network node in the current scheduling period, then scheduling for the second network node can be restored according to the first indication message. Figure 7C , is an example of a first indication message provided in an embodiment of the present application. The first indication message may include, but is not limited to, the following information: message type, network node identifier, transmitted (sent or received) first data, and reserved bits.

[0119] In addition, it can be understood that in each scheduling period, there may be a network node initiating Figure 7A The interaction process shown is used to preferentially occupy a channel to send or receive first data, and only one scheduling cycle is used as an example.

[0120] Step 603: The control node sends a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel. Optionally, the control node may send the first scheduling message to the M network nodes via unicast. Alternatively, the control node may send the first scheduling message via broadcast or multicast so that the M network nodes receive the first scheduling message.

[0121] See Figure 8, which is an example of a scheduling message provided in this application. The scheduling message (which may be the first scheduling message, or the second scheduling message involved in the following embodiments) may include but is not limited to the following messages: message type, network node identifier, scheduling start information, air interface rate, aggregation number, transmit power, and reserved bit. Among them, the scheduling start information may indicate whether to turn on scheduling or turn off scheduling. Each network node may determine whether to turn on scheduling based on the network node identifier; or, the scheduling start information may only indicate to turn on scheduling. In this case, the network node identifier may only include the scheduled network node. For example, the scheduling message may also include the following information: indicating power, channel, antenna polarization direction, antenna beam direction, etc.

[0122] Step 604, the M network nodes compete for channels according to the first scheduling message respectively. Exemplarily, if the network node receives the first scheduling message, and the first scheduling message contains the identifier of the network node, and the scheduling information is enabled, the network node can compete for the channel at this time. Furthermore, the network node sends data after competing for the channel. Compared with the related art, the network node obtains the opportunity to send data through the channel through free competition and random backoff. The embodiment of the present application can avoid the conflict problem that may be caused by random backoff. It can be understood that if there is a network node that has not received the first scheduling message, or has received the first scheduling message but indicates that the scheduling is not to be enabled, the network node will not compete for the channel at this time, and will continue to wait for the decision result of the control node for the next scheduling cycle.

[0123] In a possible implementation, after being scheduled, each network node can also promptly report the scheduling status to the control node, so that the control node can promptly update the service information of each network node to achieve more accurate scheduling. Figure 9 , is a flowchart of another possible scheduling method in an embodiment of the present application.

[0124] Step 605: The M network nodes respectively report a first response message, where the first response message is used to indicate that the network node has competed for a channel.

[0125] See Figure 10 , which is an example of a first response message provided in an embodiment of the present application. The first response message may include, but is not limited to, the following information: message type, network node identifier, contention for channel (backoff done, BO_done), and reserved bits.

[0126] Step 606: The control node determines P network nodes to be scheduled in the next scheduling period based on the first response message and the service information reported by the N network nodes. P is a positive integer. It is understood that P is less than or equal to N. The decision-making method for the next scheduling period can be found in the description of the previous embodiment and is not repeated here.

[0127] Step 607: The control node sends a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for the channel. If P is 0, the control node may wait for a preset time period before re-making a scheduling decision for the subsequent scheduling period.

[0128] Step 608: The M network nodes respectively report a second response message, where the second response message is used to indicate the service information updated by the network node before or after the service data transmission of the current scheduling period is completed. Optionally, the network node may report the second response message immediately after the service data is sent, so that the control node can be notified in a timely manner. Alternatively, if the latency requirement for the service data transmitted by the network node is not high, the network node may also report the second response message after being scheduled multiple times (allowing contention for the channel), thereby reducing the load on the network. In actual implementation, the specific reporting method can be adjusted according to actual needs. For example, if the actual needs pay more attention to the load in the network, a method of unified reporting after multiple scheduling can be adopted.

[0129] See Figure 11 , which is an example of the second response message provided in an embodiment of the present application. The second response message may include, but is not limited to, the following information: message type, network node identifier, sending completion information, service traffic, service delay, service type, service priority, and reserved bit. Among them, the service traffic, service delay, service type, and service priority in the second response message are service information updated after the M network nodes send them in the current scheduling period. The updated service information can be used as the service information re-reported by the M network nodes. The control node can continue to determine the network nodes to be scheduled in the subsequent scheduling period based on the updated service information.

[0130] In the content of the aforementioned embodiment, the examples of the first request message, the first indication message, the scheduling message, the first response message and the second response message are implemented by adding a new frame. When the present application is implemented, it can also be implemented in a wireless network by multiplexing in an existing frame. For example, see Figures 12A to 12E, is an example of an Ethernet frame provided in an embodiment of the present application, by extending the various messages involved in the embodiment of the present application by the payload field in the Ethernet frame, wherein the Ethernet packet header generally includes the destination address, source address length and type. For another example, see Figure 13 , which is an example of an optical network terminal management and control interface (OMCI) protocol frame provided in an embodiment of the present application. Various messages involved in the embodiments of the present application can also be extended in the OMCI protocol frame adopted by the passive optical network (PON), wherein the OMCI protocol frame includes: a GPON encapsulation mode (GEM) header, a transaction correlation identifier, a message type, a device identifier, a message identifier, message contents, and an OMCI trailer.

[0131] Through the method provided in the embodiment of the present application, the control node can realize centralized control of multiple network nodes, and through statistics on the business information of each network node, it can decide the order in which each network node is allowed to send data. In this way, in the network, the network nodes scheduled by the control node in each scheduling cycle are allowed to compete for channels in the current scheduling cycle so that they can send data through the channel, while the network nodes that are not scheduled need to wait for the scheduling results of the next scheduling cycle. Compared with the method of each network node in the related art through free competition for the channel, this method can avoid random backoff conflicts in the air interface, and each network node can realize the sequential transmission of data according to the centralized control of the control node, thereby improving the transmission efficiency of the entire network.

[0132] Based on the same inventive concept as the above method embodiment, the embodiment of the present application further provides a scheduling device 1400, such as Figure 14As shown, the device can be set on the control node. The scheduling device 1400 includes: a transceiver unit 1401 and a processing unit 1402. The scheduling device 1400 can be used to implement the method described in the above method embodiment. Among them, the optional transceiver unit 1401 and the processing unit 1402 can be connected to each other through a communication line 1403; the communication line 1403 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The communication line 1403 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 14 Only one thick line is used in the diagram, but this does not mean that there is only one bus or one type of bus.

[0133] The transceiver unit 1401 is used to receive service information reported separately by N network nodes, where the service information is used to indicate information about service data that the network node needs to transmit through a channel, and N is a positive integer; the processing unit 1402 is used to determine the M network nodes scheduled in the current scheduling period based on the service information reported separately by the N network nodes, where M is a positive integer and is less than or equal to N; the transceiver unit 1401 is also used to send a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for the channel.

[0134] In one possible design, the transceiver unit 1401 is further used to receive first response messages reported respectively by the M network nodes, where the first response message is used to indicate that the network node competes for the channel; the processing unit 1402 is further used to determine the P network nodes to be scheduled in the next scheduling period based on the first response message and the service information reported respectively by the N network nodes, where P is a positive integer and P is less than or equal to N; the transceiver unit 1401 is further used to send a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for the channel.

[0135] In one possible design, the processing unit 1402 is further configured to update the service information of the network node by at least one of the following methods:

[0136] Mode 1: receiving, by the transceiver unit 1401, 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 node before or after the service data transmission of the current scheduling period is completed;

[0137] Method 2: receiving, by the transceiver unit 1401, the updated service information periodically reported by the N network nodes.

[0138] In one possible design, the service information includes at least one of the following information: service type, service traffic, service delay, and service priority; when the processing unit 1402 determines the M network nodes scheduled in the current scheduling period based on the service information respectively reported by the N network nodes, it is specifically used to: if the service information respectively reported by the N network nodes contains the service type, determine the priority of the network node according to the service type and a pre-configured service type priority; if the service information respectively reported by the N network nodes contains the service traffic, determine the priority of the network node according to the service traffic; if the service information respectively reported by the N network nodes contains the service delay, determine the priority of the network node according to the service delay; if the service information respectively reported by the N network nodes contains the service priority, determine the priority of the network node according to the service priority; and determine the M network nodes scheduled in the current scheduling period based on the priority of the network node.

[0139] In one possible design, the transceiver unit 1401 is also used to, before sending the first scheduling message to the M network nodes, if a first request message reported by the first network node is received, or if it is determined that the service information of the first network node also includes priority request information, determine that the first network node requests priority occupation of the channel; wherein the first request message or the priority request information is used to request priority occupation of the channel to send or receive first data; the processing unit 1402 is also used to perform scheduling of the current scheduling period after receiving a first indication message reported by the first network node, and the first indication message is used to indicate that the first network node has sent or received the first data; or, the processing unit 1402 is also used to schedule the second network node in the current scheduling period after receiving the first indication message reported by the first network node, and the second network node and the first network node meet preset conditions; the preset conditions include the following information: the second network node and the first network node are in the same channel, the first network node detects that the signal strength of the second network node is greater than a specified threshold, or the second network node detects that the signal strength of the first network node is greater than a specified threshold.

[0140] In one possible design, the first scheduling message includes the following information: network node identification and start scheduling information.

[0141] In one possible design, the business information or the first scheduling message is sent in one of the following ways: a custom data frame, an Ethernet frame, or an OMCI protocol frame.

[0142] In another example, Figure 14 The illustrated scheduling device can also be provided on a network node. In this example, the transceiver unit 1401 is configured to report service information to the control node, where the service information indicates service data that the network node needs to transmit via a channel. The transceiver unit 1401 is further configured to receive a first scheduling message sent by the control node, where the first scheduling message indicates that the network node is allowed to contend for a channel. The processing unit 1402 is configured to contend for a channel based on the first scheduling message.

[0143] In one possible design, the transceiver unit 1401 is also used to report a first response message to the control node, where the first response message is used to indicate that the network node competes for the channel.

[0144] In one possible design, the transceiver unit 1401 is further configured to update the service information to the control node in at least one of the following manners:

[0145] Method 1: reporting a second response message to the control node, where the second response message is used to indicate service information updated by the network node before or after the service data transmission of the current scheduling period is completed;

[0146] Method 2: Periodically report updated business information.

[0147] In one possible design, the service information includes at least one of the following information: service type, service traffic, service delay, and service priority.

[0148] In one possible design, the processing unit 1402 is also used to detect the existence of first data to be sent or received; the transceiver unit 1401 is also used to report a first request message to the control node, and the first request message is used to request priority occupation of the channel to send or receive the first data; the transceiver unit 1401 is also used to report a first indication message to the control node after sending or receiving the first data, and the first indication message is used to indicate that the network node has sent or received the first data.

[0149] In one possible design, the first scheduling message includes the following information: network node identification and start scheduling information.

[0150] In one possible design, the business information or the first scheduling message is sent in one of the following ways: a custom data frame, an Ethernet frame, or an OMCI protocol frame.

[0151] It should be noted that the division of modules in the embodiments of the present application is schematic and is only a logical function division. In actual implementation, there may be other division methods, for example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the functional units in the various embodiments of the present application can be integrated into a processing unit, or can exist physically alone, or two or more units can be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0152] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the relevant technology, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) or a processor to execute all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0153] Based on the same concept as the above scheduling method, Figure 15 As shown, an embodiment of the present application also provides a structural schematic diagram of another scheduling device 1500. The scheduling device 1500 can be used to implement the method described in the above method embodiment, and reference can be made to the description in the above method embodiment. The scheduling device 1500 may include one or more processors 1501. The processor 1501 may be a general-purpose processor or a dedicated processor, etc. For example, it may be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control the scheduling device (such as a base station, terminal, or chip, etc.), execute software programs, and process data of the software programs. The scheduling device may include a transceiver unit to realize the input (reception) and output (transmission) of signals. For example, the transceiver unit may be a transceiver, a radio frequency chip, etc.

[0154] The scheduling device 1500 includes one or more processors 1501 , and the one or more processors 1501 can implement the methods shown in the above-mentioned embodiments.

[0155] Optionally, the processor 1501 may implement other functions in addition to implementing the method of the embodiment shown above.

[0156] Optionally, in one design, processor 1501 may execute instructions to cause scheduling apparatus 1500 to perform the method described in the above method embodiments. The instructions may be stored in whole or in part within the processor, such as instruction 1503, or in whole or in part in memory 1502 coupled to the processor, such as instruction 1504. Instructions 1503 and 1504 may also be used together to cause scheduling apparatus 1500 to perform the method described in the above method embodiments.

[0157] In another possible design, the scheduling device 1500 may include one or more memories 1502, on which instructions 1504 are stored. The instructions can be executed on the processor, so that the scheduling device 1500 performs the method described in the above method embodiment. Optionally, data can also be stored in the memory. The optional processor can also store instructions and / or data. For example, one or more memories 1502 can store the corresponding relationships described in the above embodiments, or related parameters or tables involved in the above embodiments. The processor and memory can be provided separately or integrated together.

[0158] In another possible design, scheduling device 1500 may further include a transceiver 1505 and an antenna 1506. Processor 1501 may be referred to as a processing unit, which controls the device (terminal or base station). Transceiver 1505 may be referred to as a transceiver, transceiver circuit, or transceiver unit, etc., and is configured to implement the transceiver functions of the device via antenna 1506.

[0159] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-mentioned method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-mentioned processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-mentioned method.

[0160] It will be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that memory of the systems and methods described herein is intended to comprise, but not be limited to, these and any other suitable types of memory.

[0161] The present application also provides a scheduling system, which may include the control node and N network nodes described in the above method embodiments. The control node may execute the content described in the above method embodiments, and each network node may execute the content described in the above method embodiments.

[0162] An embodiment of the present application further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a computer, the scheduling method of any one of the method embodiments shown above is implemented.

[0163] An embodiment of the present application also provides a computer program product, which, when executed by a computer, implements the scheduling method of any of the method embodiments shown above.

[0164] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented using software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, all or part of the processes or functions according to the embodiments of the present application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that includes one or more available media integrated therein. Available media may be magnetic media (eg, floppy disks, hard disks, tapes), optical media (eg, high-density digital video discs (DVDs)), or semiconductor media (eg, solid state disks (SSDs)).

[0165] like Figure 16 As shown, an embodiment of the present application also provides a chip 1600, including an input / output interface 1601 and a logic circuit 1602, the input / output interface 1601 is used to receive / output code instructions or information, and the logic circuit 1602 is used to execute code instructions or according to information to execute the scheduling method of any method embodiment shown above.

[0166] The chip 1600 can implement the functions shown in the processing unit and / or transceiver unit in the above embodiments.

[0167] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0168] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0169] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways.

Claims

1. A scheduling method, characterized in that: include: The control node receives service information reported by N network nodes respectively, where N is a positive integer; The control node determines, based on the service information respectively reported by the N network nodes, M network nodes to be scheduled in a current scheduling period, where M is a positive integer and is less than or equal to N; The service information includes a request type, and the request type includes a default downlink scheduling, a downlink scheduling request, a default uplink scheduling, an uplink trigger scheduling request, and an air interface reservation request.

2. The scheduling method according to claim 1, characterized in that: The request type is 1 byte long.

3. The scheduling method according to claim 2, characterized in that: The 0th bit of the request type is 0 and is used to indicate default downlink scheduling, and the 0th bit of the request type is 1 and is used to indicate a downlink scheduling request.

4. The scheduling method according to claim 2 or 3, characterized in that: The first and second bits of the request type are 00 to indicate default uplink scheduling, the first and second bits of the request type are 01 to indicate uplink trigger scheduling request, the first and second bits of the request type are 10 to indicate air interface reservation request, and the first and second bits of the request type are 11 for reservation.

5. The scheduling method according to any one of claims 2 to 4, characterized in that: The 3rd to 7th bits of the request type are reserved.

6. The scheduling method according to any one of claims 1 to 5, characterized in that: After determining the M network nodes scheduled in the current scheduling period, the method further includes: the control node sending a first scheduling message, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel.

7. The scheduling method according to any one of claims 1 to 6, characterized in that: The service information is used to indicate information about service data that the network node needs to transmit through a channel.

8. The scheduling method according to any one of claims 1 to 7, characterized in that: The service information includes at least one of the following information: service type, service flow, service delay, and service priority.

9. The scheduling method according to any one of claims 1 to 8, characterized in that: The control node is connected to the network node via an optical fiber.

10. The scheduling method according to claim 9, characterized in that: The control node is an MFU, and the network node is an SFU.

11. A scheduling method, characterized in that: include: The network node reports service information to the control node, where the service information includes a request type, and the request type includes default downlink scheduling, downlink scheduling request, default uplink scheduling, uplink trigger scheduling request, and air interface reservation request; The network node receives a first scheduling message sent by the control node, where the first scheduling message is used to indicate that the network node is allowed to compete for a channel; The network node competes for a channel according to the first scheduling message.

12. The scheduling method according to claim 11, characterized in that: The request type is 1 byte long.

13. The scheduling method according to claim 12, characterized in that: The 0th bit of the request type is 0 and is used to indicate default downlink scheduling, and the 0th bit of the request type is 1 and is used to indicate a downlink scheduling request.

14. The scheduling method according to claim 12 or 13, characterized in that: The first and second bits of the request type are 00 to indicate default uplink scheduling, the first and second bits of the request type are 01 to indicate uplink trigger scheduling request, the first and second bits of the request type are 10 to indicate air interface reservation request, and the first and second bits of the request type are 11 for reservation.

15. The scheduling method according to any one of claims 12 to 14, characterized in that: The 3rd to 7th bits of the request type are reserved.

16. The method according to any one of claims 11 to 15, characterized in that The method further comprises: The network node reports a first response message to the control node, where the first response message is used to indicate that the network node has competed for a channel.

17. The method according to any one of claims 11 to 16, characterized in that The method further comprises: The network node updates the service information to the control node in at least one of the following ways: The network node reports a second response message to the control node, where the second response message is used to indicate service information updated by the network node before or after service data transmission in the current scheduling period is completed; The network node periodically reports updated service information.

18. The method according to any one of claims 11 to 17, characterized in that The service information is used to indicate information about service data that the network node needs to transmit through a channel.

19. The method according to any one of claims 11 to 18, characterized in that The service information includes at least one of the following information: service type, service flow, service delay, and service priority.

20. A scheduling system, characterized in that: The system includes a control node and N network nodes, where N is a positive integer; The N network nodes are used to report service information to the control node respectively; The control node is used to: Receiving service information reported respectively by the N network nodes, the service information including a request type, the request type including a default downlink scheduling, a downlink scheduling request, a default uplink scheduling, an uplink trigger scheduling request, and an air interface reservation request; Determining, based on the service information respectively reported by the N network nodes, M network nodes scheduled in a current scheduling period, where M is a positive integer and is less than or equal to N; Sending a first scheduling message, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel; The M network nodes are further configured to respectively receive the first scheduling message and compete for a channel according to the first scheduling message.

21. A scheduling device, characterized in that: The device includes a transceiver unit and a processing unit; The transceiver unit is configured to receive service information reported by N network nodes respectively, where the service information includes a request type, and the request type includes a default downlink scheduling, a downlink scheduling request, a default uplink scheduling, an uplink trigger scheduling request, and an air interface reservation request, where N is a positive integer; The processing unit is configured to determine, based on the service information respectively reported by the N network nodes, M network nodes scheduled in a current scheduling period, where M is a positive integer and is less than or equal to N; The transceiver unit is further configured to send a first scheduling message, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel.

22. The device according to claim 21, characterized in that The transceiver unit is further configured to receive first response messages reported respectively by the M network nodes, where the first response messages are used to indicate that the network node has competed for a channel; The processing unit is further configured to determine, based on the first response message and the service information respectively reported by the N network nodes, P network nodes to be scheduled in the next scheduling period, where P is a positive integer and is less than or equal to N; The transceiver unit is further configured to send a second scheduling message, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for a channel.

23. The device according to claim 21 or 22, characterized in that The processing unit is further configured to update the service information of the network node by at least one of the following methods: receiving, by the transceiver unit, 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 node before or after service data transmission in the current scheduling period is completed; The updated service information periodically reported by the N network nodes is received by the transceiver unit.

24. The device according to any one of claims 21 to 23, characterized in that The service information is used to indicate information about service data that the network node needs to transmit through a channel.

25. The device according to any one of claims 21 to 24, characterized in that The service information includes at least one of the following information: service type, service flow, service delay, and service priority.

26. A scheduling device, characterized in that: The device includes a transceiver unit and a processing unit; The transceiver unit is configured to report service information to the control node, where the service information includes a request type, and the request type includes a default downlink scheduling, a downlink scheduling request, a default uplink scheduling, an uplink trigger scheduling request, and an air interface reservation request; The transceiver unit is further configured to receive a first scheduling message sent by the control node, where the first scheduling message is used to indicate that the network node is allowed to compete for a channel; The processing unit is configured to compete for a channel according to the first scheduling message.

27. The device according to claim 26, characterized in that The transceiver unit is further configured to report a first response message to the control node, where the first response message is used to instruct the network node to compete for a channel.

28. The device according to claim 26 or 27, characterized in that The transceiver unit is further configured to update the service information to the control node in at least one of the following ways: Reporting a second response message to the control node, where the second response message is used to indicate service information updated by the network node before or after service data transmission in the current scheduling period is completed; Periodically report updated business information.

29. The device according to any one of claims 26 to 28, characterized in that The service information is used to indicate information about service data that the network node needs to transmit through a channel.

30. The device according to any one of claims 26 to 29, characterized in that The service information includes at least one of the following information: service type, service flow, service delay, and service priority.

31. A chip, characterized in that: Used to implement the method according to any one of claims 1 to 10 or any one of claims 11 to 19.

Images