Scheduling method and scheduling apparatus

Abstract

Provided in the embodiments of the present application are a scheduling method and a scheduling apparatus, which are used for terminating a current air interface in advance, thereby reducing congestion in a network and improving the overall network performance of a wireless network. The scheduling method provided in the present application comprises: receiving a first message, and switching from a scheduled state to an air interface contention termination decision state on the basis of a first field of the first message, wherein the scheduled state is a state in which a first network node is scheduled to transmit first service data by means of an air interface, the air interface contention termination decision state is a state in which the first network node decides whether to terminate air interface contention, and the first field of the first message is used for indicating that the first network node terminates the air interface contention; if the first network node successfully decides to terminate the air interface contention, switching from the air interface contention termination decision state to a scheduling-pending state, wherein the scheduling-pending state is a preparation state in which the first network node prepares for air interface transmission; and if the first network node fails to decide to terminate the air interface contention, switching from the air interface contention termination decision state to a scheduled state.

Description

A scheduling method and a scheduling device

[0001] This application claims priority to Chinese Patent Application No. 202411563183.8, filed on November 4, 2024, entitled "A Scheduling Method and Scheduling Device", and to Chinese Patent Application No. 202411759202.4, filed with the State Intellectual Property Office of China on November 29, 2024, entitled "A Scheduling Method and Scheduling Device", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of optical communication technology, and in particular to a scheduling method and scheduling device. Background Technology

[0003] In a wireless local area network (WLAN), a control node connects to multiple network nodes. WLAN networks can reduce air interface contention between multiple network nodes (or between multiple network nodes and the control node) through time-domain coordinated transmission. Time-domain coordinated transmission refers to the coordinated air interface transmission between the control node and network nodes in the time domain.

[0004] In the time-domain cooperative transmission scheme, the control node determines the air interface transmission order of different network nodes and schedules the network nodes sequentially, thereby staggering the Wi-Fi air interfaces of different network nodes in time. This can reduce conflicts and efficiency degradation caused by air interface contention between multiple network nodes (or between multiple network nodes and the control node), providing a stable and reliable connection for terminal devices.

[0005] In a time-domain coordinated transmission scheme, time-domain scheduling for the next air interface (including scheduling, air interface contention, and service transmission phases) must be initiated only after the time-domain scheduling of the previous air interface is completed. If the air interface is blocked in the previous air interface due to reasons such as low service priority of network nodes or air interface congestion (e.g., scheduling, air interface contention, or service transmission processes are blocked), then the scheduling of the next air interface and even subsequent air interfaces will be delayed, affecting subsequent air interface transmission and impacting service experience. Summary of the Invention

[0006] This application provides a scheduling method and a scheduling device for early termination of the current air interface, thereby reducing network congestion and improving the overall network performance of the wireless network.

[0007] In a first aspect, this application provides a scheduling method, the method comprising: a first network node receiving a first message, switching from a scheduled state to a terminate air interface contention decision state according to a first field of the first message, wherein the scheduled state is a state in which the first network node is scheduled to transmit first service data through an air interface, and the terminate air interface contention decision state is a state in which the first network node decides whether to terminate air interface contention, and the first field of the first message is used to indicate that the first network node terminates air interface contention; if the first network node successfully decides to terminate air interface contention, then switches from the terminate air interface contention decision state to a pending scheduling state, wherein the pending scheduling state is a preparation state for the first network node to perform air interface transmission; if the first network node fails to decide to terminate air interface contention, then switches from the terminate air interface contention decision state to the scheduled state.

[0008] In this embodiment, the first network node terminates the current air interface (including scheduling, air interface contention, and service transmission stages) in advance based on the first message. This solution can promptly terminate the current air interface in cases of abnormal blocking or higher-priority service requests for air interface transmission, thereby ensuring the timely operation of the next air interface and even subsequent air interfaces. Preventing the entire network's air interface transmission queue from being blocked by the current air interface can improve the overall network transmission rate, thereby enhancing the user experience.

[0009] In one possible design, the scheduled state includes a scheduling and air interface contention state and a service transmission state. The scheduling and air interface contention state is the state in which the first network node performs scheduling and air interface contention, and the service transmission state is the state in which the first network node transmits the first service data through the air interface.

[0010] In this embodiment of the application, the scheduled state of the first network node includes the scheduling and air interface contention state and the service transmission state. When the first network node receives the first message in any of the above states, it can decide whether to terminate the air interface contention, thereby terminating the current air interface in any state of the scheduled state (scheduling and air interface contention state and service transmission state).

[0011] In one possible design, the first network node receives a first message and switches from a scheduled state to a terminate air interface contention decision state based on a first field of the first message, including: receiving the first message in the scheduling and air interface contention state, and switching from the scheduling and air interface contention state to the terminate air interface contention decision state based on the first field; the first network node switching from the terminate air interface contention decision state to the scheduled state includes: the first network node switching from the terminate air interface contention decision state to the scheduling and air interface contention state.

[0012] In this embodiment, the scheduling and air interface contention state is a preparation state before service data transmission. In this state, the first network node receives a first message and decides whether to terminate the current air interface. This allows for timely termination of the current air interface before service data transmission, preventing the scheduling cycle queue from being stuck in the preparation phase of service data transmission within the current air interface. This improves the overall network transmission rate and enhances the user experience.

[0013] In one possible design, the scheduling and air interface contention state includes a scheduling state and an air interface contention state, wherein the air interface contention state is the state in which the first network node engages in air interface contention, and the scheduling state is the state in which the first network node performs service scheduling; receiving the first message in the scheduling and air interface contention state, and switching from the scheduling and air interface contention state to the termination air interface contention decision state according to the first field of the first message, includes: receiving the first message in the air interface contention state, and switching from the air interface contention state to the termination air interface contention decision state according to the first field; the switching from the termination air interface contention decision state to the scheduling and air interface contention state includes: switching from the termination air interface contention decision state to the air interface contention state.

[0014] In this embodiment, the scheduling phase is part of the current air interface. If the scheduling phase is blocked, the current air interface will also be blocked. In this case, terminating the current air interface can ensure the timely operation of the next air interface and even more subsequent air interfaces. Preventing the entire network's air interface transmission queue from being blocked by the scheduling phase of the current air interface can improve the overall network transmission rate, thereby enhancing the user experience.

[0015] In one possible design, the scheduling and air interface contention state includes a scheduling state and an air interface contention state, wherein the air interface contention state is the state in which the first network node engages in air interface contention, and the scheduling state is the state in which the first network node engages in air interface scheduling; receiving the first message in the scheduling and air interface contention state, and switching from the scheduling and air interface contention state to the termination air interface contention decision state according to the first field of the first message, includes: receiving the first message in the scheduling state, and switching from the scheduling state to the termination air interface contention decision state according to the first field; the switching from the termination air interface contention decision state to the scheduling and air interface contention state includes: switching from the termination air interface contention decision state to the scheduling state.

[0016] In this embodiment, the scheduling phase is part of the current scheduling cycle (air interface). If the scheduling phase is blocked, the current scheduling cycle will also be blocked. In this case, terminating the current scheduling cycle (air interface) ensures the timely operation of the next scheduling cycle and even subsequent scheduling cycles. Preventing the entire network's air interface transmission queue (multiple scheduling cycles) from being blocked by the scheduling phase of the current scheduling cycle can improve the overall network transmission rate, thereby enhancing the user experience.

[0017] In one possible design, receiving a first message from the control node and switching from a scheduled state to a terminate air interface contention decision state based on a first field of the first message includes: receiving the first message in the service transmission state and switching from the service transmission state to the terminate air interface contention decision state based on the first field; the switching from the terminate air interface contention decision state to the scheduled state includes: switching from the terminate air interface contention decision state to the service transmission state.

[0018] In this embodiment, if the amount of data transmitted over the air interface during the current scheduling period is large, the air interface transmission phase latency of the current scheduling period (air interface) will be large. If there are services in the network with high latency requirements, these services may not tolerate the large latency of the air interface transmission phase during the current scheduling period. Therefore, by terminating the current scheduling period, the air interface transmission phase of the current scheduling period can be terminated in advance, and the high-latency service can be scheduled for air interface transmission in the next scheduling period, thereby reducing the service transmission latency in the next scheduling period.

[0019] In one possible design, after switching from the scheduled state to the transmission completed state, the method further includes: if the first network node sends a result reporting message, then switching from the transmission completed state to the pending scheduling state, wherein the result reporting message is used to indicate the transmission status of the first service data.

[0020] In this embodiment, after the first network node completes the transmission of service data, it sends a result reporting message to the control node to indicate the transmission status of the first service data. The control node can then determine the transmission status of the first service data in the current scheduling period, so that it can schedule the first network node and / or the first service data based on the transmission status in subsequent centralized scheduling. This can avoid redundant transmission of the first service data, determine the optimal transmission strategy for the first network node, and thus improve the user experience.

