Deterministic network scheduling method, apparatus and device, and medium

Abstract

Disclosed are a deterministic network scheduling method, apparatus, device and medium, relating to the technical field of communications, comprising: establishing a deterministic network service bearer for a device, and placing a service into a waiting scheduling queue; according to the deterministic scheduling resource and control resource condition, distributing the service of the waiting scheduling queue to a deterministic scheduling queue or a common scheduling queue; judging whether the service of the deterministic scheduling queue meets a deactivation condition or not, judging whether a reactivation condition is met or not when the deactivation condition is not met, and moving the service into a reactivation queue when the reactivation condition is met; according to the updated resource demand, the residual resource and the service priority, the service of the reactivation queue is determined to be recovered to a deterministic scheduling queue or transferred to a common scheduling queue; and when the service of the common scheduling queue meets the activation condition, the common scheduling queue is moved into the waiting scheduling queue. Therefore, reliable transmission of services can be ensured, the resource utilization efficiency is improved, and the problem that traditional scheduling is difficult to give consideration to both service certainty and resource efficiency is solved.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a deterministic network scheduling method, apparatus, device, and medium. Background Technology

[0002] Deterministic networks (DetNets) can provide deterministic guarantees for metrics such as latency, jitter, bandwidth, and reliability for services within the same network domain. However, in wireless scenarios, air interface channels are uncertain and unreliable, and air interface scheduling mechanisms introduce additional latency. Traditional dynamic scheduling schemes are difficult to meet the scheduling requirements of deterministic services.

[0003] Unlicensed scheduling, as a semi-static resource allocation method, is a common approach to improve the determinism of scheduling delay. Base stations allocate time-frequency resources and scheduling schemes to terminals through a one-time authorization, reserving available resources for deterministic services while eliminating the signaling delay of dynamic scheduling authorization, thus improving the determinism of scheduling delay to some extent. However, this unlicensed scheduling scheme lacks a mechanism to adapt to changes in channel quality in a timely manner, resulting in insufficient scheduling reliability. Furthermore, it cannot simultaneously consider the resource utilization efficiency in scenarios where deterministic services coexist with other service types. Summary of the Invention

[0004] The purpose of this invention is to provide a deterministic network scheduling method, apparatus, device, and medium that can ensure reliable transmission of deterministic services and improve resource utilization efficiency through multi-queue round-robin and state-adaptive scheduling, thereby solving the problem that traditional scheduling cannot balance service determinism and resource efficiency.

[0005] To address the aforementioned technical problems, this invention provides a deterministic network scheduling method applied to a base station, comprising: Establish deterministic network service bearers for the equipment and place services to be scheduled into a deterministic waiting queue for scheduling; Based on the status of deterministic scheduling resources and control resources, the services in the deterministic waiting scheduling queue are allocated to either the deterministic scheduling queue or the ordinary scheduling queue. Determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation condition. If the deterministic scheduling deactivation condition is not met, determine whether the deterministic scheduling reactivation condition is met. If the deterministic scheduling reactivation condition is met, move the services into the deterministic reactivation queue. Based on the updated resource requirements, remaining resources, and service priorities, it is determined whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the normal scheduling queue. When a service in the ordinary scheduling queue meets the deterministic scheduling activation condition, the service in the ordinary scheduling queue is moved back into the deterministic waiting scheduling queue.

[0006] To address the aforementioned technical problems, the present invention also provides a deterministic network scheduling apparatus, comprising: The waiting scheduling module is used to establish deterministic network service bearers for the device and place the services to be scheduled into the deterministic waiting scheduling queue; The service allocation module is used to allocate services in the deterministic waiting scheduling queue to the deterministic scheduling queue or the ordinary scheduling queue based on the status of deterministic scheduling resources and control resources. The first scheduling module is used to determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions. If the deterministic scheduling deactivation conditions are not met, it determines whether the deterministic scheduling reactivation conditions are met. If the deterministic scheduling reactivation conditions are met, the services are moved into the deterministic reactivation queue. The second scheduling module is used to determine, based on the updated resource requirements, remaining resources, and service priority, whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the ordinary scheduling queue. The third scheduling module is used to move the services in the ordinary scheduling queue back into the deterministic waiting scheduling queue when the deterministic scheduling activation conditions are met.

[0007] To address the aforementioned technical problems, the present invention also provides an electronic device, comprising: Memory, used to store computer programs; A processor is used to implement the steps of the deterministic network scheduling method described above when executing the computer program.

[0008] To address the aforementioned technical problems, the present invention also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the aforementioned deterministic network scheduling method.

