Service orchestration method, network device, storage medium and program product

Abstract

Provided in the embodiments of the present disclosure are a service orchestration method, a network device, a storage medium and a program product. The method comprises: acquiring service features of a plurality of guaranteed service flows; and on the basis of the service features of the plurality of guaranteed service flows, determining an orchestration result of the guaranteed service flows, the orchestration result of the guaranteed service flows being used for indicating scheduling time slots of the plurality of guaranteed service flows in an orchestration window, and the number of scheduling time slots of each guaranteed service flow in one period being determined on the basis of a delay jitter parameter in the service features of the guaranteed service flow.

Description

Service orchestration method, network device, storage medium and program product

[0001] The present disclosure claims priority to Chinese Patent Application No. 202411239745.3, filed on September 4, 2024, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0002] The present disclosure relates to the field of communication technology, and in particular to a service orchestration method, a network device, a storage medium and a program product. BACKGROUND

[0003] In the current 5th generation mobile networks (5G) industrial Internet, there are two mechanisms for how the service layer and the wireless layer cooperate. The first method is to optimize the industrial terminal packet sending mechanism, so that the industrial terminal sends packets according to the frame format of air interface scheduling, and realizes the cooperation of industrial terminal and wireless network. The second method is to use time-sensitive network (TSN) gating to improve the packet sending of the service end, so that the packet sending and scheduling can be coordinated. SUMMARY

[0004] Embodiments of the present disclosure provide a service orchestration method, a network device, a storage medium and a program product.

[0005] The present disclosure adopts the following technical solutions.

[0006] In a first aspect, embodiments of the present disclosure provide a service orchestration method, which comprises:

[0007] Obtaining service characteristics of a plurality of guaranteed service flows;

[0008] Based on the service characteristics of the plurality of guaranteed service flows, determining an orchestration result of the guaranteed service flows, the orchestration result of the guaranteed service flows being used to indicate scheduling time slots of the plurality of guaranteed service flows within an orchestration window, and the number of scheduling time slots of each guaranteed service flow within a period being determined according to a time delay jitter parameter in the service characteristics of the guaranteed service flow.

[0009] In a second aspect, embodiments of the present disclosure provide a communication device, which comprises:

[0010] An obtaining unit, configured to obtain service characteristics of a plurality of guaranteed service flows;

[0011] The processing unit is configured to determine an arrangement result of the guarantee service flows based on service characteristics of the guarantee service flows, and the arrangement result of the guarantee service flows is used to indicate scheduling time slots of the guarantee service flows in an arrangement window, and the number of the scheduling time slots of each guarantee service flow in a period is determined according to a delay jitter parameter in the service characteristics of the guarantee service flow.

[0012] In a third aspect, an embodiment of the present disclosure provides a network device, comprising a processor and a memory; the memory is coupled with the processor; the memory is configured to store instructions executable by the processor; and the processor is configured to execute the instructions, so that the network device implements the method provided in the first aspect.

[0013] In a fourth aspect, an embodiment of the present disclosure provides a computer readable storage medium, which stores computer instructions, and when the computer instructions are executed on a computer, the computer executes the method provided in the first aspect.

[0014] In a fifth aspect, an embodiment of the present disclosure provides a computer program product comprising computer instructions, and when the computer instructions are executed on a computer, the computer executes the method provided in the first aspect. BRIEF DESCRIPTION OF DRAWINGS

[0015] The accompanying drawings are included to provide a further understanding of the technical solutions of the present disclosure, constitute a part of the specification, and are used together with the embodiments of the present disclosure to explain the technical solutions of the present disclosure, and do not constitute a limitation on the technical solutions of the present disclosure.

[0016] FIG. 1 is a structural diagram of a communication system according to some embodiments of the present disclosure.

[0017] FIG. 2 is a flowchart of a service arrangement method according to some embodiments of the present disclosure.

[0018] FIG. 3 is a flowchart of another service arrangement method according to some embodiments of the present disclosure.

[0019] FIG. 4 is a flowchart of still another service arrangement method according to some embodiments of the present disclosure.

[0020] FIG. 5 is a flowchart of still another service arrangement method according to some embodiments of the present disclosure.

[0021] FIG. 6 is a system architecture diagram according to some embodiments of the present disclosure.

[0022] FIG. 7 is a service arrangement schematic diagram according to some embodiments of the present disclosure.

[0023] FIG. 8 is another service arrangement schematic diagram according to some embodiments of the present disclosure.

[0024] FIG. 9 is yet another traffic orchestration diagram according to some embodiments of the present disclosure.

[0025] FIG. 10 is yet another traffic orchestration diagram according to some embodiments of the present disclosure.

[0026] FIG. 11 is yet another traffic orchestration diagram according to some embodiments of the present disclosure.

[0027] FIG. 12 is a TSN gate list diagram according to some embodiments of the present disclosure.

[0028] FIG. 13 is another traffic orchestration diagram according to some embodiments of the present disclosure.

[0029] FIG. 14 is yet another traffic orchestration diagram according to some embodiments of the present disclosure.

[0030] FIG. 15 is another TSN gate list diagram according to some embodiments of the present disclosure.

[0031] FIG. 16 is a block diagram of a communication device according to some embodiments of the present disclosure.

[0032] FIG. 17 is a block diagram of a network device according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0033] The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the scope of protection of the present disclosure.

[0034] Unless the context otherwise requires, throughout the specification and claims, the term "comprise" and other forms such as the third-person singular "comprises" and the present participle "comprising" are interpreted as open-ended and encompassing, meaning "including, but not limited to." In the description of the specification, terms such as "one embodiment," "some embodiments," "exemplary embodiments," "example," "specific example," or "some examples" are intended to indicate that a particular feature, structure, material, or characteristic associated with that embodiment or example is included in at least one embodiment or example of this disclosure. The illustrative representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics mentioned may be included in any suitable manner in any one or more embodiments or examples.

[0035] The terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined with terms such as "first," "second," etc., may explicitly or implicitly include one or more of that feature. In the description of this disclosure, unless otherwise stated, "a plurality of" means two or more.

[0036] In this disclosure, the terms "exemplarily" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplarily" or "for example" in this disclosure should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplarily" or "for example" is intended to present the relevant concepts by way of example.

[0037] In addition, the use of “based on” implies openness and inclusivity, because processes, steps, calculations or other actions “based on” one or more of the stated conditions or values ​​may in practice be based on additional conditions or values ​​beyond those stated.

[0038] In the current 5th generation mobile communication technology (5G) industrial internet, there are two mechanisms for how the service layer and the wireless layer cooperate. The first method is to optimize the industrial terminal packet sending mechanism, so that the industrial terminal sends packets according to the frame format of air interface scheduling, and realizes the cooperation of the industrial terminal and the wireless network. The second method uses TSN gating to improve the packet sending of the service end, so that the packet sending and scheduling can cooperate, but the second method does not consider the full link jitter, and there is still room for improvement in reducing the end-to-end delay of the service flow and reducing the delay jitter in the industrial internet scenario.

[0039] Based on this, the embodiments of the present disclosure provide a service arrangement method, device, storage medium and program product. When determining the scheduling time slot of each guaranteed service flow in a period of the arrangement window, the delay jitter parameter in the service characteristics of the guaranteed service flow is considered, that is, the full link jitter is considered. It should be understood that in the related art, the number of scheduling time slots of the guaranteed service flow in a period of the arrangement window is 1, while in the present disclosure, the number of scheduling time slots of the guaranteed service flow in a period of the arrangement window is determined according to the delay jitter parameter in the service characteristics of the guaranteed service flow, that is, according to the delay jitter of the guaranteed service flow, the number of scheduling time slots of the guaranteed service flow in a period of the arrangement window can be increased, that is, the window is added, so as to increase the scheduling opportunity of the data packet of the guaranteed service flow within the delay jitter range of the guaranteed service flow, so that the data packet of the guaranteed service flow is more likely to be scheduled, without waiting for the next scheduling period, thereby reducing the end-to-end delay of the guaranteed service flow and reducing the delay jitter.

[0040] The embodiments of the present disclosure will be described below with reference to the accompanying drawings.

[0041] The technical solutions provided by the embodiments of the present disclosure can be applied to various TSN-supported communication systems, for example, new radio (NR) communication systems using 5G communication technology, future evolution systems, long term evolution (LTE) or various communication fusion systems, etc., which are not limited by the present disclosure.

[0042] FIG. 1 is a structural diagram of a communication system according to some embodiments of the present disclosure. As shown in FIG. 1, the communication system includes but is not limited to a base station 110 and a terminal 120. The base station 110 and the terminal 120 can perform wireless signal transmission, reception and related interaction, etc.