[0021] In one possible design, the scheduling state includes an idle (IDLE) state, a service reporting state, and a waiting time slot allocation state. The IDLE state is the initial scheduling state of the first network node, the service reporting state is the state in which the first network node reports service information, and the waiting time slot allocation state is the state in which the first network node waits to receive time allocation. Before receiving the first message, the method further includes: if the first network node detects that there is a service to be sent, it switches from the IDLE state to the service reporting state; if the first network node completes the reporting of service information, it switches from the service reporting state to the waiting time slot allocation state; if the first network node receives a time allocation (i.e., a second time allocation message) from the control node, it switches from the waiting time slot allocation state to the scheduled state.

[0022] In one possible design, the control node is the master gateway (MFU) of the fiber-to-the-room (FTTR) network, and the first network node is the slave gateway (SFU) of the FTTR network.

[0023] In this embodiment of the application, in the FTTR network, the MFU sends a first message to the SFU of the current scheduling period to terminate the current air interface (scheduling period). This scheme can promptly terminate the current air interface in cases such as abnormal blocking or higher-priority service requests for air interface transmission, thereby ensuring the timely operation of the next air interface and even subsequent air interfaces. Preventing the entire FTTR network's air interface transmission queue (multiple scheduling periods) from being blocked by the current scheduling period can improve the overall transmission rate of the FTTR network, thereby enhancing the user experience.

[0024] In one possible design, the first field includes a termination type field, wherein a first state of the termination type field indicates continued air interface contention, and a second state indicates termination of air interface contention.

[0025] In this embodiment of the application, the first message indicates whether to continue or terminate the current scheduling cycle through the termination type field. It can maintain the current scheduling cycle if termination is not required, or start the termination procedure for the current scheduling if termination is required.

[0026] Secondly, embodiments of this application provide a scheduling device, which includes a transceiver unit and a processing unit. The functions performed by the transceiver unit and the processing unit correspond to the steps performed by network nodes in any possible design or implementation of the first aspect described above.

[0027] Thirdly, embodiments of this application also provide a network device, the network device including one or more processors coupled to a memory storing computer program code, the computer program code including computer instructions. The processor executes the computer instructions in the memory to perform the methods provided in any possible design of the first aspect described above.

[0028] Optionally, the network device further includes a communication interface, to which the processor is coupled. The communication interface can be a transceiver or an input / output interface; when the network device is a chip included within the network device, the communication interface can be the chip's input / output interface. Optionally, the transceiver can be a transceiver circuit, and the input / output interface can be an input / output circuit.

[0029] Fourthly, embodiments of this application also provide a computer-readable storage medium storing a computer program that, when executed by a computer, causes the method provided in any possible design of the first aspect to be implemented.

[0030] Fifthly, embodiments of this application also provide a computer program product, which includes: computer program code, which, when executed by the processor of a network device, causes the network device to perform the method in any of the possible designs described in the first aspect.

[0031] Sixthly, embodiments of this application also provide a chip for reading and executing software programs stored in a memory to implement the method in any of the possible designs in the first aspect described above. The memory may be connected to the chip, or the memory may be built into the chip.

[0032] For details on the beneficial effects of any of the second to sixth aspects mentioned above, please refer to the beneficial effects of the various possible designs in the first aspect mentioned above; they will not be repeated here. Attached Figure Description

[0033] Figure 1 is a schematic diagram of the WLAN network architecture provided in this application;

[0034] Figure 2A is a schematic diagram of the system architecture of FTTH / O provided in the embodiment of this application;

[0035] Figure 2B is a schematic diagram of the optical communication system topology applied to FTTR provided in an embodiment of this application;

[0036] Figure 2C is a schematic diagram of the topology of another optical communication system for home networks provided in an embodiment of this application;

[0037] Figure 2D is a schematic diagram of the system architecture of FTTR provided in the embodiment of this application;

[0038] Figure 3A is a flowchart illustrating a scheduling method provided in an embodiment of this application;

[0039] Figure 3B is a schematic diagram of a state transition of a network node in the scheduling method provided in the embodiment of this application;

[0040] Figure 4 is a structural diagram of sending a termination request message provided in an embodiment of this application;

[0041] Figure 5 is a schematic diagram of a structure for sending a termination response message according to an embodiment of this application;

[0042] Figure 6A is another flowchart illustrating the scheduling method provided in an embodiment of this application;

[0043] Figure 6B is a schematic diagram of another state switching of a network node in the scheduling method provided in the embodiment of this application;

[0044] Figure 7 is another flowchart illustrating the scheduling method provided in an embodiment of this application;

[0045] Figure 8A is another flowchart illustrating the scheduling method provided in an embodiment of this application;

[0046] Figure 8B is a schematic diagram of another state switching of a network node in the scheduling method provided in the embodiment of this application;

[0047] Figure 9 is a schematic diagram of the structure of a scheduling device in an embodiment of this application;

[0048] Figure 10 is a schematic diagram of another scheduling device in an embodiment of this application;

[0049] Figure 11 is a schematic diagram of the structure of a chip provided in an embodiment of this application. Detailed Implementation

[0050] The embodiments of this application will now be described with reference to the accompanying drawings. Those skilled in the art will recognize that, with technological advancements and the emergence of new scenarios, the technical solutions provided in the embodiments of this application are equally applicable to similar technical problems.

[0051] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms are interchangeable where appropriate; this is merely a way of distinguishing objects with the same attributes in the embodiments of this application. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion, so that a process, method, system, product, or apparatus that comprises a series of units is not necessarily limited to those units, but may include other units not explicitly listed or inherent to those processes, methods, products, or apparatuses. Additionally, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can be expressed as: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0052] Referring to Figure 1, a possible WLAN network architecture is illustrated. The WLAN network architecture includes a wireless controller (also referred to as a "control node" in this embodiment), wireless access points (also referred to as "network nodes" in this embodiment), and terminal devices. The wireless controller is used to configure services and radio frequency for the access points. The wireless access point (AP) is used to provide service access to associated STAs. Terminal devices, acting as STAs, can be associated with the access point.

[0053] Terminal devices can include mobile phones (or "cellular" phones), computers with mobile terminal devices, portable, pocket-sized, handheld, and computer-embedded mobile devices, etc. Examples include 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 can also be computers, tablets, e-readers, and smart home devices such as smart TVs and smart speakers. As an example and not a limitation, in this embodiment, the terminal device can also be a wearable device. Wearable devices, also known as wearable smart devices or smart wearable devices, are a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices worn directly on the body or integrated into the user's clothing or accessories. Wearable devices are not merely hardware devices; they achieve powerful functions through software support, data interaction, and cloud interaction. Wearable smart devices in a broad sense include those that are feature-rich, large in size, and can perform all or part of their functions without relying on a smartphone, such as smartwatches or smart glasses, as well as those that focus on a specific type of application function and require the use of other devices such as smartphones, such as various smart bracelets, smart helmets, and smart jewelry for vital sign monitoring.

[0054] In a WLAN network, a control node connects to multiple network nodes. WLAN networks can reduce air interface contention between multiple network nodes (or between multiple network nodes and the control node) through time-domain coordinated transmission. Time-domain coordinated transmission refers to the coordinated air interface transmission between the control node and network nodes in the time domain.

[0055] The control node determines the network node to perform air interface transmission in the current scheduling cycle based on information such as the service traffic that multiple network nodes need to transmit over the air interface. It then sends a time allocation message to that network node, thereby scheduling it to perform air interface transmission in the current scheduling cycle.

[0056] The control node can schedule different network nodes to transmit over the air interface at different times based on information such as the service traffic of multiple network nodes. This controls the Wi-Fi transmission timing of different network nodes over the air interface, achieving high-efficiency transmission. Through coordination, the Wi-Fi air interface in the WLAN network can be reasonably controlled, reducing conflicts and efficiency degradation caused by air interface contention between multiple network nodes (or between multiple network nodes and the control node), and providing stable and reliable connections for terminal devices.

[0057] In the time-domain collaborative transmission scheme, the control node generates a scheduling sequence for multiple network nodes, and multiple scheduling cycles in the scheduling sequence are executed sequentially. Moreover, the time-domain scheduling of the next scheduling cycle must be started only after the time-domain scheduling of the previous scheduling cycle is completed. If, in the previous scheduling cycle (the Nth scheduling cycle), the Nth scheduling cycle is blocked on steps such as air interface contention (step (4) above) and air interface transmission (step (6) above) due to reasons such as low service priority of network nodes and busy air interface, the scheduling of the next scheduling cycle (the N+1th scheduling cycle) will be delayed, affecting the air interface transmission of network nodes in the N+1th scheduling cycle, thereby affecting the service experience.