[0009] The beneficial effects of this invention are as follows: The deterministic network scheduling method provided by this invention, by establishing deterministic network service bearers for devices and placing services to be scheduled into a deterministic waiting scheduling queue, enables unified management and orderly scheduling of deterministic services; by allocating services to deterministic scheduling queues or ordinary scheduling queues according to the status of deterministic scheduling resources and control resources, it can achieve reasonable allocation and efficient utilization of deterministic scheduling resources; by determining whether services in the deterministic scheduling queue meet the deterministic scheduling deactivation and reactivation conditions, and moving services that meet the deterministic scheduling reactivation conditions into the deterministic reactivation queue, it can perceive changes in service scheduling status and channel quality in real time and adjust deterministic scheduling in a timely manner. The strategy involves restoring services in the deterministic reactivation queue to the deterministic scheduling queue or transferring them to the ordinary scheduling queue based on updated resource requirements, remaining resources, and service priorities. This improves resource utilization while ensuring the scheduling needs of high-priority deterministic services. When services in the ordinary scheduling queue meet activation conditions, they are moved back to the deterministic waiting scheduling queue, enabling flexible switching between dynamic and deterministic scheduling services. This allows for multi-queue rotation based on real-time scheduling status, adaptively matching channel changes and various service requirements. It ensures reliable scheduling of deterministic services while improving resource utilization efficiency in multi-service scenarios, solving the problem that traditional solutions struggle to simultaneously meet service determinism and resource scheduling efficiency.

[0010] In addition, the present invention also provides a corresponding deterministic network scheduling device, electronic device and computer-readable storage medium for the deterministic network scheduling method, which have the same or corresponding technical features as the aforementioned deterministic network scheduling method and have the same effect. Attached Figure Description

[0011] To more clearly illustrate the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0012] Figure 1 A flowchart of a deterministic network scheduling method provided in an embodiment of the present invention; Figure 2 A detailed flowchart of the deterministic network scheduling method provided in this embodiment of the invention; Figure 3 A schematic diagram of the queue rotation mechanism provided in an embodiment of the present invention; Figure 4 This is a schematic diagram of the structure of a deterministic network scheduling device provided in an embodiment of the present invention. Detailed Implementation

[0013] In traditional unlicensed scheduling schemes, a semi-static scheduling authorization mechanism is typically designed to save on control information overhead and delays introduced by scheduling authorization. The base station grants authorization once, sending scheduling commands such as modulation and coding scheme, time-frequency resource information, and power control indications to the terminal. The terminal retains these scheduling commands and transmits services according to their instructions. The base station does not subsequently grant authorization to the terminal for further scheduling commands. Due to the uncertainty and unreliability of air interface wireless channels, this conventional unlicensed scheduling scheme lacks a mechanism to adapt to changes in channel quality in a timely manner. Therefore, when the channel deteriorates, the reliability of service transmission is insufficient; when the channel quality is good, this scheme lacks a mechanism for flexible resource utilization, reducing resource utilization efficiency. In scenarios where multiple terminals and multiple service types coexist, this scheme cannot simultaneously accommodate the scheduling of other non-deterministic services, resulting in low resource scheduling efficiency. To address the above technical problems, this invention provides a deterministic network scheduling method.

[0014] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the protection scope of the present invention.

[0015] It should be noted that, in the description of this invention, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. The terms "first," "second," etc., used in this invention are used to distinguish similar objects and are not used to describe a specific order or sequence.

[0016] To enable those skilled in the art to better understand the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0017] The specific application environment architecture or specific hardware architecture on which the execution of the deterministic network scheduling method depends is described here.

[0018] The embodiments of the present invention provide a deterministic network scheduling method, and the method is described in detail below in conjunction with the execution flow of the deterministic network scheduling method. Figure 1 A flowchart of the deterministic network scheduling method provided in the embodiments of the present invention is shown below. Figure 1 As shown, this method is applied to a base station and includes: S101. Establish deterministic network service bearers for the equipment and place the services to be scheduled into a deterministic waiting queue.

[0019] It should be noted that in this invention, the base station maintains the following four queues: The first is the Deterministic Waiting for Scheduling (DetSch_Wait) queue, which is a queue of deterministic network services awaiting scheduling, used to store these services. The second is the Deterministic Scheduling (DetSch) queue, which is a queue of device services using fixed-periodic time-frequency resources for deterministic scheduling, used to store these services. The third is the Normal Scheduling (NormalSch) queue, which is a queue of device services using dynamically changing time-frequency resources for dynamic scheduling, used to store these services. The fourth is the Deterministic Reactivation (DetSch_ReActive) queue, which is a queue of device services in the Deterministic Scheduling queue that triggers the Deterministic Scheduling Reactivation (DetSch_ReAct) condition, used to store device services in the Deterministic Scheduling queue that meet the Deterministic Scheduling Reactivation condition and require an update to the scheduling policy. The Deterministic Scheduling Reactivation condition refers to the condition that triggers a re-authorization update of the deterministic scheduling policy.

[0020] The aforementioned equipment can be user equipment (UE), and there is no limitation on it here. In step S101, the base station can establish deterministic network service bearers for the equipment, clearly identify and access services that require deterministic protection, and then uniformly place the corresponding services to be scheduled into a deterministic waiting scheduling queue, thereby realizing centralized management and orderly queuing of deterministic services.

[0021] S102. Based on the status of deterministic scheduling resources and control resources, allocate the services in the deterministic waiting scheduling queue to the deterministic scheduling queue or the ordinary scheduling queue.

[0022] In step S102, the base station can monitor the usage of deterministic scheduling resources and control resources in real time, make resource suitability judgments for services entering the deterministic waiting scheduling queue, and decide whether the service enters the deterministic scheduling queue or the ordinary scheduling queue based on whether the resources are sufficient. This can reserve dedicated scheduling resources for qualified services to ensure deterministic transmission, and can also include services in the regular scheduling when resources are insufficient to avoid resource waste.