[0043] In some embodiments, the base station 110 can connect multiple terminals 120. The multiple terminals 120 can be located in the same cell or in different cells. That is, one base station 110 can provide network services to the terminals 120 in one cell, or can simultaneously provide network services to the terminals 120 in multiple cells.

[0044] In some embodiments, base stations 110 are used to provide wireless access services for terminals 120. For example, each base station 110 provides a service coverage area (also referred to as a cell). Terminals 120 that enter the area can communicate with the base station 110 through wireless signals to receive wireless access services provided by the base station 110. There can be overlaps between the service coverage areas of base stations 110, and terminals 120 in the overlapping areas can receive wireless signals from multiple base stations 110.

[0045] In the embodiments of the present disclosure, the base station 110 can be a base station in long term evolution (LTE), long term evolution advanced (LTEA) or evolutional node B (eNB or eNodeB), a base station device in a 5G network, or a base station in a future communication system (such as 6th generation mobile networks (6G)), etc., and the base station can include various macro base stations, micro base stations, home base stations, wireless remote, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or primary cells and secondary cells, and various network side devices.

[0046] In the embodiments of the present disclosure, the terminal 120 is a device with wireless transceiving function, which can be deployed on land, including indoor or outdoor; can also be deployed on water surface (such as on a ship, etc.); and can also be deployed in the air (such as on an airplane, a balloon and a satellite, etc.). The terminal 120 can be a mobile phone, a tablet computer (Pad), a computer with wireless transceiving function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. The embodiments of the present disclosure do not limit the application scenarios. The terminal can also be referred to as a user, a user equipment (UE), an access terminal, a UE unit, a UE station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a UE terminal, a wireless communication device, a UE agent or a UE apparatus, etc. The present disclosure does not limit this.

[0047] It should be understood that FIG. 1 is an exemplary structural diagram, and the number of devices included in the communication system shown in FIG. 1 is not limited, for example, the number of base stations and terminals is not limited. In addition, the communication system shown in FIG. 1 can include other devices in addition to the devices shown in FIG. 1, and the present disclosure does not limit this.

[0048] Next, FIG. 2 is a flowchart of a service orchestration method according to some embodiments of the present disclosure. As shown in FIG. 2, the embodiments of the present disclosure provide a service orchestration method, which is applied to a base station, and the base station can be the base station 110 shown in FIG. 1. In some embodiments, the method can be applied to a computing power single board of the base station. The method can include the following steps S101-S102.

[0049] In S101, service characteristics of a plurality of guaranteed service flows are acquired.

[0050] Guaranteed traffic flow is a traffic flow with requirements on latency and bandwidth. The guaranteed traffic flow enjoys specific resource guarantee in the network, i.e., the network ensures to provide a predetermined bit rate to the guaranteed traffic flow within an average time window. In addition to the predetermined bit rate, the guaranteed traffic flow can also include a parameter of maximum flow bit rate (MFBR) for limiting the highest bit rate of the guaranteed traffic flow under specific conditions. The guaranteed traffic flow is usually used for applications with strict requirements on latency and bandwidth, such as voice call, video conference, etc.

[0051] In some embodiments, the plurality of guaranteed traffic flows belong to the same cell, i.e., the service characteristics of the plurality of guaranteed traffic flows are obtained from the service characteristics of the plurality of guaranteed traffic flows in the same cell. The service characteristics of one of the guaranteed traffic flows include at least one of the following: period, packet size, packet arrival time, and latency jitter parameter. Here, the period is the period of data packets, the packet size is the size of data packets, the packet arrival time is the arrival time of data packets, and the latency jitter parameter of the guaranteed traffic flow can be the amplitude of the latency jitter of the guaranteed traffic flow.

[0052] In some embodiments, the service characteristics can have other names, such as service model, which is not limited in the present disclosure.

[0053] In S102, the scheduling result of the guaranteed traffic flow is determined based on the service characteristics of the plurality of guaranteed traffic flows.

[0054] In some embodiments, after the base station obtains the service characteristics of the plurality of guaranteed traffic flows, the base station can perform service scheduling on the plurality of guaranteed traffic flows within a scheduling window based on the service characteristics of the plurality of guaranteed traffic flows, to obtain the scheduling result of the guaranteed traffic flow. Here, the scheduling result of the guaranteed traffic flow is used to indicate the scheduling time slots of the plurality of guaranteed traffic flows within the scheduling window, and the number of scheduling time slots of each guaranteed traffic flow within a period of the scheduling window is determined according to the latency jitter parameter in the service characteristics of the guaranteed traffic flow.

[0055] For how the scheduling window is determined, reference can be made to the corresponding description in the embodiment shown in FIG. 5 below, which is not repeated here.

[0056] In some embodiments, determining the scheduling result of the guaranteed traffic flow based on the service characteristics of the plurality of guaranteed traffic flows (S102) can include the following steps S1 to S5.

[0057] In S1, for each of the plurality of guaranteed traffic flows, a reference time slot of each period within the scheduling window is determined based on the first packet arrival time and the period in the service characteristics of the guaranteed traffic flow.

[0058] It should be noted that, considering the terminal-base station-core network-application end full-link jitter and clock synchronization problems, the arrangement result of the guaranteed service flow may deviate from the actual result, so the packet arrival time point of the arranged guaranteed service flow is protected by increasing the scheduling opportunities before and after the packet arrival time point, that is, the same service characteristics are added before and after the packet arrival time point in the service characteristics of the guaranteed service flow, so as to realize window protection.

[0059] In some embodiments, based on the priorities of the plurality of guaranteed service flows, the plurality of guaranteed service flows are arranged on the time domain according to the first packet arrival time (system frame number & slot offset, SFN & slot offset) of each guaranteed service flow. For example, the plurality of guaranteed service flows are arranged on the time domain according to the first packet arrival time of each guaranteed service flow in the order of the priorities of the plurality of guaranteed service flows from high to low. Then, for each guaranteed service flow in the plurality of guaranteed service flows, based on the first packet arrival time and the period in the service characteristics of the guaranteed service flow, the reference time slots of the guaranteed service flow in each period within the arrangement window are determined.

[0060] In some embodiments, the first packet arrival time of the guaranteed service flow in a period is taken as the reference time slot of the guaranteed service flow in a period within the arrangement window, and then based on the period in the service characteristics of the guaranteed service flow, the reference time slots of the guaranteed service flow in other periods within the arrangement window are marked forwardly by period until the upper limit of the arrangement window is exceeded, and then the reference time slots of the guaranteed service flow in other periods within the arrangement window are marked reversely by period until the lower limit of the arrangement window is exceeded. In this way, the reference time slots of the guaranteed service flow in each period within the arrangement window are obtained.

[0061] In S2, based on the time delay jitter parameter of the guaranteed service flow, the windowed time domain length corresponding to the guaranteed service flow is determined.

[0062] In some embodiments, based on the time delay jitter parameter and the slot length of the guaranteed service flow, the windowed time domain length corresponding to the guaranteed service flow is determined.

[0063] For example, the windowed time domain length = time delay jitter parameter / slot length / 2.

[0064] In some embodiments, the slot length is the slot length of the frame structure of the radio frame matched with the plurality of guaranteed service flows. The frame structure of the radio frame includes a distribution system (DS) frame structure, a 2.5 ms single frame structure, and a 2.5 ms double frame structure. Each frame structure of the radio frame includes an uplink time slot and a downlink time slot. For example, the DS frame structure is composed of one downlink time slot and one uplink time slot.

[0065] In some embodiments, the time slots matched within the scheduling window will be used for protection scheduling. Each extended window is added to the list of traffic characteristics of the guaranteed traffic flow as a new traffic characteristic of the guaranteed traffic flow, for pre-allocating resources when scheduling.

[0066] In S3, based on the windowed time domain length and the reference time slot of each period of the guaranteed traffic flow within the scheduling window, the scheduling time window of each period of the guaranteed traffic flow within the scheduling window is determined.

[0067] Here, the scheduling time window includes the reference time slot and the time slots adjacent to the reference time slot. For example, the forward and reverse of the reference time slot of one period of the guaranteed traffic flow within the scheduling window are respectively increased by the windowed time domain length to obtain the scheduling time window of the period of the guaranteed traffic flow within the scheduling window. That is, the period of the guaranteed traffic flow within the scheduling window is extended by the windowed time domain length before and after the reference time slot of one period of the guaranteed traffic flow within the scheduling window to obtain the scheduling time window of the period of the guaranteed traffic flow within the scheduling window.