[0058] With the development of networks, the requirements for network performance such as service latency and transmission rate are becoming increasingly stringent. Congestion in the previous scheduling cycle can cause delays in the next cycle and even subsequent cycles, and the duration of these delays is unpredictable, leading to problems such as increased service latency and decreased overall network transmission rate.

[0059] To address the aforementioned issues, this application provides a scheduling method that reduces network congestion and improves the overall performance of the wireless network by prematurely terminating the current scheduling cycle.

[0060] With the development of communication technology, optical fiber transmission is increasingly being used in communication systems, among which fiber to the room (FTTR) is a crucial component of optical networks. An FTTR system includes a main device and sub-devices, connected via optical fiber. The main device, acting as an optical network terminal (ONT) or optical network unit (ONU) in a passive optical network (PON), is connected to the optical line terminal (OLT) at the operator's central office via optical fiber.

[0061] PON can be gigabit-capable PON (GPON), Ethernet passive optical network (EPON), 10Gb / s Ethernet passive optical network (10G-EPON), time and wavelength division multiplexing passive optical network (TWDM-PON), 10gigabit-capable passive optical network (XG-PON), or 10-gigabit-capable symmetric passive optical network (XGS-PON), etc. Future advancements will increase PON speeds to 25Gbps, 50Gbps, or even 100Gbps; therefore, this application can also utilize PONs with even higher transmission rates.

[0062] Figure 2A illustrates the system architecture of Fiber to the Home / Office (FTTH / O). It connects upstream network-side equipment (such as switches and routers) and downstream ONTs via an optical distribution network (ODN). The ODN includes passive optical splitters for optical power distribution, a trunk fiber connecting the passive splitters and the OLT, and branch fibers connecting the passive splitters and ONTs. When transmitting downlink signals, the downlink signal sent by the OLT is transmitted to each ONT through the splitter, and the ONT selectively receives downlink data belonging to itself from the downlink signal. When transmitting uplink signals, the uplink signals sent by N ONTs are combined into a single optical signal by the splitter and transmitted to the OLT.

[0063] Building upon FTTH / O, to address signal coverage issues (such as wireless LAN (WLAN) signals) in home or office networks, fiber optic cables can be extended further into the room. Optical terminal equipment providing WLAN signals is installed inside the room, thus reducing the distance between the user terminal and the wireless access point (AP) and improving signal quality. This technology is called Fiber to the Room (FTTR).

[0064] This application's embodiments are applicable to WLAN deployments using Fiber to the Room (FTTR). In FTTR, fiber optic cables are laid to each room, and home gateways are interconnected by deploying edge network devices in each room. FTTR can meet the high bandwidth and latency requirements of new business applications such as online education, home office, and home entertainment. The edge network devices can be edge ONTs or access points (APs), acting as network nodes in the wireless network. In FTTR applications, gateway devices are deployed to manage the edge network devices. These gateway devices can be optical gateways, ONTs, or PON gateways, acting as control nodes in the wireless network.

[0065] As an example, Figure 2B shows a schematic diagram of an optical communication system topology applied to FTTR. An optical communication system applied to FTTR includes at least an optical gateway, a splitter, and multiple edge optical network terminals (edge ​​ONTs). In this embodiment, the edge ONT can also be called an EDGE ONT or an Edge ONT. The optical gateway can communicate with multiple EDGE ONTs separately through the splitter. The optical communication system also includes an OLT. The optical gateway is deployed between the OLT and the edge ONTs. In the FTTR scenario, the optical gateway connects to the home information box via fiber optic cable, and then connects to each room via the splitter. Each room deploys one edge ONT, 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 with multi-AP Wi-Fi cascading schemes, this improves the real-time performance of optical gateway management. Terminal devices can access the Edge ONTs to achieve network communication.

[0066] As another example, see Figure 2C, which shows a schematic diagram of an optical communication system topology for a home network application. The optical communication system includes at least an ONT and multiple APs. The ONT is used for collaborative management of the APs deployed in each room.

[0067] FTTR optical communication systems can employ passive optical networks (PONs).

[0068] Figure 2D is a schematic diagram of the FTTR system architecture. In FTTH / O, the OLT is deployed in the central equipment room, while the ONT is deployed in homes or offices. The master device in the FTTR network acts as both the ONT in the FTTH network and the upstream device for the FTTR slave devices, managing them. The slave devices in FTTR can be deployed in various rooms of homes or offices to provide signal to user terminals. The slave devices possess the functions of an ONT and can also function as wireless access points (APs).

[0069] Multiple slave devices can be deployed in an FTTR system, each connected to the master device via an optical splitter. The master device can centrally manage and configure all slave devices. The master device can also be called a "master gateway," "master optical modem," or "master FTTR unit (MFU)," while slave devices can be called "slave gateways," "slave optical modems," or "slave FTTR units (SFU)," etc.

[0070] In this embodiment, the FTTR architecture is used to terminate the current scheduling cycle early and promptly initiate the next scheduling cycle, thereby reducing network congestion and optimizing the overall network performance of FTTR. 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 is suitable for this embodiment. The above is merely an example of the FTTR architecture and is not intended to limit the scope.

[0071] The method provided in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0072] Figure 3A is an interactive flowchart of a scheduling method provided in an embodiment of this application. The scheduling method includes:

[0073] 301. The control node receives reports from multiple network nodes.

[0074] After the initialization and synchronization phases, multiple network nodes connected to the control node can send reporting messages to the control node. These reporting messages include information such as the network node's service traffic and service priority. Network nodes can proactively send this reporting message (service_report) to the control node when services / traffic change, or they can send it upon request from the control node; this application does not impose any limitations on this.

[0075] 302. The control node performs centralized scheduling.

[0076] The control node performs centralized scheduling based on the service traffic information of multiple network nodes and their historical scheduling records, generating a scheduling configuration. Centralized scheduling is cross-network node scheduling, meaning the control node selects one network node from among multiple network nodes for scheduling within the current cycle.

[0077] The control node can determine the first network node to be scheduled and determine the scheduling configuration of the first network node. This scheduling configuration may include the time allocation for the first network node. This time allocation includes the position and length of the scheduling cycle in which the first network node resides within the overall network scheduling cycle queue.

[0078] The scheduling configuration of the first network node may also include the air interface contention mode of the first network node, uplink and downlink data configuration, etc.

[0079] This step marks the beginning of the scheduling cycle for the first network node, and can be considered as the beginning of the Nth scheduling cycle for time-domain cooperative transmission.

[0080] 303. The control node sends a time allocation message to the first network node.

[0081] Once the scheduling configuration of the first network node is determined, the control node can send a time assignment message to the first network node. The time assignment message includes the aforementioned scheduling configuration and is used to configure the air interface transmission behavior of the first network node.

[0082] In this embodiment of the application, the time allocation message can also be called a scheduling message.

[0083] 304. The first network node initiates its scheduling cycle based on the time allocation message.

[0084] The time allocation message indicates that the first network node is permitted to transmit over the air interface. Upon receiving the time allocation message, the first network node initiates its scheduling cycle based on the message. This scheduling cycle includes stages such as scheduling, air interface contention, and air interface transmission.

[0085] During the scheduling phase, the first network node performs service scheduling and configures the parameters of its Wi-Fi module. Service scheduling involves determining the users and / or services to be transmitted in the current scheduling period. The first network node can configure its Wi-Fi module parameters based on the transmission parameters in the time allocation message, local historical parameters, or parameters from the initialization phase; this application does not impose any limitations on these configurations. Optionally, transmission parameters, historical parameters, etc., may include EDCA parameters, RTS / CTS configuration, etc.

[0086] During the air interface contention phase, the first network node competes with other network nodes in the network that have applied for air interface resources.

[0087] During the air interface transmission phase, the first network node uses the air interface resources it has won to transmit service data over the air interface (i.e., send service data).

[0088] 305. The control node sends the first message to the first network node.

[0089] In certain situations (such as when the current scheduling period is too long, or when a higher-priority service request requires air interface transmission), the control node can send a first message to the first network node. The first field in the first message is used to instruct the first network node to terminate air interface contention.

[0090] In this embodiment, the first message can be a scheduling message. As shown in Table 1, the scheduling information includes fields such as scheduling type, scheduling mode, start time, and termination type. The termination type field can be the first field, used to indicate whether air interface contention needs to be terminated (i.e., whether the current scheduling period needs to be terminated). The length of the termination type field can, for example, be one byte. It is worth noting that one byte is merely an example; the termination type field can be longer or shorter, and this application does not limit this.

[0091] Table 1 Contents of the Sending Scheduling Information