[0023] S103. Determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions. If the deterministic scheduling deactivation conditions are not met, determine whether the deterministic scheduling reactivation conditions are met. If the deterministic scheduling reactivation conditions are met, move the services into the deterministic reactivation queue.

[0024] It should be noted that the deterministic scheduling deactivation (DetSch_DeAct) condition refers to the condition under which the base station can revoke the deterministic scheduling resource authorization of the device after the device's deterministic scheduling requirements have been met.

[0025] In step S103, the base station can perform real-time status monitoring and dynamic adjustment of services that have entered deterministic scheduling. By successively judging whether the service meets the deterministic scheduling deactivation and reactivation conditions, the base station can promptly identify whether the service's deterministic scheduling requirements have been fulfilled and whether the channel quality has changed. When the service no longer needs to occupy deterministic resources, it should exit deterministic scheduling in a timely manner. When the channel does not match the original scheduling strategy, the service should be moved into the deterministic reactivation queue. This achieves full-process control of deterministic scheduling services and ensures that the scheduling mechanism can adapt to the service status and channel environment in real time.

[0026] S104. Based on the updated resource requirements, remaining resources, and service priorities, determine whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the normal scheduling queue.

[0027] In step S104, the base station can make re-decision and reallocate resources for services that require updated scheduling policies. The base station makes a comprehensive judgment based on the updated resource requirements of the service, the current remaining resources, and the service priority. It can restore deterministic scheduling of the service when the resources and priorities are met, and can switch the service to normal scheduling when the conditions are not met, thereby achieving accurate allocation and efficient recovery of deterministic scheduling resources.

[0028] S105. When a service in the ordinary scheduling queue meets the deterministic scheduling activation condition, the service in the ordinary scheduling queue is moved back into the deterministic waiting scheduling queue.

[0029] It should be noted that the deterministic scheduling activation (DetSch_Act) condition refers to the condition that the service is a deterministic network service and the real-time channel quality is within a preset range, which allows the service to enter the deterministic scheduling waiting process.

[0030] In step S105, the base station can switch between dynamic scheduling services and deterministic scheduling services. When a service in the ordinary scheduling queue meets the activation conditions, the base station moves it back into the deterministic waiting scheduling queue, enabling services that were originally scheduled to re-enter the deterministic service allocation process.

[0031] In the deterministic network scheduling method provided in this embodiment of the invention, by establishing deterministic network service bearers for devices and placing services to be scheduled into a deterministic waiting scheduling queue, deterministic services can be uniformly managed and scheduled in an orderly manner; by allocating services to deterministic scheduling queues or ordinary scheduling queues according to the status of deterministic scheduling resources and control resources, the rational allocation and efficient utilization of deterministic scheduling resources can be achieved; by determining whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions and deterministic scheduling reactivation conditions, and moving services that meet the deterministic scheduling reactivation conditions into the deterministic reactivation queue, the service scheduling status and channel quality changes can be perceived in real time, and the deterministic scheduling strategy can be adjusted in a timely manner. Based on updated resource requirements, remaining resources, and service priorities, services in the deterministic reactivation queue are restored to the deterministic scheduling queue or transferred to the ordinary scheduling queue. This improves resource utilization while ensuring the scheduling needs of high-priority deterministic services. When services in the ordinary scheduling queue meet the activation conditions, they are moved back to the deterministic waiting scheduling queue. This enables flexible switching between dynamic and deterministic scheduling services. Thus, multi-queue rotation is achieved throughout the process based on real-time scheduling status, adaptively matching channel changes and various service requirements. This ensures reliable scheduling of deterministic services while improving resource utilization efficiency in multi-service scenarios, solving the problem that traditional solutions cannot simultaneously meet the requirements of service determinism and resource scheduling efficiency.

[0032] It should be noted that the deterministic network scheduling method of the present invention can be used for scenarios that provide deterministic services for 5G systems (5GS), and can also be applied to industrial internet, vehicle network, remote control, smart grid, and various wired and wireless converged communication scenarios that require low latency and high reliability transmission. It can provide stable and controllable transmission guarantees for key services under different network architectures.

[0033] Furthermore, in a specific implementation, in the deterministic network scheduling method provided in the embodiments of the present invention, step S102 allocates services in the deterministic waiting scheduling queue to the deterministic scheduling queue or the ordinary scheduling queue based on the status of deterministic scheduling resources and control resources. Specifically, it may include: determining whether the services in the deterministic waiting scheduling queue meet the deterministic resource allocation (DetResAlloc) conditions based on the status of deterministic scheduling resources and control resources; if the services do not meet the deterministic resource allocation conditions, the services are removed from the deterministic waiting scheduling queue and moved into the ordinary scheduling queue, control information is sent to the device, and time-frequency resources are allocated; if the services meet the deterministic resource allocation conditions, the services are removed from the deterministic waiting scheduling queue and moved into the deterministic scheduling queue, control information is sent to the device, and fixed periodic time-frequency resources are allocated.