[0068] In S4, the time slots included in the scheduling time window of each period of the guaranteed traffic flow within the scheduling window are used as the scheduling time slots of the guaranteed traffic flow.

[0069] In some embodiments, assuming that the reference time slot of one period of the guaranteed traffic flow within the scheduling window is the third time slot, and the windowed time domain length is two time slots, the scheduling time window of one period of the guaranteed traffic flow within the scheduling window is the first time slot to the fifth time slot of the period. Further, the first time slot to the fifth time slot of one period of the guaranteed traffic flow within the scheduling window can be used as the scheduling time slots of the guaranteed traffic flow.

[0070] In this way, for each guaranteed traffic flow in the plurality of guaranteed traffic flows, the above-mentioned S1-S4 processing is performed, and the scheduling time slots of the plurality of guaranteed traffic flows are obtained.

[0071] In S5, based on the scheduling time slots of the plurality of guaranteed traffic flows, the scheduling result of the guaranteed traffic flow is obtained.

[0072] After obtaining the scheduling time slots of the plurality of guaranteed traffic flows, the scheduling time slots of the plurality of guaranteed traffic flows can be arranged in the scheduling window to obtain the scheduling result of the guaranteed traffic flow.

[0073] Based on the embodiment shown in FIG. 2, when determining the scheduling time slot of each guarantee service flow in a period of the arrangement window, the time delay jitter parameter in the service characteristics of the guarantee service flow is considered, that is, the whole link jitter is considered. It should be understood that the number of scheduling time slots of the guarantee service flow in a period of the arrangement window in the related art is 1, while in the embodiment of the present disclosure, the number of scheduling time slots of the guarantee service flow in a period of the arrangement window is determined according to the time delay jitter parameter in the service characteristics of the guarantee service flow, that is, according to the time delay jitter of the guarantee service flow, the number of scheduling time slots of the guarantee service flow in a period of the arrangement window can be increased, that is, the window is added, so as to increase the scheduling opportunity of the data packet of the guarantee service flow within the time delay jitter range of the guarantee service flow, so that the data packet of the guarantee service flow is more likely to be scheduled, without waiting for the next scheduling period, thereby reducing the end-to-end time delay of the guarantee service flow and reducing the time delay jitter.

[0074] In some embodiments, in order to improve the availability of the arrangement result of the guarantee service flow, the above step S5 can include steps S51 to S54.

[0075] In S51, the scheduling time slot to be adjusted is determined from the scheduling time slots of the plurality of guarantee service flows.

[0076] Here, the scheduling time slot to be adjusted is a scheduling time slot that does not satisfy the transmission constraint condition.

[0077] The transmission constraint condition includes at least one of the following:

[0078] The transmission direction of the time slot is the same as the transmission direction of the guarantee service flow corresponding to the scheduling time slot;

[0079] The number of terminals scheduled in the transmission time interval corresponding to the time slot is less than a preset number;

[0080] The frequency domain resource occupied by the user on the time slot does not exceed the frequency domain resource limit;

[0081] Different types of guarantee service flows of the same user are not supported on the time slot.

[0082] It should be noted that the above time slot is a time slot of the frame structure of the radio frame matched with the plurality of guarantee service flows. Taking the DS frame structure as an example, the DS frame structure is composed of uplink time slots and downlink time slots arranged alternately. Assuming that a time slot is an uplink time slot, that is, the transmission direction of the time slot is the uplink direction, if the transmission direction of the guarantee service flow corresponding to the scheduling time slot corresponding to the time slot is the downlink direction, it means that the scheduling time sequence is the scheduling time slot to be adjusted.

[0083] The transmission time interval can be a transmission time interval (TTI), and the number of terminals scheduled in the transmission time interval corresponding to the time slot is related to the scheduling capability of the base station physical cell. The preset number can be related to the cell scheduling capability.

[0084] The frequency domain resource can refer to an air interface frequency domain resource. The time slot does not support different types of guarantee service flows of the same user can refer to that when the same user has an enhanced mobile broadband (eMBB) service flow and an ultra-reliable and low latency communications (URLLC) service flow at the same time, the two guarantee service flows cannot be in the same time slot.

[0085] In S52, based on the delay margin of the to-be-adjusted scheduling time slot, the adjustable scheduling time slot is determined from the to-be-adjusted scheduling time slot.

[0086] Here, the delay margin of the to-be-adjusted scheduling time slot is the delay margin of the guarantee service flow corresponding to the to-be-adjusted scheduling time slot, and the delay margin of the guarantee service flow is the difference between the target delay and the measured delay of the guarantee service flow.

[0087] In some embodiments, the to-be-adjusted scheduling time slot with a delay margin greater than a threshold in the to-be-adjusted scheduling time slot is taken as the adjustable scheduling time slot. For example, the threshold is 0, that is, the to-be-adjusted scheduling time slot with a delay margin greater than 0 in the to-be-adjusted scheduling time slot is taken as the adjustable scheduling time slot.

[0088] In S53, the time domain position of the service guarantee flow corresponding to the adjustable scheduling time slot in the arrangement window is adjusted to obtain the adjusted scheduling time slot.

[0089] Here, the delay margin of the adjusted scheduling time slot meets the delay requirement of the corresponding guarantee service flow, and the adjusted scheduling time slot meets the transmission constraint condition.

[0090] In some embodiments, adjusting the time domain position of the service guarantee flow corresponding to the adjustable scheduling time slot in the arrangement window to obtain the adjusted scheduling time slot includes: when the adjustable scheduling time slot is multiple, determining the adjustment order of the multiple adjustable scheduling time slots based on the delay margin and / or flow priority of each of the multiple adjustable scheduling time slots. Here, the flow priority of the adjustable scheduling time slot is the priority of the guarantee service flow corresponding to the adjustable scheduling time slot. Then, based on the adjustment order of the multiple adjustable scheduling time slots, the time domain position of the service guarantee flow corresponding to the multiple adjustable scheduling time slots in the arrangement window is adjusted in sequence to obtain multiple adjusted scheduling time slots.

[0091] For example, after determining the adjustable scheduling slots, the adjustable scheduling slots can be arranged according to preset rules, such as rules from large to small of the time delay margins, to obtain an adjustment order, and then the time domain positions of the adjustable scheduling slots are sequentially moved backward from front to back based on the adjustment order, and the time domain positions of the adjustable scheduling slots are moved backward by no more than the range of the time delay margin, the time slot whose transmission direction is the same as that of the guaranteed service flow corresponding to the scheduling slot, the nearest time slot that does not exceed the TTI scheduling capability limit and the frequency domain resource limit, until there is no time slot that meets the above transmission constraint conditions available, to obtain the adjusted scheduling slots.

[0092] It should be understood that if a scheduling slot does not meet the transmission constraint condition, the time slot is not available in the arrangement result of the guaranteed service flow, and each TSN gate cannot correctly transmit and receive data packets in the scheduling slot according to the arrangement result of the guaranteed service flow, and therefore the time domain position of the guaranteed service flow corresponding to the adjustable scheduling slot in the arrangement window is adjusted, so that the adjusted scheduling slot can meet the transmission constraint condition and can improve the availability of the arrangement result of the guaranteed service flow.

[0093] It should be noted that in the case where there are adjustable scheduling slots with the same time delay margin, the adjustable scheduling slots with the same time delay margin can be arranged according to the priorities of the adjustable scheduling slots with the same time delay margin.

[0094] In some embodiments, for the non-adjustable scheduling slot in the scheduling slot to be adjusted, the non-adjustable scheduling slot can be deleted in the arrangement result of the guaranteed service flow. If the adjustable scheduling slot still does not meet the above transmission constraint condition after adjustment, the adjustable scheduling slot can be deleted in the arrangement result of the guaranteed service flow.

[0095] In some embodiments, it is assumed that the adjustable scheduling slots include a first scheduling slot and a second scheduling slot, and the transmission directions of the guaranteed service flows corresponding to the first scheduling slot and the second scheduling slot are both uplink transmission directions. The frame structure matched with the guaranteed service flow is a DS frame structure, for example, the frame structure is 01010101, where 0 represents an uplink time slot and 1 represents a downlink time slot. The initial time slot corresponding to the first scheduling slot is the second time slot (i.e., the first 1) in the above frame structure, and the initial time slot corresponding to the second scheduling slot is the fourth time slot (i.e., the second 1) in the above frame structure.