[0092] As shown in Table 1, a value of 0 for the Termination Type field indicates "Continue air interface contention" (i.e., continue the current scheduling cycle), a value of 1 indicates "Terminate air interface contention" (i.e., terminate the current scheduling cycle), and other values ​​for the Termination Type field are reserved fields. Reserved fields are used to reserve fields for functions to be developed or functions that have not yet been developed, and are used to extend message functions. The same applies to reserved fields in subsequent embodiments, and will not be repeated hereafter.

[0093] Optionally, "Continue air interface contention" or "Terminate air interface contention" can also be represented by other values ​​of the termination type field. Alternatively, "Continue air interface contention" can be represented by an empty termination type field, and "Terminate air interface contention" can be represented by a non-empty termination type field, or vice versa. Alternatively, "Terminate air interface contention" (and "Continue air interface contention", optional) can be represented by other values ​​or states of the termination type field.

[0094] In the embodiments of this application, the sending scheduling information may also be referred to as sending a termination request message, transmitting a termination request message, or other message names, and this application does not limit it in this way.

[0095] Optionally, the first message can also be a message specifically used to indicate whether air interface contention needs to be terminated, using some fields, bits, etc., to indicate whether air interface contention should continue or terminate. This application does not limit this.

[0096] Figure 4 is an example of the frame structure of a first message provided in an embodiment of this application. Optionally, the frame structure of the first message includes, but is not limited to, the following information: message type, request type, and reserved bits. The message type indicates that the message is the first message. The request type is used to indicate whether to continue / terminate air interface contention (i.e., whether to continue / terminate the current scheduling cycle). Reserved bits are reserved for functions to be developed or functions not yet developed, used to extend message functionality. The same applies to reserved bits in subsequent embodiments, and will not be repeated hereafter.

[0097] 306. The first network node sends a second message to the control node.

[0098] Based on the first message, the first network node initiates a termination operation for the current scheduling cycle, terminating the specific phase (e.g., scheduling phase, air interface contention phase, air interface transmission phase) of the scheduling cycle being executed by the first network node. Then, based on the final result of the termination operation, it sends a second message to the control node. The second field in the second message indicates whether the air interface contention was successfully terminated.

[0099] In this embodiment, the second message can be a scheduling and transmission result message. As shown in Table 2, the scheduling and transmission result message includes fields such as air interface contention result, contention failure reason, transmission result reporting, and air interface termination result. The air interface termination result field is the second field, used to indicate whether air interface contention was successfully terminated (i.e., whether the current scheduling period was successfully terminated). The length of the air interface termination result field can, for example, be one byte. It is worth noting that one byte is merely an example; the air interface termination result field can be longer or shorter, and this application does not limit this.

[0100] Table 2 contains the scheduling and sending result messages.

[0101] Table 2 (continued) Contents of scheduling and sending result messages

[0102] The aggregation length or aggregation size can also be represented by 4 bytes, 6 bytes, or 8 bytes, etc., and this application does not limit it.

[0103] As shown in Table 2, a value of 0 in the Termination of Air Interface Result field indicates "Successful Termination of Air Interface Contention" (i.e., successful termination of the current scheduling cycle).

[0104] A value of 1 in the Termination of Air Interface Result field indicates "Failed to terminate air interface contention, and the reason for failure is: network node does not support" (i.e., failed to terminate the current scheduling period, and the reason for failure is: network node does not support).

[0105] A value of 2 in the Termination of Air Interface Result field indicates "Failed to terminate air interface contention, and the reason for failure is: air interface contention has been won, and the air interface cannot be interrupted" (i.e., failure to terminate the current scheduling cycle, and the reason for failure is: air interface contention has been won, and the air interface cannot be interrupted).

[0106] A value of 3 in the Termination of Air Interface Result field indicates "Failed to terminate air interface contention, and the reason for failure is: transmission completed" (i.e., failed to terminate the current scheduling period, and the reason for failure is: transmission completed).

[0107] Other values ​​for the terminated air interface result field are reserved fields.

[0108] Optionally, the above four cases can also be represented by terminating other possible values ​​for the air interface result field.

[0109] Optionally, the air interface termination result field can only reflect "Successful termination of air interface contention" (i.e., successful termination of the current scheduling period) or "Failed termination of air interface contention" (i.e., failed termination of the current scheduling period). That is, the air interface termination result field does not reflect the reason for the termination failure. The two states of success or failure are represented by different values ​​or states (field is empty / not empty) of the air interface termination result field.

[0110] In the embodiments of this application, the scheduling and sending result message may also be called a sending termination response message, a transmission termination response message, or other message names, and this application does not limit it in this way.

[0111] Optionally, the second message can also be a message specifically used to indicate whether the air interface contention has been successfully terminated, using some fields, bits, etc., to indicate whether the air interface contention has been successfully terminated. This application does not limit this.

[0112] Figure 5 shows an example of the frame structure of the second message provided in an embodiment of this application. Optionally, the frame structure of the second message includes, but is not limited to, the following information: message type, response type, and reserved bits. The message type can indicate that the message is the first message. The response type is used to indicate whether air interface contention was successfully terminated (i.e., whether the current scheduling period was successfully terminated).

[0113] According to the first message, the first network node initiates a termination operation for the current scheduling cycle, terminating the specific phase (e.g., scheduling phase, air interface contention phase, air interface transmission phase) of the scheduling cycle that the first network node is currently executing.

[0114] The first network node can determine whether it supports terminating a phase of the currently executing scheduling cycle based on its own capabilities.

[0115] If the first network node has the ability to terminate the current stage of the current scheduling cycle, it terminates the current stage, sets the termination air interface result field to 0, and sends a second message to the control node.

[0116] If the first network node does not have the ability to terminate the current scheduling cycle, it will set the termination air interface result field to 1 and send a second message to the control node.

[0117] If the first network node has entered the air interface contention stage and won the air interface resources before step 306, or has entered the air interface transmission stage, then after receiving the send termination request message in step 306, the first network node can perform air interface transmission based on the won air interface resources, set the terminated air interface result field to 2, and send the second message to the control node.

[0118] If the first network node has already entered the air interface transmission stage before step 306, and the transmission has been completed when step 306 occurs, then after receiving the first message in step 306, the first network node can assign the value 3 to the terminate air interface result field and send the second message to the control node.

[0119] 307. If the second field indicates that the air interface contention was successfully terminated, the control node starts the next scheduling cycle.

[0120] According to the second message, the control node determines that the air interface contention has been successfully terminated (i.e., the current scheduling cycle has been successfully terminated). The control node can then start the next scheduling cycle and perform steps such as determining the scheduling configuration for the second network node (or the new service of the first network node) and sending time allocation messages.

[0121] This step marks the beginning of the next scheduling cycle, and can be considered as the beginning of the N+1th scheduling cycle of time-domain cooperative transmission.

[0122] 308. If the second field indicates that the air interface contention failed to terminate, the first network node continues to execute the current scheduling cycle.

[0123] If the second field indicates that the termination of air interface contention failed (i.e., the termination of the current scheduling cycle failed), the current scheduling cycle will continue to be executed. The first network node will continue to perform scheduling, air interface contention, air interface transmission and other operations, and send a result reporting message to the control node after completing the air interface transmission.

[0124] It is worth noting that steps 307 and 308 are two branch options, and only one of them can occur in a solution.

[0125] In this embodiment, the control node sends a first message to the first network node of the current scheduling cycle to terminate the current scheduling cycle (also known as the air interface, including air interface contention, scheduling, and service transmission). This scheme can promptly terminate the current scheduling cycle in cases of abnormal blocking or higher-priority service requests for air interface transmission, thereby ensuring the timely operation of the next scheduling cycle and even subsequent scheduling cycles. Preventing the entire network's air interface transmission queue (multiple scheduling cycles) from being blocked by the current scheduling cycle can improve the overall network transmission rate, thereby enhancing the user experience.

[0126] The scheduling method provided in this application can be applied to FTTR networks. In any embodiment of this application, the control node can be the master gateway (MFU) in the FTTR network, and the first network node can be the slave gateway (SFU) in the FTTR network, which will not be elaborated further below.

[0127] In this embodiment, the current scheduling cycle of the first network node is terminated by sending a first message from the control node. The sending of the first message can be triggered for different reasons in different scenarios. For example, the current scheduling cycle may last too long, or there may be a higher-priority service request for air interface transmission.

[0128] If the triggering reason is that the current scheduling period lasts too long, then in step 303, while sending the time allocation message, the control node starts a timer. The length of the timer is greater than or equal to the preset duration of the scheduling period, such as 5 milliseconds or 10 milliseconds.