[0034] It should be noted that the deterministic resource allocation condition refers to the condition that the reserve of deterministic scheduling resources and service control resources on the base station side both meet the preset threshold requirements.

[0035] In the above steps, based on the status of deterministic scheduling resources and control resources, it is determined whether the services in the deterministic waiting scheduling queue meet the deterministic resource allocation conditions. Specifically, this may include: calculating the remaining available quantity of deterministic scheduling resources and the remaining quantity of deterministic service control resources, comparing the above resource status with a preset threshold, and determining whether the services in the deterministic waiting scheduling queue meet the deterministic resource allocation conditions based on the comparison result.

[0036] In other words, deterministic resource allocation conditions can be defined as: DetRB_remain>RBThr && Deterministic business control resources have slack; Here, DetRB_remain represents the number of remaining available resource blocks for high-priority deterministic service scheduling resources, as counted in real-time by the base station, and RBThr is a preset threshold value. Deterministic service control resources can be counted through methods such as the number of control channel elements. This resource allocation mechanism enables flexible allocation of both deterministic and non-deterministic scheduling resources.

[0037] Figure 2 A detailed flowchart of the deterministic network scheduling method provided in this embodiment of the invention is shown below. Figure 2 As shown, if a service does not meet the deterministic resource allocation conditions, it is removed from the deterministic waiting scheduling queue and moved to the ordinary scheduling queue. The base station issues downlink control information and dynamically authorizes time-frequency resources to the equipment. If the service meets the deterministic resource allocation conditions, it is removed from the deterministic waiting scheduling queue and moved to the deterministic scheduling queue. The base station issues downlink control information and authorizes periodic fixed time-frequency resources to the equipment for deterministic scheduling of the service. Through real-time statistics, threshold comparisons, and differentiated resource allocation of deterministic scheduling and control resources, services can be accurately routed according to the actual resource situation. When the conditions are met, fixed periodic time-frequency resources are allocated to the service to ensure deterministic transmission; when the conditions are not met, conventional time-frequency resource scheduling is used. This ensures the transmission reliability and latency stability of high-priority services while improving overall resource utilization efficiency, achieving coordinated scheduling of deterministic and ordinary services.

[0038] Furthermore, in a specific implementation, in the deterministic network scheduling method provided in the embodiments of the present invention, after executing step S103 to determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions, it may further include: if the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions, then the deterministic scheduling resource authorization corresponding to the service is revoked, and the service is removed from the deterministic scheduling queue and moved into the ordinary scheduling queue.

[0039] In implementation, such as Figure 2 As shown, after entering the deterministic scheduling queue and being authorized to perform deterministic scheduling on fixed-time-frequency resources, it is determined whether the deterministic scheduling deactivation condition has been triggered. If so, the service of the device to be scheduled is removed from the deterministic scheduling queue, and the authorization for the deterministic scheduling resource is revoked.

[0040] In the above steps, determining whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation condition can specifically include: obtaining the transmission status and data transmission completion status of each service in the deterministic scheduling queue, calculating the remaining amount of data to be transmitted for the current service, comparing the remaining amount of data to be transmitted with a preset threshold, and determining whether the service meets the deterministic scheduling deactivation condition when the remaining amount of data to be transmitted is less than or equal to the preset threshold and the current transmission task has been completed. In other words, the deterministic scheduling deactivation condition can be defined as: a real-time trigger when the device's deterministic scheduling requirement has been met. This trigger condition can be obtained through the real-time statistics of the transmission block size requirement from the base station. This mechanism ensures that when the device does not have a high-priority deterministic scheduling requirement, it can promptly release periodic fixed scheduling resources, guaranteeing the scheduling of other non-deterministic services and improving resource utilization efficiency.

[0041] Furthermore, in a specific implementation, in the deterministic network scheduling method provided in the embodiments of the present invention, step S103 determines whether the deterministic scheduling reactivation condition is met when the deterministic scheduling deactivation condition is not met, and moves the service into the deterministic reactivation queue when the deterministic scheduling reactivation condition is met. Specifically, this may include: if the service in the deterministic scheduling queue does not meet the deterministic scheduling deactivation condition, then continue to determine whether the service in the deterministic scheduling queue meets the deterministic scheduling reactivation condition; if the service in the deterministic scheduling queue does not meet the deterministic scheduling reactivation condition, then maintain the state of the deterministic scheduling queue; if the service in the deterministic scheduling queue meets the deterministic scheduling reactivation condition, then remove the service from the deterministic scheduling queue and move it into the deterministic reactivation queue.

[0042] In implementation, such as Figure 2As shown, when the deterministic scheduling deactivation condition is not met, it is determined whether the deterministic scheduling reactivation condition has been triggered. If not, it continues to determine whether the deterministic scheduling deactivation condition has been triggered. If so, the service of the device to be scheduled is removed from the deterministic scheduling queue and enters the deterministic reactivation queue.

[0043] In the above steps, determining whether the deterministic scheduling reactivation conditions are met can specifically include: monitoring changes in the channel quality, modulation and coding scheme, and transmission error rate of the current service; comparing the monitored parameters with the preset transmission range; and determining whether the service meets the deterministic scheduling reactivation conditions when the channel quality fluctuates, the modulation and coding scheme exceeds the preset range, or the transmission error rate exceeds the allowable upper limit.