[0096] Suppose the delay margin of the guaranteed service flow 1 corresponding to the first scheduling time slot is 2, and the delay margin of the guaranteed service flow 2 corresponding to the second scheduling time slot is 3, then the adjustment order is to adjust the guaranteed service flow 2 data packet of the second scheduling time slot first, and then adjust the guaranteed service flow 1 data packet of the first scheduling time slot. After that, the time domain position of the guaranteed service flow 2 data packet of the second scheduling time slot is moved backward first, which can be moved to the fifth time slot (i.e. the third 0) in the above frame structure, and the moving distance does not exceed the delay margin of the second scheduling time slot, and then it is determined that the adjusted time slot of the guaranteed service flow 2 data packet of the second scheduling time slot is the fifth time slot. Then, the time domain position of the guaranteed service flow 1 data packet of the first scheduling time slot is moved backward, which can be moved to the seventh time slot (i.e. the fifth 0) in the above frame structure, but the moving distance exceeds the delay margin 2 of the guaranteed service flow corresponding to the first scheduling time slot, which means that the guaranteed service flow 1 data packet of the first scheduling time slot cannot be adjusted, and the guaranteed service flow 1 data packet of the first scheduling time slot can be deleted in the arrangement result of the guaranteed service flow.

[0097] In S54, the arrangement result of the guaranteed service flow is obtained based on the adjusted scheduling time slot.

[0098] It should be understood that the time domain position of the adjusted scheduling time slot corresponding to the guaranteed service flow in the arrangement window can be obtained based on the unadjusted scheduling time slot and the adjusted scheduling time slot in the arrangement window after the adjusted scheduling time slot is obtained.

[0099] In this way, through the above steps S51-S54, the arrangement result of the guaranteed service flow with higher availability can be obtained.

[0100] In some embodiments, the arrangement result of the guaranteed service flow includes a plurality of service configuration items, and the service configuration item is used to indicate one guaranteed service flow of one terminal in one scheduling time slot in the arrangement window. It should be understood that due to terminal capability and equipment limitations, the number of configuration items cannot exceed the number limit, and at the same time, reducing the number of configuration items can reduce the size of the delivery message. Based on this, FIG. 3 is a flow chart of another service arrangement method according to some embodiments of the present disclosure, as shown in FIG. 3, after step S102, the method can further include the following step S201.

[0101] In S201, at least two service configuration items in the plurality of service configuration items that meet the merging condition are merged to obtain a merged service configuration item.

[0102] The merging condition includes any of the following:

[0103] Condition 1: The at least two service configuration items to be merged belong to the same guaranteed service flow, and the scheduling time slot of the guaranteed service flow in each period in the arrangement window has not been processed by the delay processing;

[0104] Condition 2: The at least two service configuration items to be merged belong to the same protection service flow, and the scheduling time slots of the protection service flow in each period within the scheduling window undergo the same postponement processing.

[0105] Condition 3: The at least two service configuration items to be merged belong to the same terminal and indicate the same time slot.

[0106] It should be understood that for the above-mentioned Condition 1 and Condition 2, that is, if a protection service flow has multiple configuration items in each period, only one configuration item can be output if no single data packet postponement occurs or all data packets in the protection service flow are postponed as a whole within the scheduling window. For the above-mentioned Condition 3, that is, if multiple protection service flows of a terminal are in the same time slot, UE-level configuration item merging can be performed.

[0107] It should be understood that merging the at least two service configuration items that meet the merging conditions can reduce the size of information transmission and improve the utilization rate of transmission resources.

[0108] In some embodiments, after obtaining the scheduling result of the protection service flow, the base station can divide the scheduling result of the protection service flow according to the terminal level to obtain the scheduling result of the protection service flow corresponding to each terminal, and then send the scheduling result of the protection service flow corresponding to each terminal to each TSN gate respectively, so that each TSN gate transmits and receives data packets based on the scheduling result of the protection service flow. At the same time, the base station converts the air interface time (SFN&slot&minislot) into system time (dd:hh:mm:ss.us).

[0109] In some embodiments, the base station can also send the scheduling result of the protection service flow to the base station scheduler.

[0110] The above embodiments are described by taking service scheduling of the protection service flow as an example. In some embodiments, in the case where there are both protection service flows and non-protection service flows, how to reduce the end-to-end delay and delay jitter of the protection service flow is a problem to be solved. Based on this, FIG. 4 is a flowchart of another service scheduling method according to some embodiments of the present disclosure, as shown in FIG. 4, after step S102, the method can include the following steps S301-S302.

[0111] In S301, the service characteristics of the non-protection service flow are obtained.

[0112] It should be understood that although the scheduling is for guaranteed service flow, the transmission and scheduling of non-guaranteed service flow also needs to be considered. For example, if there is a non-periodic control message in the non-guaranteed service flow, the non-periodic control message also needs to be transmitted and scheduled, otherwise it will affect the system operation and the scheduling of the guaranteed service flow.

[0113] In some embodiments, after the service scheduling of the guaranteed service flow, the service characteristics of the non-guaranteed service flow can be obtained, and then the service scheduling of the non-guaranteed service flow can be performed. The non-guaranteed service flow can be a non-guaranteed service flow of the cell to which the guaranteed service flow belongs. The description of the service characteristics of the non-guaranteed service flow can refer to the description of the service characteristics of the guaranteed service flow, and the disclosure will not be repeated here.

[0114] In S302, based on the service characteristics of the non-guaranteed service flow and the scheduling result of the guaranteed service flow, the scheduling result of the non-guaranteed service flow is determined.

[0115] Here, the scheduling result of the non-guaranteed service flow is used to indicate the scheduling time slot of the non-guaranteed service flow in the scheduling window, that is, based on the service characteristics of the non-guaranteed service flow and the scheduling result of the guaranteed service flow, the scheduling time slot of the non-guaranteed service flow in the scheduling window is determined, and the scheduling result of the non-guaranteed service flow is obtained.

[0116] In some embodiments, the service characteristics of the non-guaranteed service flow include the transmission direction of the non-guaranteed service flow, and based on the transmission direction of the non-guaranteed service flow, the scheduling time slot of the non-guaranteed service flow is determined in the remaining time slots in the scheduling window except for the scheduling time slot of the guaranteed service flow.

[0117] In some embodiments, based on the fact that there is a first remaining time slot in the remaining time slots, the scheduling time slot of the non-guaranteed service flow is determined in the first remaining time slot, and the first remaining time slot is a time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow. Alternatively, based on the fact that there is no first remaining time slot in the remaining time slots, the scheduling time slot of the non-guaranteed service flow is determined in a second remaining time slot, and the second remaining time slot is a time slot in the remaining time slots that is opposite to the transmission direction of the non-guaranteed service flow. That is, in the case that there is a time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow, the non-guaranteed service flow is scheduled to the time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow. In the case that there is no time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow, in order to guarantee the transmission of some random control messages, the non-guaranteed service flow is scheduled to the time slot in the remaining time slots that is opposite to the transmission direction of the non-guaranteed service flow, that is, the non-guaranteed service flow is transmitted in the time slot in the opposite direction of the service direction, in other words, the system time corresponding to this time slot in the opposite direction is opened.

[0118] Thus, in the case of both guaranteed service flows and non-guaranteed service flows, based on the service characteristics of the non-guaranteed service flows and the arrangement result of the guaranteed service flows, the arrangement result of the non-guaranteed service flows is determined, that is, after the guaranteed service flows are arranged, the non-guaranteed service flows are arranged, and the guaranteed service flows are preferentially arranged, so that in the case of both guaranteed service flows and non-guaranteed service flows, the end-to-end delay and delay jitter of the guaranteed service flows can be reduced.

[0119] In some embodiments, after obtaining the arrangement result of the guaranteed service flows and the arrangement result of the non-guaranteed service flows, air interface configuration checking and TSN configuration checking are performed, and if the limit is exceeded, the service flows participating in the arrangement are deleted from low to high according to the priority. Here, the limit can refer to the quantity limit that the TSN list has 64.

[0120] It should be noted that the embodiment shown in FIG. 4 is an improvement at the sending end. At the scheduler side, the deterministic service scheduler allocates resources in advance according to the arrangement result, but since there are non-guaranteed service flows with randomness, they may occupy the resources allocated in advance to the guaranteed service flows. Therefore, the scheduler can allocate new resources according to the data amount reported in the scheduling request initiated by the non-guaranteed service flow, instead of occupying the reserved resources, that is, the new request resources and the reserved resources need to be summed. Thus, in the case of both guaranteed service flows and non-guaranteed service flows, the guaranteed service flows and the non-guaranteed service flows are considered, so that the reserved resources of the guaranteed service flows cannot be occupied by the non-guaranteed service flows, which helps to reduce the end-to-end delay of the guaranteed service flows, while reducing the delay jitter.