[0129] It is worth noting that the timer duration may differ for services of different priorities. For example, if the current scheduling cycle is configured so that the first network node transmits low-priority service packets over the air interface, a shorter preset duration (timer) is set; for high-priority services, a longer preset duration (timer) is set. This reduces the probability of high-priority services being terminated during their scheduling cycle, improves the transmission efficiency of high-priority service packets, and enhances the user experience.

[0130] After step 303, if the timer times out and no transmission result report message is received from the first network node, then step 305 is executed, and the control node sends a transmission termination request to the first network node.

[0131] In this embodiment, the timer starts when the control node sends a time allocation message to the first network node (after the current scheduling period begins), and the timer's length is greater than or equal to the preset duration of the scheduling period (i.e., the air interface). Therefore, if the timer times out and no transmission result report message is received from the first network node, it indicates that the duration of the current scheduling period (current air interface) exceeds the preset duration, and the current scheduling period can be considered abnormal (or blocked). By sending a termination request message to terminate the abnormal (or blocked) current scheduling period, the air interface transmission queue (multiple scheduling periods) of the entire network can be prevented from being blocked by the current scheduling period, ensuring the timely operation of the next scheduling period and even subsequent scheduling periods. This improves the overall network transmission rate, reduces overall network latency, and enhances the user experience.

[0132] It is worth noting that, in addition to timers, control nodes can also determine the duration of the current scheduling cycle based on other methods, such as timers, and this application does not limit this.

[0133] For cases where the triggering reason is a higher-priority service request for air interface transmission, the specific triggering process is as follows:

[0134] After step 303, the control node receives a request message requesting the transmission of high-priority service data. The priority of high-priority services is higher than that of services transmitted in the current scheduling cycle. Therefore, based on this request message, the control node executes step 305, sending a first message to the first network node.

[0135] In this embodiment, when a high-priority service requests air interface transmission, the control node terminates the current scheduling cycle in advance by sending a termination request message, and schedules the high-priority service for transmission in the next scheduling cycle. This allows high-priority services to be transmitted over the air interface more quickly, reducing the response time of high-priority services and improving the user experience.

[0136] Optionally, upon receiving the aforementioned request message, the control node can also determine whether to terminate the current scheduling cycle based on the duration already elapsed. For example, if the preset duration of the current scheduling cycle is 5 milliseconds, the control node can start timing when sending the time allocation message (step 303). If, upon receiving the aforementioned request message, the actual duration already elapsed in the current scheduling cycle is short (e.g., 1 millisecond), and there is still a considerable amount of time remaining before the current scheduling cycle is completed, the control node executes step 305 to terminate the current scheduling cycle. If the actual duration already elapsed in the current scheduling cycle is long, and it is approaching the preset duration of the current scheduling cycle, the control node can choose to wait for the current scheduling cycle to complete before scheduling the transmission of high-priority service data.

[0137] It is worth noting that the control node can also combine the aforementioned timer with high-priority triggers to determine whether to send the first message; this application does not limit this.

[0138] It is important to note that the above triggering reasons are merely examples and do not limit the reasons why the control node sends the first message. The control node can also terminate the current scheduling cycle via the first message in other situations where termination of the current scheduling cycle is required.

[0139] It is worth noting that in the embodiments of this application described below, the control node may also send a first message based on the above-mentioned triggering reasons, which will not be repeated hereafter.

[0140] In this embodiment, the control node terminates the current scheduling cycle of the first network node by sending a first message to the first network node. Before the current scheduling cycle, the first network node is in a pending scheduling state. During the current scheduling cycle, before the service data is transmitted over the air interface, the first network node is in a scheduled state; after the service data transmission is completed, the first network node is in a transmission completion state.

[0141] The pending scheduling state is a preparation state for network nodes to perform air interface transmission. In this state, network nodes wait to obtain the scheduling configuration allocated to them by the control node, and network nodes do not compete for air interface resources.

[0142] The scheduled state refers to the state in which a network node is scheduled to transmit service data through the air interface. In this state, the network node includes scheduling and air interface contention states, as well as service transmission states (i.e., air interface transmission states).

[0143] The "Transmission Completed" status indicates that the network node has completed air interface transmission. In this status, the network node has finished sending the service data.

[0144] Network nodes also include an air interface contention termination decision state, also known as an end-of-current-scheduling-cycle decision state, which is the state in which the network node decides whether to terminate the current scheduling cycle.

[0145] The switching of network nodes between different states is shown in Figure 3B and in Table 3 below.

[0146] Table 3. Switching between different states of network nodes (A)

[0147] Among them, the decision state to terminate air interface contention, also known as the decision state to terminate the current scheduling cycle, is the state in which the network node decides whether to terminate the current scheduling cycle, and will not be explained again hereafter.

[0148] Reporting successful termination means sending a second message to the control node, with the second field in the second message indicating successful termination of the current scheduling period; reporting failed termination means sending a second message to the control node, with the second field in the second message indicating failed termination of the current scheduling period. This will not be repeated hereafter.

[0149] In the waiting-to-be-scheduled state, if the first network node receives a time allocation message (time_assignment) from the control node (corresponding to step 303 above), the first network node switches from the waiting-to-be-scheduled state to the scheduled state.

[0150] In the scheduled state, the first network node executes the current scheduling cycle (i.e., step 304 above, including scheduling, air interface contention, and sending service data on the acquired air interface resources).

[0151] In the scheduled state, if the first network node completes the transmission of service data and the air interface occupation ends, the first network node switches from the scheduled state to the transmission completion state and sends a transmission result report message (of service data) to the control node.

[0152] In the scheduled state, if the first network node receives the first message from the control node (corresponding to step 305 above), the first network node switches from the scheduled state to the decision state to terminate the current scheduling cycle, and begins to decide whether to terminate the current scheduling cycle.

[0153] In the decision state to terminate the current scheduling cycle, if the first network node successfully terminates the decision (decides to terminate the current scheduling cycle), the first network node switches from the decision state to the pending scheduling state. The first network node terminates the current scheduling cycle and reports a termination success response message (corresponding to step 306 above, and the second field of the second message in step 306 indicates successful termination).

[0154] If the first network node fails to terminate the current scheduling cycle decision state (the decision not to terminate the current scheduling cycle), the first network node switches from the current scheduling cycle termination decision state to the pending scheduling state (corresponding to step 308 above). The first network node reports a termination failure response message (corresponding to step 306 above, and the second field of the second message in step 306 indicates termination failure).

[0155] Upon completion of transmission, the first network node sends a transmission result report message (for service data) to the control node. The first network node then transitions from the transmission completion state to the pending scheduling state (for the next scheduling cycle).

[0156] Optionally, upon receiving the first message, the first network node switches to the decision state to terminate the current scheduling cycle. Within this decision state, it then determines whether the first message indicates continuation or termination of the current scheduling cycle. After determining that the message indicates termination, the termination decision process begins.

[0157] Alternatively, after receiving the first message, the first network node can first determine whether the first message indicates continuation of the current scheduling cycle or termination of the current scheduling cycle. If it determines that the message indicates termination of the current scheduling cycle, it then switches to the decision state to terminate the current scheduling cycle.

[0158] In this embodiment, the current scheduling period includes stages such as scheduling, air interface contention, and air interface transmission. The termination of the current scheduling period may occur within any of the above stages.

[0159] I. The termination of the current scheduling cycle occurs during the air interface contention phase of the current scheduling cycle.

[0160] Figure 6A is a schematic diagram of the process by which the control node requests to terminate the current scheduling cycle during the air interface contention phase of the current scheduling cycle.

[0161] 601. The control node receives reports from multiple network nodes.

[0162] 602. The control node performs centralized scheduling.

[0163] 603. The control node sends a time allocation message to the first network node.

[0164] Steps 601-603 are described in the embodiment shown in Figure 3A and will not be repeated here.

[0165] 604. The first network node performs scheduling.

[0166] After receiving the time allocation message, the first network node initiates its own scheduling based on the message. This scheduling, also known as local scheduling, includes service scheduling and parameter configuration. Service scheduling refers to the first network node determining the users and / or services to be transmitted in the current scheduling period after being assigned to it, and thus scheduling these local users and / or services. Parameter configuration refers to the first network node configuring the parameters of its Wi-Fi module according to the transmission parameters.

[0167] Optionally, the scheduling configuration of the time allocation message may include transmission parameters of the air interface transmission behavior of the first network node, so that the first network node can configure the parameters of its Wi-Fi module according to the transmission parameters.

[0168] 605. The first network node engages in air interface contention.

[0169] After configuration is complete, the first network node initiates contention on the air interface based on the current configuration.

[0170] Optionally, during the initialization and synchronization phase prior to step 601, the control node may send transmission parameters, such as EDCA parameters and RTS / CTS configuration, to the first network node. The first network node may then compete for air interface access based on these transmission parameters.

[0171] 606. The control node sends the first message to the first network node.