[0044] The deterministic scheduling reactivation condition can be defined as: (DetBler>BlerThr && NumOfLowMCS>NumThr) || (DetBler<BlerThr1 &&NumOfHighMCS> NumThr1); Among them, DetBler is the block error rate (BLER) of deterministic service scheduling of the device, which is statistically analyzed by the base station in real time.

[0045] NumOfLowMCS is the cumulative count of MCS_DetSch - MCS_SINRmeas > ReActThr; MCS_DetSch is the MCS value of the device's deterministic scheduling policy, and MCS_SINRmeas is the MCS value mapped from the SINRmeas estimated by the base station in real time. This condition means that when the real-time channel quality of the device deteriorates, the original deterministic scheduling policy becomes ineffective, resulting in bit errors. This mechanism enables adaptive scheduling of deterministic services. When channel quality deteriorates, it promptly determines whether the device needs to re-authorize and updates the original fixed time-frequency resource scheduling policy to match the real-time channel quality, ensuring the reliability of scheduling.

[0046] NumOfHighMCS is the cumulative number of times MCS_SINRmeas-MCS_DetSch>ReActThr1. This condition means that when the real-time channel quality of the device improves, the original deterministic scheduling strategy becomes relatively conservative. At this time, it is necessary to promptly determine whether the device needs to be re-authorized. If so, the base station will issue downlink control information to update the original fixed time-frequency resource scheduling strategy, such as increasing the scheduling MCS, decreasing the scheduling RB, and releasing unreasonable deterministic scheduling resources, so as to improve resource utilization efficiency.

[0047] BlerThr, BlerThr1, NumThr, NumThr1, ReActThr, and ReActThr1 are the threshold values ​​configured by the network management system.

[0048] Furthermore, in a specific implementation, in the deterministic network scheduling method provided in the embodiments of the present invention, step S104 determines whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the ordinary scheduling queue based on the updated resource requirements, remaining resources, and service priorities. Specifically, this may include: determining whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions based on the updated resource requirements, remaining resources, and service priorities; if the services in the deterministic reactivation queue do not meet the deterministic resource block reactivation conditions, then the deterministic scheduling resource authorization corresponding to the service is revoked, and the service is moved to the ordinary scheduling queue; if the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions, then the deterministic scheduling strategy of the service is updated, and the service is removed from the deterministic reactivation queue and re-placed into the deterministic scheduling queue.

[0049] It should be noted that the deterministic resource block reactivation (DetRBAct) condition refers to the condition that the resource requirements after the service update, the remaining deterministic scheduling resources, and the service priority all meet the preset judgment threshold.

[0050] In the above steps, based on the updated resource requirements, remaining resources, and service priorities, it is determined whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions. Specifically, this may include: comparing the updated resource requirements with the remaining resources and preset thresholds based on the updated resource requirements of the services, the current remaining deterministic scheduling resources, and the service scheduling priority; comparing the service scheduling priority with the corresponding thresholds; and determining whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions based on the comparison results.

[0051] In implementation, such as Figure 2 As shown, it determines whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions; if not, the services of the equipment to be scheduled are deleted from the deterministic reactivation queue, the base station issues downlink control information to revoke the authorization of the deterministic scheduling resource, and then moves the services into the normal scheduling queue; if yes, the services of the equipment to be scheduled are deleted from the deterministic reactivation queue, the deterministic scheduling policy is updated, and then the services are re-placed into the deterministic scheduling queue.

[0052] The reactivation condition for a deterministic resource block can be defined as: DetRB_new>DetRB_remain+RemainThr && DetQoSL <DetLevelThr; Here, `DetRB_new` represents the updated scheduling RB for the device's deterministic services, which can be obtained through the transport block size requirement and the MCS lookup standard table. The MCS uses the latest channel quality measured in real time by the base station, mapped to the MCS value `MCS_SINRmeas`. `DetQoSL` represents the scheduling priority level for the device's deterministic network services, obtained from the core network. `RemainThr` and `DetLevelThr` are configurable threshold values ​​for network management. This condition means that when the device experiences significant channel quality degradation, it requires more scheduling resources. If the scheduling priority level for the device's deterministic network services is low, downlink control information can be issued by the base station to revoke the authorization of deterministic scheduling resources, thereby improving resource utilization efficiency.

[0053] Furthermore, in a specific implementation, in the deterministic network scheduling method provided in the embodiments of the present invention, step S105, when a service in the ordinary scheduling queue meets the deterministic scheduling activation condition, moves the service in the ordinary scheduling queue back into the deterministic waiting scheduling queue. Specifically, this may include: determining whether a service in the ordinary scheduling queue meets the deterministic scheduling activation condition; if the service does not meet the deterministic scheduling activation condition, maintaining the state of the ordinary scheduling queue; if the service meets the deterministic scheduling activation condition, removing the service from the ordinary scheduling queue and re-entering it into the deterministic waiting scheduling queue.