[0121] In some embodiments, there is a reserved time domain resource in each time slot in the arrangement window, and the reserved time domain resource is used for scheduling transmission of a target service flow. The target service flow is a service flow with a delay requirement meeting a preset requirement in the plurality of guaranteed service flows and non-guaranteed service flows. The reserved time domain resource in each time slot in the arrangement window can be understood as long connection scheduling for the target service flow, that is, the windowed time domain length of the target service flow covers the entire arrangement window. The extended scheduling time slots can be added to the service characteristics of the target service flow, and used together with the real service characteristics for resource pre-allocation.

[0122] In some embodiments, the service flows meeting the preset requirements include the monitoring type service flows or the alarm type service flows in the guaranteed service flows, and the non-periodic alarm type service flows in the non-guaranteed service flows. Taking the alarm reporting data of the security device as an example, this kind of data is related to the safety production and needs to be arranged and reserved resources. Since the non-periodic alarm type service flow is treated as a small cycle and a small data volume service flow, resources are reserved in each time slot in the arrangement window, that is, a new service configuration item is added, to ensure that this kind of service flow will be scheduled in time and the delay increase during the industrial service running process can be avoided.

[0123] In some embodiments, after obtaining the arrangement result of the non-guaranteed service flow, the base station can send the arrangement result of the non-guaranteed service flow to each TSN gate according to the level of each terminal, so that each TSN gate transmits and receives data packets based on the arrangement result of the non-guaranteed service flow, and the base station converts the air interface time into the system time.

[0124] In some embodiments, the base station can also send the arrangement result of the non-guaranteed service flow to the base station scheduler.

[0125] In some embodiments, before the service arrangement of the plurality of guaranteed service flows, the duration and the starting time of the arrangement window need to be determined, so that the plurality of guaranteed service flows can be placed in the arrangement window. Based on this, FIG. 5 is a flowchart of another service arrangement method according to some embodiments of the present disclosure, as shown in FIG. 5, the method can further include the following steps S401-S402.

[0126] In S401, the duration and the starting time of the arrangement window are determined.

[0127] In some embodiments, the duration of the arrangement window is determined by:

[0128] The periods of the plurality of guaranteed service flows and the frame structure period of the radio frame are obtained. Based on the periods of the plurality of guaranteed service flows and the frame structure period of the radio frame, the duration of the arrangement window is determined.

[0129] Here, the periods of the plurality of guaranteed service flows can be obtained from the service characteristics of the plurality of guaranteed service flows, and the radio frame is a radio frame matched with the plurality of guaranteed service flows, for example, a DS frame.

[0130] Based on the periods of the plurality of guaranteed service flows and the frame structure period of the radio frame, the duration of the arrangement window can be determined by taking the least common multiple of the periods of the plurality of guaranteed service flows and the frame structure period of the radio frame as the duration of the arrangement window.

[0131] It should be noted that the duration of the arrangement window needs to meet the condition that it cannot exceed the TSN gating hardware time limit, and if it exceeds, the minimum common multiple M is calculated by traversing and selecting from the highest priority guaranteed service flow; when the priorities are the same, the guaranteed service flow that is an integer multiple of the frame structure period of the radio frame is preferentially selected; finally, the minimum common multiple is ensured to be less than or equal to the TSN gating hardware time limit, that is, the duration of the arrangement window is less than or equal to the TSN gating hardware time limit.

[0132] After the duration of the arrangement window is determined, in order to ensure that the plurality of guaranteed service flows are all arranged in the arrangement window, before arranging the plurality of guaranteed service flows, the reference time of the plurality of guaranteed service flows needs to be determined, that is, the starting time of the arrangement window is determined.

[0133] In some embodiments, the starting time of the arrangement window is determined, including:

[0134] A guaranteed service flow with the highest priority is determined from the plurality of guaranteed service flows; and the starting time of the arrangement window is determined based on the first packet arrival time of the guaranteed service flow with the highest priority.

[0135] In some embodiments, the first packet arrival time of the guaranteed service flow with the highest priority is taken as the starting time of the arrangement window.

[0136] In some embodiments, when the starting time of the arrangement window is determined based on the first packet arrival time of the guaranteed service flow with the highest priority, the packet arrival time of the guaranteed service flow is converted from system time (dd:hh:mm:ss.us) to air interface time (SFN & slot & minislot).

[0137] In some embodiments, when the guaranteed service flow with the highest priority includes an eMBB service flow and a URLLC service flow, and the eMBB service flow and the URLLC service flow belong to the same user, due to the minimum granularity difference between the frame structures of the eMBB service flow and the URLLC service flow, the starting time of the arrangement window is based on the first packet arrival time of the eMBB service flow. It should be understood that because the time granularity of the URLLC service flow is small (minislot), if the reference time of the URLLC (i.e., the first packet arrival time) is taken as the reference, the eMBB service flow cannot be aligned to the start of a certain time slot (slot).

[0138] In some embodiments, after the starting time of the arrangement window is obtained, the starting time of the arrangement window can be issued to the TSN gate and the scheduler. It should be noted that considering the system delay, the starting time of the arrangement window needs to be future time when it is issued to the TSN gate and the scheduler, and if it is not future time, it will cause a large delay. The future time is obtained by moving the starting time of the arrangement window backward according to the service period multiple.

[0139] At S402, a location of the scheduling window on the wireless time domain resource is determined based on the duration and the start time of the scheduling window.

[0140] After obtaining the duration and the start time of the scheduling window, the location of the scheduling window on the wireless time domain resource can be determined, and then the multiple guaranteed service flows are scheduled based on the location of the scheduling window on the wireless time domain resource, so that the multiple guaranteed service flows can be placed in the scheduling window.

[0141] In some embodiments, the method for service scheduling provided by the embodiments of the present disclosure is applied to an industrial internet (To business, ToB) scenario to realize cross-layer scheduling of the service layer and the wireless layer.

[0142] The above embodiments are described by taking the method for service scheduling provided by the embodiments of the present disclosure as an example applied to a computing power single board of a base station. FIG. 6 is a system architecture diagram according to some embodiments of the present disclosure. Referring to FIG. 6, the system includes a module A, a module B, a module C, a module D, and a base station.

[0143] Here, the module A is a cross-layer scheduling module, which is configured to schedule service flows according to wireless resources based on service characteristics of the service flows and an air interface scheduling frame structure. The scheduling result of the module A is sent to the module D and the base station.

[0144] The module B is a service characteristic learning module, and the service characteristics mainly refer to {packet size, packet period, packet arrival time}. The service characteristics can also be obtained by fixed configuration.

[0145] The module C is a delay measurement module, which is configured to measure end-to-end delay at a user level or a service flow level.

[0146] The module D is a TSN gate module, which is configured to control all device-side TSN translators (DS-TT) QBV gates of access users to send data packets according to the scheduled time points.

[0147] The base station is configured to provide wireless information to the module A, and the wireless information includes cell information, scheduling information, and time information.

[0148] The module A, the module B, the module C, and the module D are all logical modules, which can be built-in in the base station and located on a computing power single board of the base station, or can be externally hung outside the base station and be independent devices. The method for service scheduling provided by the embodiments of the present disclosure can be applied to the module A.

[0149] The method for service scheduling provided by the embodiments of the present disclosure is described by taking several examples.

[0150] Example 1, taking the DS frame structure as an example, can include the following steps:

[0151] A1, determine the length of the scheduling window.

[0152] FIG. 7 is a schematic diagram of service scheduling according to some embodiments of the present disclosure. Referring to FIG. 7, assuming there are four guaranteed service flows UE1-f2, UE2-f2, UE1-f1, and UE2-f1, the least common multiple of the service periods of the four guaranteed service flows is 20 ms, and each slot slot is 0.5 ms, then the length of the scheduling window is 40 slots.

[0153] FIG. 8 is another schematic diagram of service scheduling according to some embodiments of the present disclosure; FIG. 9 is still another schematic diagram of service scheduling according to some embodiments of the present disclosure; FIG. 10 is still another schematic diagram of service scheduling according to some embodiments of the present disclosure; FIG. 11 is still another schematic diagram of service scheduling according to some embodiments of the present disclosure; FIG. 12 is a schematic diagram of a TSN gating list according to some embodiments of the present disclosure; FIG. 13 is another schematic diagram of service scheduling according to some embodiments of the present disclosure; FIG. 14 is still another schematic diagram of service scheduling according to some embodiments of the present disclosure; and FIG. 15 is another schematic diagram of a TSN gating list according to some embodiments of the present disclosure. It should be noted that the parameters shown in FIG. 7 and the following FIGS. 8-15 are only logical examples and have no actual reference value, and the following will not be repeated.