[0172] Step 606 is the same as step 305 in the embodiment shown in Figure 3A, and will not be repeated here.

[0173] 607. The first network node sends a second message to the control node.

[0174] According to the first message, the first network node initiates a termination operation for the current scheduling cycle, terminating the specific phase (the air interface contention phase in this embodiment) of the scheduling cycle that the first network node is currently executing. The first network node can determine whether to support the termination of air interface contention based on its own capabilities. For example, if the chip of the first network node does not support suspending the air interface contention task queue, then the first network node does not support the termination of air interface contention.

[0175] If the first network node lacks the capability to terminate the air interface contention phase, it assigns the value 1 to the second field of the second message and sends a second message to the control node. The second field in this message indicates that the termination operation for the current scheduling period failed because the first network node does not support the function of terminating air interface contention.

[0176] If the first network node has the ability to terminate the air interface contention phase, it terminates the current air interface contention, sets the second field in the second message to 0, and sends the second message to the control node.

[0177] 608. If the second field indicates that the current scheduling cycle was successfully terminated, the control node starts the next scheduling cycle.

[0178] Step 608 refers to step 307 of the embodiment shown in Figure 3A, and will not be repeated here.

[0179] 609. If the second field indicates that the current scheduling cycle has failed to be terminated, the first network node continues to compete for air interface, transmit air interface data, and send result reporting messages to the control node.

[0180] If the second field indicates that terminating the current scheduling cycle fails, the current scheduling cycle will continue to be executed. The first network node will continue to compete for and transmit over the air interface, and after completing the air interface transmission, it will send a result reporting message to the control node.

[0181] It is worth noting that steps 608 and 609 are two branch options, and only one of them can occur in a solution.

[0182] In this embodiment, since the situation of the WLAN devices competing for air interface access with the first network node is unpredictable, the duration of air interface access competition by the first network node is uncontrollable. If the current scheduling cycle of the first network node is blocked in the air interface access competition phase, the air interface transmission phase of the current scheduling cycle can be terminated in a timely manner by terminating the current scheduling cycle, thereby avoiding the uncontrollable latency of the air interface access competition phase of the current scheduling cycle and making the latency of the entire network relatively controllable.

[0183] In some cases, it can also reduce overall network latency. If, during the air interface contention phase of the current scheduling cycle, the first network node is at a disadvantage, causing the current scheduling cycle to be blocked in the air interface contention phase, and the first network node's air interface contention causes significant latency, then terminating the current scheduling cycle and scheduling the first network node's air interface transmission in a subsequent scheduling cycle may put the first network node in an advantageous position in the air interface contention of the subsequent scheduling cycle. In this case, the latency of the first network node's air interface contention is reduced, which can reduce the overall network latency.

[0184] In this embodiment of the application, the pending scheduling states of the network nodes shown in Table 3 and Figure 3B may include IDLE state, service reporting state, and waiting time slot allocation state; the scheduled state may include scheduling and air interface contention state and service transmission state. For a description of the different states of the network nodes, please refer to Table 4 below.

[0185] Table 4 Different states of network nodes

[0186] The "waiting for time slot allocation" state refers to the state in which a network node waits to obtain a time allocation (or time slot allocation) from the control node. This time allocation includes the position and length of the network node's scheduling cycle within the overall network scheduling cycle queue. The first network node typically obtains this time allocation through a time allocation message (time_assignment, such as steps 303, 603, 703, and 803).

[0187] The "Terminate Air Interface Contention Decision State," also known as the "Terminate Current Scheduling Cycle Decision State," is where network nodes decide whether to terminate the current scheduling cycle. This state occurs between steps 305 and 306, 606 and 607, 705 and 706, and 807 and 808.

[0188] If a network node receives a transmission termination request message while in scheduling and air interface contention state, the switching between different states of the network node is shown in Figure 6B. The switching process between different states in Figure 6B can be illustrated in Table 5 below.

[0189] Table 5. Switching between different states of network nodes (B)

[0190] Furthermore, under scheduling and air interface contention conditions, contention may also fail. In this case, the scheduling and air interface contention conditions in Table 5 are updated as follows:

[0191] The first message, also known as the termination request message, is used to indicate whether to terminate air interface contention. If the contention fails, the first network node will enter the IDLE state and then report the air interface contention failure to the MFU, so that the MFU is aware of the SFU contention status.

[0192] In Figure 6B and Table 5, the scheduling and air interface contention states can be divided into two stages: the air interface scheduling state stage and the air interface contention state stage.

[0193] If the first network node receives the first message during the air interface contention phase, the first network node enters the decision state to terminate the current scheduling cycle. If the decision to terminate is successful, it enters the IDLE state. If the decision to terminate fails, it returns to the air interface contention state.

[0194] Second, the termination of the current scheduling cycle occurs during the air interface scheduling phase of the current scheduling cycle.

[0195] Figure 7 is a schematic diagram of the process by which a control node requests to terminate the current scheduling cycle during the air interface scheduling phase of the current scheduling cycle.

[0196] 701. The control node receives reports from multiple network nodes.

[0197] 702. Centralized configuration of control nodes.

[0198] 703. The control node sends a time allocation message to the first network node.

[0199] 704. The first network node performs scheduling based on the time allocation message.

[0200] Steps 701-704 are described in the embodiment shown in Figure 6A and will not be repeated here.

[0201] 705. The control node sends the first message to the first network node.

[0202] Step 705 refers to step 305 of the embodiment shown in Figure 3A, and will not be repeated here.

[0203] 706. The first network node sends a second message to the control node.

[0204] According to the first message, the first network node initiates a termination operation for the current scheduling cycle, terminating the specific phase (the scheduling phase in this embodiment) of the scheduling cycle that the first network node is currently executing. The first network node can determine whether to support the termination of the scheduling based on its own capabilities.

[0205] If the first network node lacks the capability to terminate the scheduling phase, it sets the second field in the second message to 1 and sends a second message to the control node. The second field in this message indicates that the termination operation for the current scheduling period failed because the first network node does not support the termination function.

[0206] If the first network node has the ability to terminate the scheduling phase, it terminates the current scheduling, sets the second field in the second message to 0, and sends the second message to the control node.

[0207] 707. If the second field indicates that the current scheduling cycle has been successfully terminated, the control node starts the next scheduling cycle.

[0208] Step 707 refers to step 307 of the embodiment shown in Figure 3A, and will not be repeated here.

[0209] 708. If the second field indicates that the current scheduling cycle has failed to be terminated, the first network node continues to perform scheduling, air interface contention, air interface transmission, and send result reporting messages to the control node.

[0210] If the second field indicates that terminating the current scheduling cycle fails, the current scheduling cycle will continue to be executed. The first network node will continue to perform scheduling, air interface contention, and air interface transmission, and will send a result reporting message to the control node after completing the air interface transmission.

[0211] It is worth noting that steps 707 and 708 are two branch options, and only one of them can occur in a solution.

[0212] In this embodiment, the scheduling phase is part of the current scheduling cycle. If the scheduling phase is blocked, the current scheduling cycle will also be blocked. In this case, terminating the current scheduling cycle can ensure the timely operation of the next scheduling cycle and even subsequent scheduling cycles. Preventing the entire network's air interface transmission queue (multiple scheduling cycles) from being blocked by the scheduling phase of the current scheduling cycle can improve the overall network transmission rate, thereby enhancing the user experience.

[0213] If the first network node receives the first message during the scheduling phase, the switching between different states of the first network node is shown in Figure 6B. Specifically, if the first network node receives the first message during the scheduling phase, it enters the decision state to terminate the current scheduling cycle. If the decision to terminate is successful, it enters the IDLE state; if the decision to terminate fails, it returns to the scheduling state.

[0214] 3. The termination of the current scheduling cycle occurs during the air interface transmission phase of the current scheduling cycle.

[0215] Figure 8A is a schematic diagram of the process by which a control node requests to terminate the current scheduling cycle during the air interface transmission phase of the current scheduling cycle.

[0216] 801. The control node receives reports from multiple network nodes.

[0217] 802. The control node performs centralized scheduling.

[0218] 803. The control node sends a time allocation message to the first network node.

[0219] 804. The first network node performs air interface scheduling based on the time allocation message.

[0220] 805. The first network node engages in air interface contention.

[0221] Steps 801-805 are described in the embodiment shown in Figure 6A and will not be repeated here.

[0222] 806. The first network node performs air interface transmission.

[0223] After the air interface contention is completed, the first network node acquires the air interface resources and can begin air interface transmission.

[0224] 807. The control node sends the first message to the first network node.

[0225] Step 807 refers to step 305 of the embodiment shown in Figure 3A, and will not be repeated here.

[0226] 808. The first network node sends the second message to the control node.