[0054] In implementation, such as Figure 2 As shown, after removing a service from the deterministic waiting scheduling queue and moving it into the normal scheduling queue, the base station sends downlink control information and dynamically authorizes time and frequency resources to the device. Then, it determines whether the service in the normal scheduling queue has triggered the deterministic scheduling activation condition. If it is not met, the state of the normal scheduling queue is maintained. If it is met, the service is removed from the normal scheduling queue and re-entered into the deterministic waiting scheduling queue.

[0055] Furthermore, in specific implementation, the determination of whether the services in the ordinary scheduling queue meet the deterministic scheduling activation conditions in the above steps can specifically include: detecting the services in the ordinary scheduling queue, determining whether the services belong to deterministic network services, and determining whether the modulation and coding scheme mapped by the channel quality corresponding to the service is within a preset range; if the service belongs to deterministic network services and the modulation and coding scheme mapped by the corresponding channel quality is within the preset range, then the service is determined to meet the deterministic scheduling activation conditions; if the service does not belong to deterministic network services or the modulation and coding scheme mapped by the corresponding channel quality is not within the preset range, then the service is determined not to meet the deterministic scheduling activation conditions.

[0056] In practice, the deterministic scheduling activation condition can be defined as: The service is a deterministic network service && MCSThrL <MCS_SINRmeas<MCSThrH; Where MCS_SINRmeas is the MCS (Modulation and Coding Scheme) value mapped from the SINRmeas channel quality estimate measured in real time by the base station. MCSThrL and MCSThrH are configurable threshold values ​​for network management.

[0057] This invention can accurately identify services with deterministic transmission requirements and compliant channel conditions by jointly detecting the service type and channel quality of services within a normal scheduling queue. This serves as the basis for determining whether to enter the deterministic scheduling process, ensuring that only suitable services can obtain deterministic resource guarantees, and dynamically selecting suitable services based on channel quality, thereby improving the reliability and effectiveness of deterministic scheduling.

[0058] Figure 3 This is a schematic diagram of the queue rotation mechanism provided in an embodiment of the present invention. Figure 3 As shown, for device services in the deterministic waiting scheduling queue, it is first determined whether the deterministic resource allocation condition is met. If it is, the service is removed from the current queue and added to the deterministic scheduling queue; otherwise, it is removed from the current queue and added to the normal scheduling queue. For device services in the deterministic scheduling queue, it is first determined whether the deterministic scheduling deactivation condition is met. If it is, the service is removed from the current queue and added to the normal scheduling queue; otherwise, it is further determined whether the deterministic scheduling reactivation condition is met. If it is, the service is removed from the current queue and added to the deterministic reactivation queue; otherwise, the process ends directly. For device services in the deterministic reactivation queue, it is determined whether the deterministic resource block deterministic scheduling reactivation condition is met. If it is, the service is removed from the current queue and added to the deterministic scheduling queue; otherwise, it is removed from the current queue and added to the normal scheduling queue. For device services in the normal scheduling queue, it is determined whether the deterministic scheduling activation condition is met. If it is, the service is removed from the current queue and added to the deterministic waiting scheduling queue; otherwise, the process ends directly. This completes the full round-robin processing of device services in each queue.

[0059] The deterministic network scheduling method of the present invention can track real-time changes in channel quality through flexible conversion and scheduling of the above four queues, and adaptively adjust the scheduling strategy to improve the reliability of service transmission and meet the scheduling of deterministic services. In addition, it can adjust the scheduling strategy of deterministic services in a timely manner according to real-time load and channel quality changes, flexibly release and occupy deterministic scheduling resources, so as to take into account the real-time needs of multiple services and improve the resource utilization efficiency of multi-service fields.

[0060] From the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by software plus necessary general-purpose hardware platforms, and of course, they can also be implemented by hardware, but in many cases the former is a better implementation method.

[0061] Embodiments of the present invention also provide a deterministic network scheduling apparatus. Figure 4 This is a schematic diagram of the deterministic network scheduling device provided in an embodiment of the present invention. This embodiment is based on the perspective of functional modules, such as… Figure 4 As shown, the device includes: The waiting scheduling module 10 is used to establish deterministic network service bearers for the device and place the services to be scheduled into the deterministic waiting scheduling queue. The service allocation module 11 is used to allocate services in the deterministic waiting scheduling queue to the deterministic scheduling queue or the ordinary scheduling queue based on the status of deterministic scheduling resources and control resources. The first scheduling module 12 is used to determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions. If the deterministic scheduling deactivation conditions are not met, it determines whether the reactivation conditions are met. If the reactivation conditions are met, the services are moved into the deterministic reactivation queue. The second scheduling module 13 is used to determine, based on the updated resource requirements, remaining resources and service priorities, whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or to the normal scheduling queue. The third scheduling module 14 is used to move services in the ordinary scheduling queue back into the deterministic waiting scheduling queue when the activation conditions are met.