[0154] A2, determine the start time of the scheduling window.

[0155] In combination with the above FIG. 7, the priority of UE1-f2 is the highest (priority 7 is the highest, and 0 is the lowest), and the start time of the scheduling window is slot 1.

[0156] A3, match with the frame structure.

[0157] The frame structure is a DS frame structure.

[0158] UE1-f2: the first packet arrival time is offset = 1, then according to the period 4 ms, every 8 slots will place 60 data packets in the scheduling window;

[0159] UE2-f2: the first packet arrival time is offset = 17, then according to the period 5 ms, every 10 slots will place 80 data packets in the scheduling window in the forward direction first, and then in the reverse direction;

[0160] UE1-f1: the first packet arrives at offset = 3, and every 8 slots, a 50-byte packet is placed in the scheduling window according to a period of 4 ms;

[0161] UE2-f1: the first packet arrives at offset = 2, and every 10 slots, a 70-byte packet is placed in the scheduling window according to a period of 5 ms;

[0162] A4, windowing.

[0163] Taking UE1-f1 as an example, if the time delay jitter parameter of UE1-f1 is 2 ms, a 1-ms window is added before and after each data packet.

[0164] When the slot type is matched, only the same type of windowing is retained. The service characteristics of UE1-f1 can be as shown in FIG. 8.

[0165] It should be noted that in FIG. 8, the slot type Slot Type (DS) represents the frame structure type: 1 represents an uplink slot; and 0 represents a downlink slot. Since some slots are not scheduled with service flows, the slot type of the slots is not shown in FIG. 8, for example, the 6th-8th slots, the 14th-16th slots, the 22nd-24th slots, and the like. The same applies below, and the following will not be described again.

[0166] A5, frame structure slot check.

[0167] Check whether the transmission direction of the slot matches the transmission direction of the protection service flow. When the transmission direction of the slot matches the transmission direction of the protection service flow, UE2-f1 has a conflict, and the protection service flow and the corresponding slot are marked as

need to be postponed

[0168] Judge the scheduling capability of the base station physical cell: the user equipment configuration number (Cfg UE Number) represents the number of schedulable users, such as 100. The number of UEs scheduled per TTI is less than the cell scheduling capability.

[0169] Judge the air interface frequency domain resource: it is assumed that the resource occupied by each slot user does not exceed the frequency domain resource limit.

[0170] The following is for clear description, and the service characteristics similar to those in FIG. 8 are removed, and FIG. 9 can be obtained.

[0171] A6, postponement processing.

[0172] Calculate the time delay allowance deltaLatency of each protection service flow. If the time delay allowance value deltaLatency of UE2-f1 is 2 ms, it can be postponed to the nearest uplink slot, and FIG. 10 can be obtained.

[0173] A7, UE configuration item merging.

[0174] If there is no packet-level delay for one flow or all data packets of the flow are delayed as a whole within the scheduling window, only one configuration item can be output.

[0175] UE1-f2 reference time is the reference time of the entire cell, which is the starting point of slot0.

[0176] Output: UL

[0177] UE1{{period=8,offset=2,size=50},{period=8,offset=0,size=60}},

[0178] UE2{{period=10,offset=2,size=70},{period=10,offset=6,size=80}}.

[0179] A8, scheduling non-guaranteed service flow.

[0180] After all guaranteed service flows are scheduled, non-guaranteed service flows are inserted into the remaining time slots matching the service direction.

[0181] After inserting the non-guaranteed service flow, the following Figure 11 can be obtained, f3 in Figure 11 is the inserted non-guaranteed service flow, and the black rectangle in Figure 11 is the scheduling time slot occupied by the non-guaranteed service flow in the scheduling window. The time slots not shown in 0-39 time slots represent that the time slots are not scheduled service flows, for example, the 5th time slot, the 7th time slot, etc., which will not be described below.

[0182] A9, sending TSN gate list.

[0183] The cell-level scheduling map is sent to each TSN gate according to the UE level. For example, the TSN gate list of UE1 can be as shown in Figure 12.

[0184] Example 2, join URLLC user.

[0185] On the basis of eMBB users, URLLC users are introduced, DS frame structure is adopted, and all users initiate uplink services. The scheduling result of eMBB users can be as shown in Figure 12 above, and the scheduling result of URLLC users can be as shown in Figure 13 below. It can include the following steps:

[0186] B1, determine the length of the scheduling window.

[0187] The period of eMBB user is 20ms, and the period of UE1-f3 and UE2-f4 is 2ms in this example. When the UE level is combined, the length of the scheduling window of eMBB user is 20ms, so the length of the overall scheduling window is actually 20ms.

[0188] B2, determine the start time of the scheduling window.

[0189] The start time of the scheduling window selects the reference time of the eMBB user.

[0190] B3, match with the frame structure.

[0191] The time slots occupied by UE1-f3 and UE2-f4 are as follows:

[0192] UE1-f3{2, 6, 10, 14, 18, 22, 26, 30, 34, 38}; UE2-f4{0, 4, 8, 12, 16, 20, 24, 28, 32, 36};

[0193] B4: frame structure time slot check:

[0194] Check whether the type of time slot matches the service direction. In this example, the data packet is exactly in the uplink time slot.

[0195] Determine the scheduling capability of the base station physical cell: the number of users per time slot does not exceed the scheduling capability, such as 100.

[0196] Determine the air interface frequency domain resource: it is assumed that the frequency domain resource is not exceeded in this example.

[0197] Check whether the eMBB and URLLC services of the same user are in the same time slot: the time slots with arrows in FIG. 13 are the two types of guarantee service flows of the same UE in the same time slot, and the guarantee service flow and time slot marker need to be postponed.

[0198] B5: postponement processing.

[0199] It is assumed that the delay margin of UE1-f3 and UE2-f4 is large, so UE1-f3 and UE2-f4 are moved. The result after moving is shown in FIG. 14.

[0200] For FIG. 14, the output result can be as follows:

[0201] UE1 {{period=40, offset=4, Mini-slot Offset=0, size=20}, {period=40, offset=6, Mini-slot Offset=0, size=20}, {period=40, offset=12, Mini-slot Offset=0, size=20}, {period=40, offset=14, Mini-slot Offset=0, size=20}, {period=40, offset=20, Mini-slot Offset=0, size=20}, {period=40, offset=22, Mini-slot Offset=0, size=20}, {period=40, offset=28, Mini-slot Offset=0, size=20}, {period=40, offset=30, Mini-slot Offset=0, size=20}, {period=40, offset=36, Mini-slot Offset=0, size=20}, {period=40, offset=38, Mini-slot Offset=0, size=20}}.

[0202] UE2{{period=40, offset=0, Mini-slot Offset=1, size=30}, {period=40, offset=4, Mini-slot Offset=1, size=30}, {period=40, offset=8, Mini-slot Offset=1, size=30}, {period=40, offset=14, Mini-slot Offset=1, size=30}, {period=40, offset=18, Mini-slot Offset=1, size=30}, {period=40, offset=20, Mini-slot Offset=1, size=30}, {period=40, offset=24, Mini-slot Offset=1, size=30}, {period=40, offset=28, Mini-slot Offset=1, size=30}, {period=40, offset=34, Mini-slot Offset=1, size=30}, {period=40, offset=38, Mini-slot Offset=1, size=30}}.

[0203] B6: UE configuration item merging.

[0204] There are no two cases in this example, so there is no configuration item merging:

[0205] If multiple data packets of a UE are in the same time slot, UE-level configuration item merging can be performed.

[0206] If a guarantee service flow has multiple configuration items within the scheduling period, if there is no packet-level delay or the entire delay of all data packets of the flow occurs within the scheduling window, only one configuration item can be output.

[0207] B7, scheduling non-guaranteed service flow.

[0208] After all the guarantee service flows are scheduled, the non-guaranteed service flow is inserted into the remaining time slots matching the service direction. In this example, all uplink time slots are occupied, and the non-guaranteed service flow is sent in the downlink time slot; the scheduler adds resources to the non-guaranteed service flow according to the requested resources of the non-guaranteed service flow.

[0209] B8, sending TSN gate list.

[0210] The cell-level scheduling map is sent to each TSN gate according to the UE level.

[0211] The TSN gating list of the eMBB+URLLC user of the UE1 can be as shown in FIG. 15.

[0212] The above mainly introduces the scheme provided by the embodiments of the present disclosure from the perspective of the method. In order to realize the above functions, it contains the hardware structure and / or software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is realized in the form of hardware or computer software driven hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present disclosure.