[0227] According to the first message, the first network node initiates a termination operation for the current scheduling cycle, terminating the specific stage (the air interface transmission stage in this embodiment) of the scheduling cycle that the first network node is currently executing.

[0228] The first network node can determine whether it supports terminating air interface transmissions based on its own capabilities. For example, if the chip of the first network node does not support terminating or suspending the air interface transmission task queue, then the first network node does not support terminating air interface transmissions.

[0229] If the first network node lacks the capability to terminate the air interface contention phase, it assigns the value 1 to the second field and sends a second message to the control node. The second field in this message indicates that the termination operation for the current scheduling period failed because the first network node does not support the termination function for air interface transmission.

[0230] If the first network node has the ability to terminate the air interface transmission phase, it terminates the current air interface transmission (e.g., terminates or suspends the air interface transmission queue), sets the second field to 0, and sends the second message to the control node.

[0231] Optionally, if the remaining duration of the current air interface transmission task is short, the first network node may choose to complete the current air interface transmission process. In this case, the first network node continues the current air interface transmission operation, assigns the value of the second field to 4, and sends a second message to the control node. The second field in this message indicates that the first network node will not terminate the current scheduling period, causing the termination operation for the current scheduling period to fail.

[0232] 809. If the second field indicates that the current scheduling cycle was successfully terminated, the control node starts the next scheduling cycle.

[0233] Step 809 refers to step 307 of the embodiment shown in Figure 3A, and will not be repeated here.

[0234] 810. If the second field indicates that the current scheduling cycle has failed to be terminated, the first network node continues to perform air interface transmission and sends a result reporting message to the control node.

[0235] If the second field indicates that terminating the current scheduling cycle failed, the current scheduling cycle will continue to be executed. The first network node will continue to perform air interface transmission and send a result reporting message to the control node after completing the air interface transmission.

[0236] It is worth noting that steps 809 and 810 are two branch options, and only one of them can occur in a single solution.

[0237] In this embodiment, if the amount of data transmitted over the air interface in the current scheduling period is large, the air interface transmission phase latency of the current scheduling period will be large. If there are services in the network with high latency requirements, these services may not tolerate the large latency of the air interface transmission phase in the current scheduling period. Therefore, by terminating the current scheduling period, the air interface transmission phase of the current scheduling period can be terminated in advance, and the high-latency service can be scheduled for air interface transmission in the next scheduling period, thereby reducing the service transmission latency in the next scheduling period.

[0238] This solution is particularly suitable for situations where the current scheduling cycle requires a large amount of business data but has low latency requirements, and where there are services with high latency requirements waiting to be transmitted in the network.

[0239] If the second message sent by the control node in step 808 arrives at the first network node just after the first network node has completed its air interface transmission, then in step 808, the first network node can assign the value 3 to the second field and send the second message to the control node. The second field in this message indicates that the termination operation for the current scheduling cycle failed because the first network node completed its air interface transmission. Therefore, steps 809 and 810 are not executed subsequently; instead, the first network node sends a result reporting message to the control node, completing the current scheduling cycle.

[0240] If a network node receives the first message in the air interface transmission state (also known as the service transmission state), the switching between different states of the network node is shown in Figure 8B. The switching process between different states in Figure 8B can be illustrated in Table 6 below.

[0241] Table 6. Switching between different states of network nodes (C)

[0242] Based on the same inventive concept as the above method embodiments, this application also provides a scheduling device 900, as shown in FIG9. This device can be set on a first network node. The scheduling device 900 includes a transceiver unit 901 and a processing unit 902. The scheduling device 900 can be used to implement the method described in the above method embodiments. The optional transceiver unit 901 and processing unit 902 can be interconnected via a communication line 903. The communication line 903 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The communication line 903 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is used in FIG9, but this does not indicate that there is only one bus or one type of bus.

[0243] The transceiver unit 901 is used to receive a first message, wherein a first field of the first message is used to instruct the first network node to terminate air interface contention.

[0244] The processing unit 902 is used to switch from a scheduled state to a terminate air interface contention decision state according to a first field of the first message. The scheduled state is the state in which the first network node is scheduled to transmit the first service data through the air interface. The terminate air interface contention decision state is the state in which the first network node decides whether to terminate the air interface contention.

[0245] The processing unit 902 is further configured to, upon successful decision by the first network node to terminate air interface contention, switch the first network node from the air interface contention termination decision state to a waiting-to-be-scheduled state, wherein the waiting-to-be-scheduled state is a preparation state for the first network node to perform air interface transmission.

[0246] The processing unit 902 is further configured to switch the first network node from the decision to terminate air interface contention to the scheduled state when the first network node fails to do so.

[0247] In one possible design, the scheduled state includes a scheduling and air interface contention state and a service transmission state. The scheduling and air interface contention state is the state in which the first network node performs scheduling and air interface contention, and the service transmission state is the state in which the first network node transmits the first service data through the air interface.

[0248] In one possible design, the transceiver unit 901 is configured to receive the first message in the scheduling and air interface contention state; the processing unit 902 is configured to switch the first network node from the scheduling and air interface contention state to the termination air interface contention decision state according to the first field; the switching from the termination air interface contention decision state to the scheduled state includes: switching from the termination air interface contention decision state to the scheduling and air interface contention state.

[0249] In one possible design, the scheduling and air interface contention state includes a scheduling state and an air interface contention state, wherein the air interface contention state is the state in which the first network node is engaged in air interface contention, and the scheduling state is the state in which the first network node is engaged in service scheduling; the transceiver unit 901 is configured to receive the first message in the air interface contention state; the processing unit 902 is configured to switch the first network node from the air interface contention state to the termination air interface contention decision state according to the first field; the switching from the termination air interface contention decision state to the scheduling and air interface contention state includes: switching from the termination air interface contention decision state to the air interface contention state.

[0250] In one possible design, the scheduling and air interface contention state includes a scheduling state and an air interface contention state, wherein the air interface contention state is the state in which the first network node is engaged in air interface contention, and the scheduling state is the state in which the first network node is engaged in scheduling; the transceiver unit 901 is configured to receive the first message in the air interface scheduling state; the processing unit 902 is configured to switch the first network node from the air interface scheduling state to the air interface contention termination decision state according to the first field; the switching from the air interface contention termination decision state to the scheduling and air interface contention state includes: switching from the air interface contention termination decision state to the air interface scheduling state.

[0251] In one possible design, the receiving unit 901 is configured to receive the first message from the control node in the service transmission state; the processing unit 902 is configured to switch the first network node from the service transmission state to the termination air interface contention decision state according to the first field; the switching from the termination air interface contention decision state to the scheduled state includes: switching from the termination air interface contention decision state to the service transmission state.

[0252] In one possible design, the processing unit 902 is used to switch the first network node from the scheduled state to the transmission completion state when the first control network node completes the transmission of the first service data. The transmission completion state is the state in which the first network node has completed the transmission of the first service.

[0253] In one possible design, the transceiver unit 901 is further configured to send a result reporting message, which is used to indicate the sending status of the first service data; the processing unit 902 is further configured to switch the first network node from the sending completed state to the waiting-to-be-scheduled state.

[0254] In one possible design, the scheduling state includes an idle (IDLE) state, a service reporting state, and a waiting time slot allocation state. The IDLE state is the initial scheduling state of the first network node, the service reporting state is the state in which the first network node reports service information, and the waiting time slot allocation state is the state in which the first network node waits to receive time slot allocation. The processing unit 902 is used to switch the first network node from the IDLE state to the service reporting state when the first network node detects that there is a service to be sent; the processing unit 902 is used to switch the first network node from the service reporting state to the waiting time slot allocation state when the first network node completes the reporting of service information; and the processing unit 902 is used to switch the first network node from the waiting time slot allocation state to the scheduled state when the first network node receives time allocation from the control node.

[0255] In one possible design, the first network node is a slave gateway SFU in a fiber-to-the-room (FTTR) network.

[0256] In one possible design, the first field includes a termination type field, wherein a first state of the termination air interface result field indicates continued air interface contention, and a second state indicates termination of air interface contention.

[0257] Based on the same concept as the scheduling method described above, as shown in Figure 10, this application embodiment also provides a structural schematic diagram of another scheduling device 1000. The scheduling device 1000 can be used to implement the methods described in the above method embodiments, as can be found in the descriptions in the above method embodiments. The scheduling device 1000 may include one or more processors 1001. The processor 1001 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 (e.g., a base station, terminal, or chip, etc.), execute software programs, and process the data of the software programs. The scheduling device may include a transceiver unit to implement signal input (reception) and output (transmission). For example, the transceiver unit may be a transceiver, an RF chip, etc.

[0258] The scheduling device 1000 includes one or more processors 1001, which can implement the methods shown in the embodiments shown in Figures 3A to 8B.