[0062] In the deterministic network scheduling device provided in this embodiment of the invention, through the interaction of the above five modules and based on the queue rotation mechanism of real-time scheduling status, and through flexible conversion and collaborative scheduling between various queues, it can track channel quality changes and service scheduling status in real time, and adaptively adjust the scheduling method and resource allocation of deterministic services. While meeting the transmission requirements of deterministic services such as latency and reliability, it can flexibly allocate, release and reuse deterministic scheduling resources, taking into account the scheduling requirements of deterministic services and ordinary services, improving resource utilization efficiency in multi-service coexistence scenarios, thereby effectively ensuring the stable transmission of deterministic network services and solving the problem that traditional scheduling mechanisms cannot simultaneously take into account service determinism and resource utilization efficiency.

[0063] Since the embodiments of the deterministic network scheduling device section correspond to the embodiments of the deterministic network scheduling method section, the descriptions of the features in the embodiments corresponding to the deterministic network scheduling device can be found in the relevant descriptions of the embodiments corresponding to the deterministic network scheduling method, and will not be repeated here. Furthermore, it has the same beneficial effects as the aforementioned deterministic network scheduling method.

[0064] Furthermore, in a specific implementation, in the deterministic network scheduling device provided in the embodiments of the present invention, the service allocation module 11 is used to determine whether the services in the deterministic waiting scheduling queue meet the deterministic resource allocation conditions based on the status of deterministic scheduling resources and control resources; if the services do not meet the deterministic resource allocation conditions, the services are removed from the deterministic waiting scheduling queue and moved into the ordinary scheduling queue, control information is sent to the device, and time-frequency resources are allocated; if the services meet the deterministic resource allocation conditions, the services are removed from the deterministic waiting scheduling queue and moved into the deterministic scheduling queue, control information is sent to the device, and fixed periodic time-frequency resources are allocated.

[0065] Furthermore, in a specific implementation, in the deterministic network scheduling device provided in the embodiments of the present invention, the first scheduling module 12 is used to: if a service in the deterministic scheduling queue meets the deterministic scheduling deactivation condition, then release the deterministic scheduling resource authorization corresponding to the service, remove the service from the deterministic scheduling queue, and move it into the ordinary scheduling queue; if a service in the deterministic scheduling queue does not meet the deterministic scheduling deactivation condition, then continue to determine whether the service in the deterministic scheduling queue meets the deterministic scheduling reactivation condition; if a service in the deterministic scheduling queue does not meet the deterministic scheduling reactivation condition, then maintain the state of the deterministic scheduling queue; if a service in the deterministic scheduling queue meets the deterministic scheduling reactivation condition, then remove the service from the deterministic scheduling queue and move it into the deterministic reactivation queue.

[0066] Furthermore, in a specific implementation, in the deterministic network scheduling device provided in the embodiments of the present invention, the second scheduling module 13 is used to determine whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions based on the updated resource requirements, remaining resources, and service priorities; if the services in the deterministic reactivation queue do not meet the deterministic resource block reactivation conditions, the deterministic scheduling resource authorization corresponding to the service is revoked, and the service is moved to the ordinary scheduling queue; if the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions, the deterministic scheduling strategy of the service is updated, the service is removed from the deterministic reactivation queue and re-placed into the deterministic scheduling queue.

[0067] Furthermore, in a specific implementation, in the deterministic network scheduling device provided in the embodiments of the present invention, the third scheduling module 14 is used to determine whether the service in the ordinary scheduling queue meets the deterministic scheduling activation condition; if the service does not meet the deterministic scheduling activation condition, the state of the ordinary scheduling queue is maintained; if the service meets the deterministic scheduling activation condition, the service is removed from the ordinary scheduling queue and re-placed into the deterministic waiting scheduling queue.

[0068] Embodiments of the present invention also provide an electronic device, including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the above-described deterministic network scheduling method embodiments.

[0069] Embodiments of the present invention also provide a computer-readable storage medium storing a computer program configured to execute the steps in any of the above-described deterministic network scheduling method embodiments at runtime.

[0070] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard disk, magnetic disk, or optical disk.

[0071] Embodiments of the present invention also provide a computer program product, which includes a computer program that, when executed by a processor, implements the steps in any of the above-described deterministic network scheduling method embodiments.

[0072] Embodiments of the present invention also provide another computer program product, including a non-volatile computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps in any of the above-described deterministic network scheduling method embodiments.

[0073] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this invention.

[0074] The foregoing has provided a detailed description of the deterministic network scheduling method, apparatus, device, and medium provided by the present invention. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The descriptions of the above embodiments are only intended to aid in understanding the method and core ideas of the present invention. It should be noted that those skilled in the art can make various improvements and modifications to the present invention without departing from its principles, and these improvements and modifications also fall within the protection scope of the present invention.

Claims

1. A deterministic network scheduling method, characterized in that, Applied to base stations, including: Establish deterministic network service bearers for the equipment and place services to be scheduled into a deterministic waiting queue for scheduling; Based on the status of deterministic scheduling resources and control resources, the services in the deterministic waiting scheduling queue are allocated to either the deterministic scheduling queue or the ordinary scheduling queue. Determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation condition. If the deterministic scheduling deactivation condition is not met, determine whether the deterministic scheduling reactivation condition is met. If the deterministic scheduling reactivation condition is met, move the services into the deterministic reactivation queue. Based on the updated resource requirements, remaining resources, and service priorities, it is determined whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the normal scheduling queue. When a service in the ordinary scheduling queue meets the deterministic scheduling activation condition, the service in the ordinary scheduling queue is moved back into the deterministic waiting scheduling queue.