[0213] The embodiments of the present disclosure can divide the function modules of the base station according to the above-mentioned method embodiments. For example, each function module can be divided according to each function, or two or more functions can be integrated into one function module. The above-mentioned integrated module can be realized in the form of hardware or software. It should be noted that the division of the modules in the embodiments of the present disclosure is illustrative, and is only a logical function division. When actually implemented, there can be another division manner. The following will be described taking the example of dividing each function module according to each function.

[0214] FIG. 16 is a block diagram of a communication apparatus according to some embodiments of the present disclosure. As shown in FIG. 16, the communication apparatus 50 includes an acquisition unit 501 and a processing unit 502.

[0215] The communication apparatus 50 can be the above-mentioned base station or a chip of the base station. When the communication apparatus 50 is used to realize the functions of the base station in the above-mentioned embodiments, each unit is used to realize the following functions.

[0216] The acquisition unit 501 is configured to acquire service characteristics of a plurality of guaranteed service flows.

[0217] The processing unit 502 is configured to determine an arrangement result of the guaranteed service flows based on the service characteristics of the plurality of guaranteed service flows, the arrangement result of the guaranteed service flows being used to indicate scheduling time slots of the plurality of guaranteed service flows in an arrangement window, and a number of the scheduling time slots of each guaranteed service flow in a period being determined according to a delay jitter parameter in the service characteristics of the guaranteed service flow.

[0218] In some embodiments, the processing unit 502 is further configured to: for each of the plurality of guaranteed service flows, determine a reference time slot of each period in the scheduling window based on a first packet arrival time and a period in service characteristics of the guaranteed service flow; determine a windowed time domain length corresponding to the guaranteed service flow based on a delay jitter parameter of the guaranteed service flow; determine a scheduling time window of each period in the scheduling window for the guaranteed service flow based on the windowed time domain length and the reference time slot of each period in the scheduling window; the scheduling time window comprises the reference time slot and time slots adjacent to the reference time slot; take the time slots included in the scheduling time window of each period in the scheduling window for the guaranteed service flow as scheduling time slots of the guaranteed service flow; and obtain the scheduling result of the guaranteed service flow based on the scheduling time slots of the plurality of guaranteed service flows.

[0219] In some embodiments, the processing unit 502 is further configured to: determine a to-be-adjusted scheduling time slot from the scheduling time slots of the plurality of guaranteed service flows, the to-be-adjusted scheduling time slot being a scheduling time slot that does not satisfy the transmission constraint condition; determine an adjustable scheduling time slot from the to-be-adjusted scheduling time slot based on a delay margin of the to-be-adjusted scheduling time slot; adjust a time domain position of a guaranteed service flow corresponding to the adjustable scheduling time slot in the scheduling window to obtain an adjusted scheduling time slot; the delay margin of the adjusted scheduling time slot satisfies the delay requirement of the corresponding guaranteed service flow, and the adjusted scheduling time slot satisfies the transmission constraint condition; and obtain the scheduling result of the guaranteed service flow based on the adjusted scheduling time slot.

[0220] In some embodiments, the processing unit 502 is further configured to: in a case where there are a plurality of adjustable scheduling time slots, determine an adjustment order of the plurality of adjustable scheduling time slots based on a delay margin and / or a flow priority of each of the plurality of adjustable scheduling time slots; here, the flow priority of the adjustable scheduling time slot is a priority of a guaranteed service flow corresponding to the adjustable scheduling time slot; and adjust the time domain position of the guaranteed service flow corresponding to each of the plurality of adjustable scheduling time slots in the scheduling window in sequence based on the adjustment order of the plurality of adjustable scheduling time slots to obtain a plurality of adjusted scheduling time slots.

[0221] In some embodiments, the obtaining unit 501 is further configured to obtain service characteristics of the non-guaranteed service flow.

[0222] The processing unit 502 is further configured to determine a scheduling result of the non-guaranteed service flow based on the service characteristics of the non-guaranteed service flow and the scheduling result of the guaranteed service flow, the scheduling result of the non-guaranteed service flow being used to indicate a scheduling time slot of the non-guaranteed service flow in the scheduling window.

[0223] In some embodiments, the service characteristic of the non-guaranteed service flow comprises a transmission direction of the non-guaranteed service flow, and the processing unit 502 is further configured to determine the scheduling time slot of the non-guaranteed service flow in the remaining time slots in the orchestration window except for the scheduling time slots of the guaranteed service flows based on the transmission direction of the non-guaranteed service flow.

[0224] In some embodiments, the processing unit 502 is configured to: determine the scheduling time slot of the non-guaranteed service flow in a first remaining time slot based on that there is the first remaining time slot in the remaining time slots, the first remaining time slot being a time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow; or determine the scheduling time slot of the non-guaranteed service flow in a second remaining time slot based on that there is no first remaining time slot in the remaining time slots, the second remaining time slot being a time slot in the remaining time slots that is opposite to the transmission direction of the non-guaranteed service flow.

[0225] In some embodiments, the processing unit 502 is further configured to: determine a time length and a starting time of the orchestration window; and determine a position of the orchestration window on the wireless time domain resource based on the time length and the starting time of the orchestration window.

[0226] In some embodiments, the obtaining unit 501 is further configured to obtain a period of the plurality of guaranteed service flows and a frame structure period of the wireless frame.

[0227] The processing unit 502 is further configured to determine the time length of the orchestration window based on the period of the plurality of guaranteed service flows and the frame structure period of the wireless frame.

[0228] In some embodiments, the processing unit 502 is further configured to: determine a guaranteed service flow with a highest priority from the plurality of guaranteed service flows; and determine the starting time of the orchestration window based on a first packet arrival time of the guaranteed service flow with the highest priority.

[0229] In some embodiments, the orchestration result of the guaranteed service flow comprises a plurality of service configuration items, each service configuration item being used to indicate a scheduling time slot of a guaranteed service flow of a terminal in the orchestration window, and the processing unit 502 is further configured to perform merging processing on at least two service configuration items in the plurality of service configuration items that satisfy a merging condition to obtain a merged service configuration item, wherein the merging condition comprises any one of: the at least two service configuration items to be merged belong to a same guaranteed service flow, and the scheduling time slots of the guaranteed service flow in each period in the orchestration window have not undergone postponement processing; the at least two service configuration items to be merged belong to a same guaranteed service flow, and the scheduling time slots of the guaranteed service flow in each period in the orchestration window have undergone the same postponement processing; the at least two service configuration items to be merged belong to a same terminal and indicate a same time slot.

[0230] It should be noted that the units in FIG. 16 can also be referred to as modules, for example, the acquisition unit can be referred to as an acquisition module. In addition, in the embodiment shown in FIG. 16, the name of each unit can also be different from that shown in the figure, for example, the acquisition unit can also be referred to as a communication unit.

[0231] Each unit in FIG. 16, if implemented in the form of a software function module and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the disclosure or the part that contributes to the related art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor to perform all or part of the steps of the methods of various embodiments of the disclosure. The storage medium storing the computer software product includes a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0232] In the case of the above-mentioned communication device 50, the functions of the above-mentioned integrated modules are realized in the form of hardware, in the embodiments of the disclosure, FIG. 17 is a block diagram of a network device according to some embodiments of the disclosure. As shown in FIG. 17, the network device 60 includes a processor 602, a communication interface 603, and a bus 604. In some embodiments, the network device 60 can also include a memory 601.

[0233] The processor 602 can be various exemplary logical blocks, modules and circuits described in conjunction with the disclosure. The processor 602 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, transistor logic device, hardware component or any combination thereof. It can implement or execute various exemplary logical blocks, modules and circuits described in conjunction with the disclosure. The processor 602 can also be a combination of computing functions, such as a combination of one or more microprocessors, a combination of digital signal processing technology (digital signal process, DSP) chips and microprocessors, etc.

[0234] The communication interface 603 is used to connect with other devices through a communication network. The communication network can be Ethernet, wireless access network, wireless local area network (wireless local area networks, WLAN) and the like.

[0235] The memory 601 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM), or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium, or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0236] In some embodiments, the memory 601 can exist independently of the processor 602, and the memory 601 can be connected to the processor 602 through the bus 604 for storing instructions or program codes. When the processor 602 invokes and executes the instructions or program codes stored in the memory 601, the business orchestration method provided by the embodiments of the present disclosure can be implemented.

[0237] In another embodiment, the memory 601 can also be integrated with the processor 602.

[0238] The bus 604 can be an extended industry standard architecture (EISA) bus or the like. The bus 604 can be divided into an address bus, a data bus, a control bus, and the like. For the sake of convenience and brevity, only one thick line is shown in FIG. 17, but it does not mean that there is only one bus or only one type of bus.