[0259] Optionally, in addition to implementing the methods of the embodiments shown above, the processor 1001 may also implement other functions.

[0260] Optionally, in one design, the processor 1001 can execute instructions that cause the scheduling device 1000 to perform the methods described in the above method embodiments. The instructions can be stored entirely or partially within the processor, such as instruction 1003, or entirely or partially stored in a memory 1002 coupled to the processor, such as instruction 1004. Alternatively, instructions 1003 and 1004 can be used together to cause the scheduling device 1000 to perform the methods described in the above method embodiments.

[0261] In another possible design, the scheduling device 1000 may include one or more memories 1002 storing instructions 1004, which can be executed on a processor to cause the scheduling device 1000 to perform the methods described in the above method embodiments. Optionally, the memories may also store data. The processor may also optionally store instructions and / or data. For example, one or more memories 1002 may store the correspondences described in the above embodiments, or related parameters or tables involved in the above embodiments. The processor and memory may be configured separately or integrated together.

[0262] In another possible design, the scheduling device 1000 may also include a transceiver 1005 and an antenna 1006. The processor 1001, which may be called a processing unit, controls the device (terminal or base station). The transceiver 1005, which may be called a transceiver, transceiver circuit, or transceiver unit, is used to realize the device's transmission and reception functions through the antenna 1006.

[0263] It should be noted that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuits in the processor's hardware or by instructions in software form. The 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. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0264] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which serves 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 linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0265] This 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 can execute the functions described in the above method embodiments, and each network node can execute the functions described in the above method embodiments.

[0266] This application also provides a computer-readable storage medium storing a computer program thereon, which, when executed by a computer, implements the scheduling method of any of the method embodiments shown above.

[0267] This application also provides a computer program product that, when executed by a computer, implements the scheduling method of any of the above-described method embodiments.

[0268] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. A 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 flow or function according to the embodiments of this application is 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. For example, computer instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., high-density digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0269] As shown in Figure 11, this application embodiment also provides a chip 1100, including an input / output interface 1101 and a logic circuit 1102. The input / output interface 1101 is used to receive / output code instructions or information, and the logic circuit 1102 is used to execute code instructions or, according to information, to execute the scheduling method of any of the above-described method embodiments.

[0270] Chip 1100 can implement the functions shown in the processing unit and / or transceiver unit in the above embodiments.

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

[0272] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection between apparatuses or units through some interfaces, and may be electrical, mechanical, or other forms.

[0273] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0274] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0275] If the integrated unit is implemented as 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 this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

Claims

1. A scheduling method, characterized in that, Applied to a first network node, the method includes: Upon receiving a first message, the network node switches from a scheduled state to a terminate air interface contention decision state based on the first field of the first message. The scheduled state is the state in which the first network node is scheduled to transmit the first service data through the air interface. The terminate air interface contention decision state is the state in which the first network node decides whether to terminate the air interface contention. The first field of the first message is used to instruct the first network node to terminate the air interface contention. If the first network node successfully decides to terminate air interface contention, it switches from the termination air interface contention decision state to the waiting-to-schedule state, which is the preparation state for the first network node to perform air interface transmission. If the first network node fails to terminate the air interface contention decision, it switches from the terminate air interface contention decision state to the scheduled state.

2. The method according to claim 1, characterized in that, The scheduled state includes a scheduling and air interface contention state and a service transmission state. The scheduling and air interface contention state is the state in which the first network node performs scheduling and air interface contention. The service transmission state is the state in which the first network node transmits the first service data through the air interface.

3. The method according to claim 2, characterized in that, The step of receiving the first message and switching from the scheduled state to the terminate air interface contention decision state according to the first field of the first message includes: Upon receiving the first message in the scheduling and air interface contention state, the system switches from the scheduling and air interface contention state to the termination air interface contention decision state based on the first field. The transition from the terminated air interface contention decision state to the scheduled state includes: The process switches from the termination of air interface contention decision state to the scheduling and air interface contention state.

4. The method according to claim 3, characterized in that, The scheduling and air interface contention states include scheduling state and air interface contention state. The air interface contention state is the state in which the first network node engages in air interface contention, and the scheduling state is the state in which the first network node performs service scheduling. Receiving the first message in the scheduling and air interface contention state, and switching from the scheduling and air interface contention state to the termination air interface contention decision state according to the first field of the first message, includes: Upon receiving the first message in the air interface contention state, the system switches from the air interface contention state to the air interface contention termination decision state based on the first field. The transition from the termination of air interface contention decision state to the scheduling and air interface contention state includes: Switch from the decision state to terminate air interface contention to the air interface contention state.

5. The method according to claim 3, characterized in that, The scheduling and air interface contention states include scheduling state and air interface contention state. The air interface contention state is the state in which the first network node is engaged in air interface contention. The scheduling state is the state in which the first network node is engaged in scheduling. Receiving the first message in the scheduling and air interface contention state, and switching from the scheduling and air interface contention state to the termination air interface contention decision state according to the first field of the first message, includes: Upon receiving the first message in the air interface scheduling state, the system switches from the air interface scheduling state to the air interface contention termination decision state based on the first field. The transition from the termination of air interface contention decision state to the scheduling and air interface contention state includes: The process switches from the termination of air interface contention decision state to the air interface scheduling state.

6. The method according to claim 2, characterized in that, The step of receiving a first message from the control node and switching from a scheduled state to a terminate air interface contention decision state based on a first field of the first message includes: The first message is received in the service transmission state, and the system switches from the service transmission state to the termination air interface contention decision state according to the first field. The transition from the terminated air interface contention decision state to the scheduled state includes: Switch from the termination of air interface contention decision state to the service transmission state.

7. The method according to any one of claims 1 to 6, characterized in that, After switching from the terminated air interface contention decision state to the scheduled state, the method further includes: If the first control network node completes the transmission of the first service data, it switches from the scheduled state to the transmission completion state, whereby the first network node has completed the transmission of the first service.

8. The method according to claim 7, characterized in that, After switching from the scheduled state to the transmission completed state, the method further includes: If the first network node sends a result reporting message, it switches from the sending completed state to the pending scheduling state. The result reporting message is used to indicate the sending status of the first service data.

9. The method according to any one of claims 1 to 8, characterized in that, The scheduling state includes the idle (IDLE) state, the service reporting state, and the waiting time slot allocation state. The IDLE state is the initial scheduling state of the first network node, the service reporting state is the state in which the first network node reports service information, and the waiting time slot allocation state is the state in which the first network node waits for the allocation of receiving time. Before receiving the first message, the method further includes: If the first network node detects that there is a service to be sent, it switches from the IDLE state to the service reporting state. If the first network node completes the reporting of service information, it switches from the service reporting state to the waiting time slot allocation state. If the first network node receives a time allocation from the control node, it switches from the waiting time slot allocation state to the scheduled state.

10. The method according to any one of claims 1 to 9, characterized in that, The first network node is a slave gateway SFU in a fiber-to-the-room (FTTR) network.

11. The method according to any one of claims 1 to 10, characterized in that, The first field includes a termination type field, wherein a first state of the termination type field indicates continued air interface contention, and a second state indicates termination of air interface contention.

12. A scheduling device, characterized in that, The device is a first network node, including a transceiver unit and a processing unit; The transceiver unit is used to receive a first message and switch from a scheduled state to a terminate air interface contention decision state according to a first field of the first message. The scheduled state is the state in which the first network node is scheduled to transmit the first service data through the air interface. The terminate air interface contention decision state is the state in which the first network node decides whether to terminate the air interface contention. The first field of the first message is used to instruct the first network node to terminate the air interface contention. The processing unit is configured to, upon successful decision to terminate air interface contention, switch the first network node from the air interface contention termination decision state to a pending scheduling state, wherein the pending scheduling state is a preparation state for the first network node to perform air interface transmission. The processing unit is further configured to switch the first network node from the decision state to terminate air interface contention to the scheduled state if the decision to terminate air interface contention fails. The scheduling device is used to execute the scheduling method according to any one of claims 1 to 11.

13. A scheduling device, characterized in that, Includes one or more processors; The processor is coupled to a memory, which stores computer program code, including computer instructions. The processor executes computer instructions in the memory to perform the scheduling method according to any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a computer, causes the scheduling method of any one of claims 1 to 11 to be implemented.

15. A computer program product, characterized in that, include: Computer program code, when executed by the processor of a network device, causes the network device to perform the scheduling method according to any one of claims 1 to 11.

16. A chip, characterized in that, Includes at least one processor and interface; The interface is used to provide program instructions or data to the at least one processor; the at least one processor is used to execute the program instructions to implement the scheduling method according to any one of claims 1 to 11.

Images