2. The deterministic network scheduling method according to claim 1, characterized in that, Based on the status of deterministic scheduling resources and control resources, the services in the deterministic waiting scheduling queue are allocated to either the deterministic scheduling queue or the ordinary scheduling queue, including: Based on the deterministic scheduling resource and control resource status, determine whether the services in the deterministic waiting scheduling queue meet the deterministic resource allocation conditions; If a service does not meet the deterministic resource allocation conditions, the service will be removed from the deterministic waiting scheduling queue and moved to the normal scheduling queue. If a service meets the deterministic resource allocation conditions, the service will be removed from the deterministic waiting scheduling queue and moved into the deterministic scheduling queue.

3. The deterministic network scheduling method according to claim 1, characterized in that, After determining whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions, the process further includes: If a service in the deterministic scheduling queue meets the deterministic scheduling deactivation condition, then the deterministic scheduling resource authorization corresponding to the service is revoked, and the service is removed from the deterministic scheduling queue and moved into the ordinary scheduling queue.

4. The deterministic network scheduling method according to claim 1, characterized in that, If the deterministic scheduling deactivation condition is not met, it is determined whether the deterministic scheduling reactivation condition is met. If the deterministic scheduling reactivation condition is met, the service is moved to the deterministic reactivation queue, including: If the services in the deterministic scheduling queue do not meet the deterministic scheduling deactivation condition, then it is necessary to continue to determine whether the services in the deterministic scheduling queue meet the deterministic scheduling reactivation condition. If the services in the deterministic scheduling queue do not meet the deterministic scheduling reactivation conditions, then the state of the deterministic scheduling queue is maintained. If a service in the deterministic scheduling queue meets the deterministic scheduling reactivation condition, the service is removed from the deterministic scheduling queue and moved into the deterministic reactivation queue.

5. The deterministic network scheduling method according to claim 1, characterized in that, Based on the updated resource requirements, remaining resources, and service priorities, determine whether to restore services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the ordinary scheduling queue, including: Based on the updated resource requirements, remaining resources, and service priorities, determine whether the services in the deterministic reactivation queue meet the deterministic resource block reactivation conditions. If a service in the deterministic reactivation queue does not meet the deterministic resource block reactivation conditions, the deterministic scheduling resource authorization corresponding to the service is revoked, and the service is moved to the ordinary scheduling queue. If a service in the deterministic reactivation queue meets the deterministic resource block reactivation condition, the deterministic scheduling policy of the service is updated, the service is removed from the deterministic reactivation queue and re-entered into the deterministic scheduling queue.

6. The deterministic network scheduling method according to claim 1, characterized in that, When a service in the ordinary scheduling queue meets the deterministic scheduling activation condition, the service in the ordinary scheduling queue is moved back into the deterministic waiting scheduling queue, including: Determine whether the services in the ordinary scheduling queue meet the deterministic scheduling activation conditions; If the service does not meet the deterministic scheduling activation conditions, the state of the normal scheduling queue is maintained. If a service meets the deterministic scheduling activation conditions, the service will be removed from the normal scheduling queue and re-entered into the deterministic waiting scheduling queue.

7. The deterministic network scheduling method according to claim 6, characterized in that, Determining whether the services in the ordinary scheduling queue meet the deterministic scheduling activation conditions includes: The services in the ordinary scheduling queue are detected to determine whether the service belongs to a deterministic network service, and to determine whether the modulation and coding scheme mapped by the channel quality corresponding to the service is within a preset range. If the service is a deterministic network service and the modulation and coding scheme mapped by the corresponding channel quality is within a preset range, then the service meets the deterministic scheduling activation condition. If the service is not a deterministic network service or the modulation and coding scheme mapped by the corresponding channel quality is not within the preset range, then the deterministic service does not meet the deterministic scheduling activation conditions.

8. A deterministic network scheduling device, characterized in that, include: The waiting scheduling module is used to establish deterministic network service bearers for the device and place the services to be scheduled into the deterministic waiting scheduling queue; The service allocation module is used to allocate services in the deterministic waiting scheduling queue to the deterministic scheduling queue or the ordinary scheduling queue based on the status of deterministic scheduling resources and control resources. The first scheduling module is used to determine whether the services in the deterministic scheduling queue meet the deterministic scheduling deactivation conditions. If the deterministic scheduling deactivation conditions are not met, it determines whether the deterministic scheduling reactivation conditions are met. If the deterministic scheduling reactivation conditions are met, the services are moved into the deterministic reactivation queue. The second scheduling module is used to determine, based on the updated resource requirements, remaining resources, and service priority, whether to restore the services in the deterministic reactivation queue to the deterministic scheduling queue or transfer them to the ordinary scheduling queue. The third scheduling module is used to move the services in the ordinary scheduling queue back into the deterministic waiting scheduling queue when the deterministic scheduling activation conditions are met.

9. An electronic device, characterized in that, include: Memory, used to store computer programs; A processor, configured to implement the steps of the deterministic network scheduling method as described in any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the deterministic network scheduling method as described in any one of claims 1 to 7.

Images