[0239] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of functional modules is exemplified, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the base station or the terminal is divided into different functional modules to complete all or part of the above described functions.

[0240] The embodiments of the present disclosure further provide a computer readable storage medium. All or part of the processes of the above method embodiments can be instructed by computer instructions to complete by relevant hardware, and the program can be stored in the above computer readable storage medium. When the program is executed, the program can include the processes of the above method embodiments. The above computer readable storage medium can also be an external storage device of the above base station, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. In some embodiments, the above computer readable storage medium can also include an internal storage unit of the above base station and an external storage device. The above computer readable storage medium is used to store the above computer program and other programs and data required by the above base station. The above computer readable storage medium can also be used to temporarily store data that has been output or will be output.

[0241] The embodiments of the present disclosure further provide a computer program product, which contains computer instructions, when the computer instructions are run on a computer, make the computer execute any one of the service orchestration methods provided in the above embodiments.

[0242] Although the present disclosure is described herein in conjunction with various embodiments, it is understood that other variations of the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed disclosure, from an inspection of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to an advantage.

[0243] Although the present disclosure is described herein in conjunction with various embodiments, it is understood that other variations of the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed disclosure, from an inspection of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and the indefinite articles "a" or "an" do not exclude a plurality. A single processor or other unit can fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to an advantage.

[0244] The above merely describes specific embodiments of the present disclosure, but the protection scope of the present disclosure is not limited thereto, and any changes or substitutions within the technical scope disclosed by the present disclosure should be covered within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A service orchestration method, comprising: obtaining service characteristics of a plurality of guaranteed service flows; determining an orchestration result of the guaranteed service flows based on the service characteristics of the plurality of guaranteed service flows, wherein the orchestration result of the guaranteed service flows is used to indicate scheduling time slots of the plurality of guaranteed service flows within an orchestration window, and a number of scheduling time slots of each of the plurality of guaranteed service flows within a period is determined according to a time delay jitter parameter in the service characteristics of the guaranteed service flows.

2. The method of claim 1, wherein, The determining of the orchestration result of the guaranteed service flows based on the service characteristics of the plurality of guaranteed service flows comprises: for each of the plurality of guaranteed service flows, determining a reference time slot of the guaranteed service flow within each period in the orchestration window based on a first packet arrival time and a period in the service characteristics of the guaranteed service flow; determining a windowed time domain length corresponding to the guaranteed service flow based on a time delay jitter parameter of the guaranteed service flow; determining a scheduling time window of the guaranteed service flow within each period in the orchestration window based on the windowed time domain length and the reference time slot of the guaranteed service flow within each period in the orchestration window, wherein the scheduling time window comprises the reference time slot and time slots adjacent to the reference time slot; regarding time slots included in the scheduling time window of the guaranteed service flow within each period in the orchestration window as the scheduling time slots of the guaranteed service flow; obtaining the orchestration result of the guaranteed service flows based on the scheduling time slots of the plurality of guaranteed service flows.

3. The method of claim 2, wherein, The obtaining of the orchestration result of the guaranteed service flows based on the scheduling time slots of the plurality of guaranteed service flows comprises: determining a to-be-adjusted scheduling time slot from the scheduling time slots of the plurality of guaranteed service flows, the to-be-adjusted scheduling time slot being a scheduling time slot that does not satisfy a transmission constraint condition; determining an adjustable scheduling time slot from the to-be-adjusted scheduling time slot based on a time delay margin of the to-be-adjusted scheduling time slot; adjusting a time domain position of the adjustable scheduling time slot to obtain an adjusted scheduling time slot, wherein a time delay margin of the adjusted scheduling time slot satisfies a time delay requirement of a corresponding guaranteed service flow, and the adjusted scheduling time slot satisfies the transmission constraint condition; obtaining the orchestration result of the guaranteed service flows based on the adjusted scheduling time slot.

4. The method of claim 3, wherein, The adjusting of the time domain position of the adjustable scheduling time slot to obtain the adjusted scheduling time slot comprises: in a case where the adjustable scheduling time slot is a plurality of adjustable scheduling time slots, determining an adjustment order of the plurality of adjustable scheduling time slots based on time delay margins and / or flow priorities of the plurality of adjustable scheduling time slots, wherein the flow priority of the adjustable scheduling time slot is a priority of a corresponding guaranteed service flow of the adjustable scheduling time slot; sequentially adjusting the time domain positions of the plurality of adjustable scheduling time slots based on the adjustment order of the plurality of adjustable scheduling time slots to obtain a plurality of the adjusted scheduling time slots.

5. The method of claim 3, wherein, The transmission constraint condition comprises at least one of the following: a transmission direction of a time slot is the same as a transmission direction of a guaranteed service flow corresponding to the scheduling time slot. A number of terminals scheduled in a transmission time interval corresponding to the time slot is less than a preset number; Frequency domain resources occupied by users on the time slot do not exceed a frequency domain resource limit; Different types of guaranteed service flows of a same user are not supported on the time slot.

6. The method of claim 2, wherein, After the determination of the arrangement result of the guaranteed service flow, the method further includes: obtaining a service characteristic of a non-guaranteed service flow; determining an arrangement result of the non-guaranteed service flow based on the service characteristic of the non-guaranteed service flow and the arrangement result of the guaranteed service flow, the arrangement result of the non-guaranteed service flow being used to indicate a scheduling time slot of the non-guaranteed service flow in the arrangement window.

7. The method of claim 6, wherein, The service characteristic of the non-guaranteed service flow includes a transmission direction of the non-guaranteed service flow, and the determination of the arrangement result of the non-guaranteed service flow based on the service characteristic of the non-guaranteed service flow and the arrangement result of the guaranteed service flow includes: determining a scheduling time slot of the non-guaranteed service flow in a remaining time slot in the arrangement window except for the scheduling time slots of the guaranteed service flows based on the transmission direction of the non-guaranteed service flow.

8. The method of claim 7, wherein, The determination of the scheduling time slot of the non-guaranteed service flow in the remaining time slot in the arrangement window except for the scheduling time slots of the guaranteed service flows includes: determining the scheduling time slot of the non-guaranteed service flow in a first remaining time slot in the remaining time slots based on that the first remaining time slot exists in the remaining time slots, the first remaining time slot being a time slot in the remaining time slots that is the same as the transmission direction of the non-guaranteed service flow; or determining the scheduling time slot of the non-guaranteed service flow in a second remaining time slot in the remaining time slots based on that the first remaining time slot does not exist in the remaining time slots, the second remaining time slot being a time slot in the remaining time slots that is opposite to the transmission direction of the non-guaranteed service flow.

9. The method of claim 6, wherein, Each time slot in the arrangement window has a reserved time domain resource, and the reserved time domain resource is used for scheduling transmission of a target service flow, the target service flow being a service flow in the plurality of guaranteed service flows and the non-guaranteed service flow that meets a preset requirement in terms of delay requirement.

10. The method of claim 1, further comprising: determining a time length and a starting time of the arrangement window; determining a position of the arrangement window on a wireless time domain resource based on the time length and the starting time of the arrangement window.

11. The method of claim 10, wherein, The determination of the time length of the arrangement window includes: obtaining a period of the plurality of guaranteed service flows and a frame structure period of a wireless frame; determining the time length of the arrangement window based on the period of the plurality of guaranteed service flows and the frame structure period of the wireless frame.

12. The method of claim 1, wherein, The arrangement result of the guaranteed service flow includes a plurality of service configuration items, each service configuration item being used to indicate a scheduling time slot of one guaranteed service flow of one terminal in the arrangement window, and the method further includes: merging at least two service configuration items in the plurality of service configuration items that meet a merging condition to obtain a merged service configuration item; The merging condition includes any one of the following: The at least two service configuration items to be merged belong to a same guaranteed service flow, and scheduling time slots of the guaranteed service flow in each period in the arrangement window have not been subjected to postponement processing. The at least two service configuration items to be merged belong to the same guarantee service flow, and the scheduling time slots of each period of the guarantee service flow in the arrangement window undergo the same postponement processing; The at least two service configuration items to be merged belong to the same terminal and indicate the same time slot.

13. A network device comprising: a processor and a memory for storing instructions executable by the processor; wherein the processor is configured to execute the instructions such that the network device performs the method according to any one of claims 1-12.

14. A computer readable storage medium, wherein, The computer readable storage medium has stored thereon computer instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1-12.

15. A computer program product, wherein, The computer program product contains computer instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1-12.

Images