Service orchestration method and device, storage medium and program product

Abstract

The embodiment of the invention provides a service orchestration method and device, a storage medium and a program product, relates to the technical field of communication, and is used for reducing end-to-end time delay for guaranteeing a service flow. The method comprises the following steps: acquiring service characteristics of a plurality of guarantee service flows; based on the service features of the plurality of guarantee service flows, determining an arrangement result of the guarantee service flows, the arrangement result of the guarantee service flows being used for indicating scheduling time slots of the plurality of guarantee service flows in the arrangement window, the number of the scheduling time slots of each guarantee service flow in one period is determined according to the delay jitter parameter in the service characteristics of the guarantee service flow.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of communication, and particularly relates to a service arrangement method and device, a storage medium and a program product. BACKGROUND

[0002] In the fifth generation mobile networks (5G) industrial internet, there are two mechanisms for how to coordinate the service layer and the wireless layer. 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. However, the second method still has room for improvement in reducing the end-to-end delay of guaranteeing service flow in the industrial internet scenario. SUMMARY

[0003] Embodiments of the present disclosure provide a service arrangement method, device, storage medium and program product, which are used to reduce the end-to-end delay of guaranteeing service flow.

[0004] In order to achieve the above purpose, the technical scheme is adopted as follows.

[0005] In a first aspect, a service arrangement method is provided, and the method comprises:

[0006] obtaining service characteristics of a plurality of guarantee service flows;

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

[0008] In a second aspect, a communication device is provided, and the device comprises:

[0009] an obtaining unit, configured to obtain service characteristics of a plurality of guarantee service flows;

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

[0011] In a third aspect, a network device is provided, comprising a processor and a memory; the memory and the processor are coupled; the memory is configured to store instructions executable by the processor, the memory stores the 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.

[0012] In a fourth aspect, a computer readable storage medium is provided, which stores computer instructions, and when the computer instructions are executed on a computer, the computer executes the method provided in the first aspect.

[0013] In a fifth aspect, a computer program product containing computer instructions is provided, and when the computer instructions are executed on a computer, the computer executes the method provided in the first aspect.

[0014] In the embodiments of the present disclosure, the number of scheduling time slots of each guarantee service flow in a cycle of the scheduling window is determined according to the time delay jitter parameter in the service characteristics of the guarantee service flow, that is, when determining the scheduling time slots of each guarantee service flow in a cycle of the scheduling window, the time delay jitter parameter in the service characteristics of the guarantee service flow is considered. It should be understood that in the related art, the number of scheduling time slots of the guarantee service flow in a cycle of the scheduling window is 1, while in the present disclosure, the number of scheduling time slots of the guarantee service flow in a cycle of the scheduling 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 cycle of the scheduling 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 and go, without waiting for the next scheduling cycle, thereby reducing the end-to-end delay of the guarantee service flow and reducing the time delay jitter. BRIEF DESCRIPTION OF DRAWINGS

[0015] The accompanying drawings are used to provide a further understanding of the technical solutions of the present application, and 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 application, and do not constitute a limitation on the technical solutions of the present application.

[0016] Figure 1 A structural schematic diagram of a communication system is provided for the embodiments of the present disclosure;

[0017] Figure 2 A flowchart of a service scheduling method is provided for the embodiments of the present disclosure;

[0018] Figure 3 A flowchart of another service scheduling method is provided for the embodiments of the present disclosure;

[0019] Figure 4A flowchart illustrating another service orchestration method provided in this embodiment of the disclosure;

[0020] Figure 5 A flowchart illustrating another service orchestration method provided in this embodiment of the disclosure;

[0021] Figure 6 A schematic diagram of a system architecture provided for an embodiment of this disclosure;

[0022] Figure 7 A schematic diagram of service orchestration provided for an embodiment of this disclosure;

[0023] Figure 8 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0024] Figure 9 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0025] Figure 10 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0026] Figure 11 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0027] Figure 12 This is a schematic diagram of a TSN gated list provided in an embodiment of the present disclosure;

[0028] Figure 13 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0029] Figure 14 This is another service orchestration diagram provided as an embodiment of the present disclosure;

[0030] Figure 15 This is a schematic diagram of another TSN gating list provided in an embodiment of this disclosure;

[0031] Figure 16 This is a schematic diagram of the composition of a communication device provided in an embodiment of the present disclosure;

[0032] Figure 17 This is a schematic diagram of the structure of a network device provided in an embodiment of this disclosure. Detailed Implementation

[0033] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this 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" and "second" 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. Thus, a feature defined as "first" or "second" 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 "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" 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 "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[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] As described above, the second method uses TSN gating to improve packet sending on the service side, enabling packet sending and scheduling to work together. However, the second method does not currently take into account end-to-end jitter, and there is still room for improvement in reducing end-to-end latency and latency jitter in industrial internet scenarios to ensure service flow.

[0039] Based on this, embodiments of this disclosure provide a service orchestration method, device, storage medium, and program product. When determining the scheduling slots for each guaranteed service flow within one cycle of the orchestration window, the delay jitter parameter in the service characteristics of the guaranteed service flow is taken into account, that is, the end-to-end jitter is considered. It should be understood that in related technologies, the number of scheduling slots for a guaranteed service flow within one cycle of the orchestration window is 1, while in this disclosure, the number of scheduling slots for a guaranteed service flow within one cycle of the orchestration window is determined based on the delay jitter parameter in the service characteristics of the guaranteed service flow. That is, based on the delay jitter of the guaranteed service flow, the number of scheduling slots for the guaranteed service flow within one cycle of the orchestration window can be increased, i.e., "windowing" is implemented, thereby increasing the scheduling opportunities for data packets of the guaranteed service flow within the delay jitter range of the guaranteed service flow. In this way, data packets of the guaranteed service flow are more easily scheduled without waiting for the next scheduling cycle, thereby reducing the end-to-end latency of the guaranteed service flow and reducing delay jitter.

[0040] The embodiments of this disclosure will now be described in detail with reference to the accompanying drawings.

[0041] The technical solutions provided in this disclosure can be applied to various communication systems that support TSN, such as new radio (NR) communication systems using 5G communication technology.

[0042] The present disclosure does not limit the scope to future evolution systems, long term evolution (LTE), or multiple communication convergence systems.

[0043] Figure 1 The diagram shown is a structural schematic of a communication system provided in an embodiment of this disclosure. Figure 1 As shown, the communication system includes, but is not limited to, base station 110 and terminal 120. Base station 110 and terminal 120 can transmit and receive wireless signals and perform related interactions.

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

[0045] In some embodiments, base station 110 is used to provide wireless access services to terminal 120. Specifically, each base station 110 provides a service coverage area (also known as a cellular area). Terminal 120 entering this area can communicate with the base station via wireless signals to receive the wireless access services provided by base station 110. The service coverage areas of base stations 110 may overlap, and terminal 120 in the overlapping area can receive wireless signals from multiple base stations 110.

[0046] In this disclosure, base station 110 can be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTEA), or an evolved Node B (eNB or eNodeB), a base station device in a 5G network, or a base station in a future communication system (such as 6G). The base station can include various macro base stations, micro base stations, home base stations, wireless remotes, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or various network-side devices such as primary cells and secondary cells.

[0047] In this disclosure, terminal 120 is a device with wireless transceiver capabilities, which can be deployed on land, including indoors or outdoors; it can also be deployed on water (such as on ships); and it can also be deployed in the air (such as on airplanes, balloons, and satellites). The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. The embodiments of this disclosure do not limit the application scenarios. A terminal may also be referred to as a user, user equipment, access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE terminal, wireless communication device, UE agent, or UE device, etc. The embodiments of this disclosure are not limited to these.

[0048] It should be understood that Figure 1 This is an exemplary structural diagram, such as... Figure 1 The number of devices included in the illustrated communication system is unlimited; for example, the number of base stations and terminals is unlimited. Furthermore, except... Figure 1 In addition to the equipment shown, Figure 1 The communication system shown may also include other devices, which are not limited thereto.

[0049] Next, Figure 2 This is a flowchart illustrating a service orchestration method provided in an embodiment of the present disclosure, such as... Figure 2 As shown, this disclosure provides a service orchestration method, which is applied to a base station, and the base station can be one of the above-described methods. Figure 1 The base station 110 shown is an example. This method can be applied to the computing power board of the base station, and the method can include the following steps:

[0050] S101. Obtain the business characteristics of multiple guarantee business flows.

[0051] Among them, guaranteed service flows are those with requirements for latency and bandwidth. Guaranteed service flows enjoy specific resource guarantees within the network; that is, the network will ensure that a predetermined bit rate is provided to the guaranteed service flow within an average time window. In addition to the predetermined bit rate, guaranteed service flows may also include parameters such as the maximum flow bit rate (MFBR) to limit the maximum bit rate of the guaranteed service flow under specific conditions. Guaranteed service flows are typically used in applications with strict requirements for latency and bandwidth, such as voice calls and video conferencing.

[0052] In some embodiments, multiple guaranteed service flows belong to the same cell; that is, obtaining the service characteristics of multiple guaranteed service flows can be done by obtaining the service characteristics of multiple guaranteed service flows under the same cell. The service characteristics of a guaranteed service flow include at least one of the following: period, packet size, packet arrival time, and latency jitter parameter. Here, period refers to the data packet period, packet size refers to the data packet size, packet arrival time refers to the data packet arrival time, and the latency jitter parameter of the guaranteed service flow can be the latency jitter amplitude of the guaranteed service flow.

[0053] In some embodiments, business features may have other names, such as business models, which are not limited in this disclosure.

[0054] S102. Based on the business characteristics of multiple assurance business flows, determine the orchestration result of the assurance business flows.

[0055] In some embodiments, after acquiring the service characteristics of multiple guaranteed service flows, the base station can perform service orchestration on the multiple guaranteed service flows within a orchestration window based on the service characteristics of the multiple guaranteed service flows, thereby obtaining the orchestration result of the guaranteed service flows. The orchestration result of the guaranteed service flows is used to indicate the scheduling time slots of the multiple guaranteed service flows within the orchestration window. The number of scheduling time slots for each guaranteed service flow within one period of the orchestration window is determined based on the delay jitter parameter in the service characteristics of that guaranteed service flow.

[0056] For details on how the layout window is determined, please refer to the following: Figure 5 The corresponding descriptions in the illustrated embodiments are not repeated here, wherein, Figure 5 A flowchart illustrating another service orchestration method provided in this embodiment of the disclosure.

[0057] As an example, determining the orchestration result of assurance service flows based on the business characteristics of multiple assurance service flows may include the following steps:

[0058] S1. For each of the multiple support service flows, determine the base time slot for each period of the support service flow within the orchestration window based on the arrival time and period of the first packet in the service characteristics of the support service flow.

[0059] It should be noted that, considering the jitter and clock synchronization issues across the entire link from terminal to base station to core network to application, the orchestration results of the guaranteed service flow may deviate from the actual situation. Therefore, the arrival time of the packets in the orchestrated guaranteed service flow is protected by adding scheduling opportunities before and after the arrival time. That is, the same service characteristics are added before and after the arrival time of the packets based on the service characteristics of the guaranteed service flow, which is to achieve windowing protection.

[0060] In some embodiments, multiple backup service flows are arranged in the time domain according to their priority and first packet arrival time (SFN & slot offset). For example, the backup service flows are arranged in the time domain according to their priority from high to low, based on their first packet arrival time. Then, for each backup service flow, the reference time slot for each period within the orchestration window is determined based on the first packet arrival time and period in the service characteristics of the backup service flow.

[0061] As a possible example, the arrival time of the first packet of the guaranteed service flow in one cycle is used as the base time slot for the guaranteed service flow within one cycle of the orchestration window. Then, based on the cycle in the service characteristics of the guaranteed service flow, the base time slots for other cycles of the guaranteed service flow within the orchestration window are marked in a forward direction according to the cycle until the upper limit of the orchestration window is exceeded. Then, the base time slots for other cycles of the guaranteed service flow within the orchestration window are marked in a reverse direction according to the cycle until the lower limit of the orchestration window is exceeded. In this way, the base time slots for the guaranteed service flow in each cycle within the orchestration window are obtained.

[0062] S2. Based on the latency jitter parameters of the guaranteed service flow, determine the windowing time domain length corresponding to the guaranteed service flow.

[0063] As a possible example, the windowing time domain length corresponding to the guaranteed service flow is determined based on the latency jitter parameters and time slot length of the guaranteed service flow.

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

[0065] In some embodiments, the time slot length is the time slot length of the frame structure of radio frames that match multiple guaranteed service flows. The frame structures of the radio frames include DS frame structures, 2.5ms single-frame structures, and 2.5ms dual-frame structures. Each radio frame structure includes uplink time slots and downlink time slots. The DS frame structure consists of one downlink time slot and one uplink time slot.

[0066] In some embodiments, matching time slots within an orchestration window are used for protective scheduling. Each expanded window is added to the service feature list of each protected service flow as a new service feature, for use in pre-allocating resources during scheduling.

[0067] S3. Based on the windowing time domain length and the reference time slots for ensuring the service flow in each cycle within the orchestration window, determine the scheduling time window for ensuring the service flow in each cycle within the orchestration window.

[0068] The scheduling time window includes a base time slot and a time slot adjacent to the base time slot. For example, the scheduling time window for the service flow within one cycle of the orchestration window is obtained by increasing the windowed time domain length both forward and backward from the base time slot. In other words, the scheduling time window for the service flow within one cycle of the orchestration window is obtained by expanding the windowed time domain length before and after the base time slot.

[0069] S4. The time slots included in the scheduling window of each cycle of the guaranteed service flow within the orchestration window shall be used as the scheduling time slots of the guaranteed service flow.

[0070] For example, assuming that the base time slot of a guarantee service flow in one cycle within the orchestration window is the third time slot, and the windowed time domain length is two time slots, then the scheduling time window of the guarantee service flow in one cycle within the orchestration window is the first to fifth time slots of that cycle. Therefore, the first to fifth time slots of the guarantee service flow in one cycle within the orchestration window can be used as the scheduling time slots of the guarantee service flow.

[0071] Thus, by performing the above S1-S4 processing on each of the multiple support service flows, the scheduling time slots of each of the multiple support service flows can be obtained.

[0072] S5. Based on the scheduling time slots of each of the multiple guarantee service flows, the orchestration result of the guarantee service flows is obtained.

[0073] After obtaining the scheduling slots of each of the multiple guarantee service flows, the scheduling slots of each of the multiple guarantee service flows can be arranged into the orchestration window to obtain the orchestration result of the guarantee service flows.

[0074] based on Figure 2 The illustrated embodiment considers the latency jitter parameter in the service characteristics of the guaranteed service flow when determining the scheduling slots for each guaranteed service flow within one cycle of the orchestration window; that is, it considers the end-to-end jitter. It should be understood that in related technologies, the number of scheduling slots for a guaranteed service flow within one cycle of the orchestration window is one. However, in this disclosure, the number of scheduling slots for a guaranteed service flow within one cycle of the orchestration window is determined based on the latency jitter parameter in the service characteristics of the guaranteed service flow. In other words, based on the latency jitter of the guaranteed service flow, the number of scheduling slots for the guaranteed service flow within one cycle of the orchestration window can be increased, i.e., "windowing" is implemented. This increases the scheduling opportunities for data packets of the guaranteed service flow within the latency jitter range of the guaranteed service flow. Thus, data packets of the guaranteed service flow are more easily scheduled without waiting for the next scheduling cycle, thereby reducing the end-to-end latency of the guaranteed service flow and reducing latency jitter.

[0075] In some embodiments, to improve the availability of the orchestration results for ensuring service flows, step S5 above may include the following steps:

[0076] S51. Determine the scheduling slots to be adjusted from the scheduling slots of each of the multiple service flows.

[0077] Among them, the scheduling time slots to be adjusted are those scheduling time slots that do not meet the transmission constraints.

[0078] Transmission constraints include at least one of the following:

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

[0080] The number of terminals scheduled within the transmission time interval corresponding to the time slot is less than the preset number;

[0081] The frequency domain resources occupied by users in a time slot shall not exceed the frequency domain resource limit;

[0082] The time slot does not support different types of protection service flows that carry the same user.

[0083] It should be noted that the aforementioned time slots refer to the time slots of the frame structure of radio frames that match multiple guaranteed service flows. Taking the frame structure of a radio frame as an example, the DS frame structure consists of interleaved uplink time slots and downlink time slots. Assuming that a time slot is an uplink time slot, that is, the transmission direction of the time slot is uplink, if the transmission direction of the guaranteed service flow corresponding to the scheduling time slot of the time slot is downlink, then it means that the scheduling time slot is a scheduling time slot to be adjusted.

[0084] The aforementioned transmission time interval (TTI) can be a transmission time interval. The number of terminals scheduled within the transmission time interval corresponding to the time slot is related to the scheduling capability of the base station's physical cell. The preset number can be related to the cell's scheduling capability.

[0085] The aforementioned frequency domain resources can refer to air interface frequency domain resources. The inability to support different types of guaranteed service flows for the same user in a time slot means that when the same user simultaneously has enhanced mobile broadband (eMBB) service flows and ultra-reliable low-latency communications (URLLC) service flows, the two guaranteed service flows cannot be in the same time slot.

[0086] S52. Based on the delay margin of the scheduling time slots to be adjusted, determine the adjustable scheduling time slots from the scheduling time slots to be adjusted.

[0087] The delay margin of the scheduling time slot to be adjusted is the delay margin of the guaranteed service flow corresponding to the scheduling time slot to be adjusted, and the delay margin of the guaranteed service flow is the difference between the target delay and the measured delay of the guaranteed service flow.

[0088] As a possible example, scheduling slots with a delay margin greater than a threshold are considered adjustable scheduling slots. For example, if the threshold is 0, then scheduling slots with a delay margin greater than 0 are considered adjustable scheduling slots.

[0089] S53. Adjust the time domain position of the adjustable scheduling time slot to obtain the adjusted scheduling time slot.

[0090] The adjusted scheduling time slots have sufficient delay margin to meet the delay requirements of the corresponding guaranteed service flow, and the adjusted scheduling time slots also meet the aforementioned transmission constraints.

[0091] As a possible example, adjusting the time-domain position of adjustable scheduling time slots to obtain adjusted scheduling time slots includes: when there are multiple adjustable scheduling time slots, determining the adjustment order of the multiple adjustable scheduling time slots based on their respective delay margins and / or flow priorities; wherein, the flow priority of the adjustable scheduling time slot is the priority of the guaranteed service flow corresponding to the adjustable scheduling time slot; then, based on the adjustment order of the multiple adjustable scheduling time slots, sequentially adjusting the time-domain position of the multiple adjustable scheduling time slots to obtain multiple adjusted scheduling time slots.

[0092] For example, after determining the adjustable scheduling time slots, the adjustable scheduling time slots can be arranged according to preset rules, such as the rule of delay margin from large to small, to obtain the adjustment order. Then, based on the adjustment order, the time domain positions of each adjustable scheduling time slot are moved backward sequentially from front to back, and the movement backward does not exceed the range of delay margin, the transmission direction of the time slot is the same as the transmission direction of the guaranteed service flow corresponding to the scheduling time slot, and does not exceed the TTI scheduling capacity limit and frequency domain resource limit of the nearest time slot, until no time slot that meets the above transmission constraints is available, and the adjusted scheduling time slot is obtained.

[0093] It should be understood that if a scheduling time slot does not meet the transmission constraints, then that time slot is unavailable in the orchestration result of the guaranteed service flow. Each TSN gate cannot correctly send and receive data packets in that scheduling time slot according to the orchestration result of the guaranteed service flow. Therefore, adjusting the time domain position of the adjustable scheduling time slot can enable the adjusted scheduling time slot to meet the transmission constraints and improve the availability of the orchestration result of the guaranteed service flow.

[0094] It should be noted that when there are adjustable scheduling slots with the same delay margin, they can be arranged according to their priority.

[0095] In some embodiments, for non-adjustable scheduling time slots in the scheduling time slots to be adjusted, the non-adjustable scheduling time slots can be deleted from the orchestration results of the guaranteed service flow. If the adjustable scheduling time slots still do not meet the above transmission constraints after adjustment, the adjustable scheduling time slots can be deleted from the orchestration results of the guaranteed service flow.

[0096] For example, assume that the adjustable scheduling time slots include a first scheduling time slot and a second scheduling time slot, and the transmission direction of the guaranteed service flow corresponding to the first scheduling time slot and the second scheduling time slot is the uplink transmission direction. The frame structure matching the guaranteed service flow is a DS frame structure, for example, a frame structure of 01010101, where 0 represents an uplink time slot and 1 represents a downlink time slot. The initial time slot corresponding to the current first scheduling time 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 time slot is the fourth time slot (i.e., the second 1) in the above frame structure.

[0097] Assuming the delay margin for the guaranteed service flow corresponding to the first scheduling time slot is 2, and the delay margin for the guaranteed service flow corresponding to the second scheduling time slot is 3, the adjustment order is to adjust the second scheduling time slot first, then the first scheduling time slot. First, the time domain position of the second adjustment time slot is moved backward, which can be moved to the fifth time slot (i.e., the third 0) in the above frame structure. The moving distance does not exceed the delay margin of the second scheduling time slot, thus determining that the adjusted time slot of the second adjustment time slot is the fifth time slot. Then, the time domain position of the first adjustment time slot is moved backward, which can be moved to the seventh time slot (i.e., the fifth 0) in the above frame structure. However, the moving distance exceeds the delay margin of 2 for the guaranteed service flow corresponding to the first scheduling time slot, indicating that the first adjustment time slot cannot be adjusted and can be deleted from the orchestration result of the guaranteed service flow.

[0098] S54. Based on the adjusted scheduling time slots, the orchestration results for ensuring service flow are obtained.

[0099] It should be understood that adjusting the time domain position of the adjustable scheduling time slots refers to adjusting the time domain position of the guaranteed service flow within the orchestration window corresponding to the adjustable scheduling time slots. After obtaining the adjusted scheduling time slots, the orchestration result of the guaranteed service flow can be obtained based on the unadjusted scheduling time slots and the adjusted scheduling time slots within the orchestration window.

[0100] Thus, through the processing of steps S51-S54 above, an orchestration result with higher availability for guaranteed service flows can be obtained.

[0101] In some embodiments, the orchestration result of a guaranteed service flow includes multiple service configuration items. These service configuration items indicate a scheduling slot within an orchestration window for a guaranteed service flow of a terminal. It should be understood that due to terminal capabilities and device limitations, the number of configuration items cannot exceed these limits. Furthermore, reducing the number of configuration items can reduce the size of transmitted messages. Based on this, such as... Figure 3 The diagram shown is a flowchart of another service orchestration method provided in this embodiment of the present disclosure. After step S102, the method may further include the following steps:

[0102] S201. Merge at least two business configuration items that meet the merging conditions from multiple business configuration items to obtain merged business configuration items.

[0103] The merger conditions include any of the following:

[0104] Condition 1: At least two business configuration items being merged belong to the same guaranteed business flow, and the scheduling slots of the guaranteed business flow in each cycle within the orchestration window have not been extended.

[0105] Condition 2: At least two business configuration items that are merged belong to the same guaranteed business flow, and the scheduling slots of the guaranteed business flow in each cycle within the orchestration window undergo the same delay process.

[0106] Condition 3: At least two service configuration items being merged belong to the same terminal and indicate the same time slot.

[0107] It should be understood that for conditions 1 and 2 above, that is, if a guaranteed service flow has multiple configuration items in each period, only one configuration item can be output if there is no single data packet delay or if all data packets in the guaranteed service flow experience an overall delay within the orchestration window. For condition 3 above, that is, if multiple guaranteed service flows of a terminal are in the same time slot, UE-level configuration item merging can be performed.

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

[0109] In some embodiments, after obtaining the orchestration results of the guaranteed service flow, the base station can divide the orchestration results of the guaranteed service flow according to the terminal level to obtain the orchestration results of the guaranteed service flow corresponding to each terminal, and then send the orchestration results of the guaranteed service flow corresponding to each terminal to each TSN gate so that each TSN gate can send and receive data packets based on the orchestration results of the guaranteed service flow. At the same time, the base station converts the air interface time into system time.

[0110] In some embodiments, the base station may also send the orchestration results of the guaranteed service flow to the base station scheduler.

[0111] The above embodiments are illustrated using service orchestration of guaranteed service flows as an example. In some embodiments, when both guaranteed and non-guaranteed service flows exist, reducing the end-to-end latency and latency jitter of the guaranteed service flows is a pressing issue. Therefore, as follows... Figure 4 The diagram shown is a flowchart of another service orchestration method provided in this embodiment of the present disclosure. After step S102, the method may include the following steps:

[0112] S301. Obtain the business characteristics of non-guaranteed business flows.

[0113] It should be understood that although the orchestration is for guaranteed service flows, the sending and scheduling of non-guaranteed service flows also need to be considered. For example, if there are non-periodic control messages in the non-guaranteed service flows, the non-periodic control messages also need to have the opportunity to be sent and scheduled, otherwise it will affect the operation of the system and the scheduling of guaranteed service flows.

[0114] In some embodiments, after orchestrating the guaranteed service flow, the service characteristics of the non-guaranteed service flow can be obtained, and then the non-guaranteed service flow can be orchestrated. The non-guaranteed service flow can be the 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 will not be repeated here.

[0115] S302. Based on the business characteristics of non-guaranteed business flows and the orchestration results of guaranteed business flows, determine the orchestration results of non-guaranteed business flows.

[0116] The orchestration results of non-guaranteed service flows are used to indicate the scheduling slots of non-guaranteed service flows within the orchestration window. That is, based on the service characteristics of non-guaranteed service flows and the orchestration results of guaranteed service flows, the scheduling slots of non-guaranteed service flows within the orchestration window are determined, and the orchestration results of non-guaranteed service flows are obtained.

[0117] As an example, the service characteristics of a non-guaranteed service flow include the transmission direction of the non-guaranteed service flow. Based on the transmission direction of the non-guaranteed service flow, the scheduling slot of the non-guaranteed service flow is determined from the remaining slots in the orchestration window, excluding the scheduling slots of the guaranteed service flow.

[0118] As one possible example, based on the existence of a first remaining time slot, the scheduling time slot for non-guaranteed service flows is determined within the first remaining time slot, where the first remaining time slot is the time slot with the same transmission direction as the non-guaranteed service flow. Alternatively, based on the absence of a first remaining time slot, the scheduling time slot for non-guaranteed service flows is determined within a second remaining time slot, where the second remaining time slot is the time slot with the opposite transmission direction to the non-guaranteed service flow. In other words, if a time slot with the same transmission direction as the non-guaranteed service flow exists in the remaining time slots, the non-guaranteed service flow is scheduled to that time slot. If no time slot with the same transmission direction exists in the remaining time slots, to ensure the transmission of some random control messages, the non-guaranteed service flow is scheduled to the time slot with the opposite transmission direction, that is, the non-guaranteed service flow is transmitted in the time slot with the opposite service direction. In other words, the system time corresponding to this opposite time slot is gated.

[0119] Thus, when both guaranteed and non-guaranteed business flows exist, the orchestration result of the non-guaranteed business flows is determined based on the business characteristics of the non-guaranteed business flows and the orchestration result of the guaranteed business flows. That is, after orchestrating the guaranteed business flows, the non-guaranteed business flows are orchestrated, with the guaranteed business flows being orchestrated first. This reduces the end-to-end latency and latency jitter of the guaranteed business flows when both guaranteed and non-guaranteed business flows exist.

[0120] In some embodiments, after obtaining the orchestration results for guaranteed service flows and non-guaranteed service flows, air interface configuration checks and TSN configuration checks are performed. If the limits are exceeded, service flows participating in the orchestration are deleted from low to high priority. The limit may refer to a limit of 64 TSNs in the list.

[0121] It should be noted that, Figure 4 The illustrated embodiment is an improvement made at the sending end. On the scheduler side, since the deterministic service scheduler pre-allocates resources based on the orchestration results, but since there are also random non-guaranteed service flows that may preempt resources pre-allocated to guaranteed service flows, the scheduler can reallocate new resources based on the amount of data reported in the scheduling requests initiated by the non-guaranteed service flows, instead of occupying reserved resources. That is, the newly requested resources and the reserved resources need to be summed. In this way, when both guaranteed and non-guaranteed service flows exist, taking both guaranteed and non-guaranteed service flows into account, the reserved resources of guaranteed service flows will not be occupied by non-guaranteed service flows, which helps to reduce the end-to-end latency of guaranteed service flows and reduce latency jitter.

[0122] In some embodiments, each time slot within the orchestration window has reserved time domain resources. These reserved time domain resources are used for the scheduling and transmission of the target service flow, which is a service flow among multiple guaranteed and non-guaranteed service flows whose latency requirements meet preset requirements. The reservation of time domain resources in each time slot within the orchestration window can be understood as performing long-connection scheduling for the target service flow; that is, the windowed time domain length of the target service flow covers the entire orchestration window. The extended scheduling time slots can be added to the service characteristics of the target service flow and used together with the actual service characteristics for resource pre-allocation.

[0123] As an example, business flows that meet the preset requirements include monitoring or alarm business flows within the assurance business flows, and non-periodic alarm business flows within the non-assurance business flows. Taking non-periodic alarm business flows, such as alarm reporting data from safety devices, as an example, this type of data is related to safe production and requires orchestration and resource reservation. Since non-periodic alarm business flows are treated as short-cycle, low-data-volume flows, resources are reserved in each time slot within the orchestration window—that is, new business configuration items are added—to ensure that this type of business flow is scheduled in a timely manner, thus avoiding sudden increases in latency during industrial business operations.

[0124] In some embodiments, after obtaining the orchestration results of non-guaranteed service flows, the base station can send the orchestration results of non-guaranteed service flows to each TSN gate according to each terminal level, so that each TSN gate can send and receive data packets based on the orchestration results of non-guaranteed service flows. At the same time, the base station converts the air interface time into system time.

[0125] In some embodiments, the base station may also send the orchestration results of non-guaranteed service flows to the base station scheduler.

[0126] In some embodiments, before orchestrating multiple assurance service flows, it is necessary to determine the duration and start time of the orchestration window so that multiple assurance service flows can be placed within the orchestration window. Based on this, as... Figure 5 The diagram shown is a flowchart of another service orchestration method provided in this embodiment of the present disclosure. The method may further include the following steps:

[0127] S401. Determine the duration and start time of the arrangement window.

[0128] As an example, determining the duration of the orchestration window includes:

[0129] Obtain the periods of multiple guaranteed service flows and the frame structure periods of radio frames. Based on the periods of multiple guaranteed service flows and the frame structure periods of radio frames, determine the duration of the orchestration window.

[0130] The period for obtaining multiple safeguard service flows can be obtained from the service characteristics of multiple safeguard service flows, and the radio frame is a radio frame that matches the multiple safeguard service flows, such as a DS frame.

[0131] The duration of the orchestration window can be determined based on the periods of multiple service flows and the frame structure period of the radio frame. This can be achieved by using the least common multiple of the periods of multiple service flows and the frame structure period of the radio frame as the duration of the orchestration window.

[0132] It should be noted that the duration of the orchestration window must not exceed the TSN gating hardware time limit. If it does, the least common multiple M is calculated starting from the highest priority guaranteed service flow. When the priorities are the same, the guaranteed service flow whose frame structure period is an integer multiple of the radio frame is selected first. Finally, the least common multiple is guaranteed to be less than or equal to the TSN gating hardware time limit, that is, the duration of the orchestration window is less than or equal to the TSN gating hardware time limit.

[0133] After determining the duration of the orchestration window, in order to ensure that multiple support service flows are orchestrated within the orchestration window, it is necessary to determine the base time of multiple support service flows before orchestrating them, that is, to determine the start time of the orchestration window.

[0134] As an example, determining the start time of the orchestration window includes:

[0135] The highest priority assurance service flow is determined from the multiple assurance service flows; the start time of the orchestration window is determined based on the arrival time of the first packet of the highest priority assurance service flow.

[0136] As a possible example, the arrival time of the first packet of the highest priority guaranteed service flow can be used as the start time of the orchestration window.

[0137] In some embodiments, when determining the start time of the orchestration window based on the arrival time of the first packet of the highest priority guaranteed service flow, 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).

[0138] In some embodiments, when the highest priority guaranteed service flows include eMBB and URLLC service flows, and the eMBB and URLLC service flows belong to the same user, the start time of the orchestration window is based on the arrival time of the first packet of the eMBB service flow due to the minimum granularity difference in frame structure between the eMBB and URLLC service flows. It should be understood that because the time granularity of the URLLC service flow is small (it is a minislot), if the base time of the URLLC (i.e., the arrival time of the first packet) is used as the base, the eMBB service flow cannot be aligned to the start of a certain slot.

[0139] In some embodiments, after obtaining the start time of the orchestration window, the start time of the orchestration window can be sent to the TSN gating and scheduler. It should be noted that, considering system latency, the start time of the orchestration window sent to the TSN gating and scheduler must be a future time; otherwise, it will cause extremely high latency. The future time is obtained by shifting the start time of the orchestration window backward according to a multiple of the service cycle.

[0140] S402. Based on the duration and start time of the orchestration window, determine the position of the orchestration window on the wireless time domain resources.

[0141] After obtaining the duration and start time of the orchestration window, the position of the orchestration window on the radio time domain resources can be determined. Then, based on the position of the orchestration window on the radio time domain resources, multiple guarantee service flows can be orchestrated so that multiple guarantee service flows can be placed within the orchestration window.

[0142] In some embodiments, a service orchestration method provided in this disclosure is applied to an industrial internet (ToB) scenario to achieve cross-layer orchestration between the service layer and the wireless layer.

[0143] The above embodiments are illustrated using an example of a service orchestration method provided in this disclosure applied to a base station's computing power board. Figure 6 The diagram shown is a schematic representation of a system architecture provided in an embodiment of this disclosure. See also... Figure 6 The system includes module A, module B, module C, module D and a base station.

[0144] Module A is a cross-layer orchestration module, which is used to orchestrate service flows according to radio resources based on the service characteristics and air interface scheduling frame structure. The orchestration results of Module A are simultaneously sent to Module D and the base station.

[0145] Module B is the business feature learning module. Business flow features mainly refer to: {packet size, packet period, packet arrival time}; business features can also be obtained from fixed configurations.

[0146] Module C is a latency measurement module used to measure end-to-end latency at the user level or service flow level.

[0147] Module D is a TSN gating module, used to manage the QBV gating of the device-side TSN translator (DS-TT) of all access users, so that each user's gating sends data packets according to the scheduled time points.

[0148] The base station is used to provide radio information to module A, including cell information, scheduling information, and time information.

[0149] Modules A, B, C, and D are all logical modules that can be built into the base station, located on a computing power board within the base station; alternatively, they can be externally mounted as independent devices. The service orchestration method provided in this embodiment can be applied to module A.

[0150] The following examples illustrate a service orchestration method provided in this disclosure.

[0151] Example 1: Taking an eMBB user initiating an uplink service using the DS frame structure as an example, the steps may include the following:

[0152] A1. Determine the length of the arrangement window.

[0153] Figure 7 The diagram shown is a service orchestration illustration provided in an embodiment of this disclosure. See also... Figure 7 Assuming there are 4 guaranteed service flows UE1-f2, UE2-f2, UE1-f1, and UE2-f1, and the least common multiple of the service cycles of the 4 guaranteed service flows is 20ms, and each time slot is 0.5ms, then the length of the orchestration window is 40 slots.

[0154] It should be noted that, Figure 7 and the following Figure 8-15 The parameters shown are merely logical examples and have no practical reference value; they will not be elaborated upon further below.

[0155] A2. Determine the start time of the arrangement window.

[0156] In combination with the above Figure 7 If UE1-f2 has the highest priority (priority 7 is the highest and 0 is the lowest), then the starting time of the orchestration window is slot 1.

[0157] A3. Matches the frame structure.

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

[0159] UE1-f2: If the arrival time of the first packet is offset = 1, then according to the period of 4ms, a data packet of size 60 will be placed in the orchestration window every 8 slots;

[0160] UE2-f2: If the first packet arrives at offset = 17, then every 10 slots, packets of size 80 will be placed in the orchestration window first in the forward direction, and then in the reverse direction, according to a period of 5ms.

[0161] UE1-f1: If the first packet arrives at offset=3, then according to a period of 4ms, data packets of size 50 will be placed in the orchestration window every 8 slots.

[0162] UE2-f1: If the first packet arrives at offset = 2, then every 10 slots, packets of size 80 will be placed in the orchestration window at a period of 5ms.

[0163] A4. Add a window.

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

[0165] When time slot type matching occurs, only windowing of the same type is retained. Therefore, the service characteristics of UE1-f1 can be presented as follows: Figure 8 As shown.

[0166] It should be noted that, Figure 8 In this context, Slot Type (DS) indicates the frame structure type: 1 represents an uplink slot; 0 represents a downlink slot. Since some slots do not have traffic scheduled, the slot type for that slot is... Figure 8 The following are not shown, such as time slots 6-8, 14-16, 22-24, etc. The same applies below, and will not be repeated hereafter.

[0167] A5. Frame structure time slot check.

[0168] Check if the transmission direction of the time slot matches the transmission direction of the guaranteed service flow. If there is a conflict with UE2-f1 when the time slots match, the guaranteed service flow and the corresponding time slot will be marked as "need to be postponed".

[0169] Determine the scheduling capacity of a base station's physical cell: Cfg UE Number represents the number of users that can be scheduled, such as 100. The number of UEs scheduled per TTI is less than the cell's scheduling capacity.

[0170] Determine air interface frequency domain resources: Assume that the resources occupied by each user in each time slot do not exceed the frequency domain resource limit.

[0171] The following description has been simplified and similar elements have been removed. Figure 8 The business features added due to the addition of windows can be obtained Figure 9 .

[0172] A6. Follow-up processing.

[0173] Calculate the latency margin deltaLatency for each guaranteed service flow. If the latency allowable value deltaLatency for UE2-f1 is 2ms, then the nearest uplink time slot can be found by delaying the process. The following can be obtained: Figure 10 .

[0174] A7. Merge UE configuration items.

[0175] In this example, if a flow has no packet-level delay or all packets in the flow experience overall delay within the orchestration window, then only one configuration item needs to be output.

[0176] The reference time for UE1-f2 is the reference time for the entire cell and serves as the starting point for slot0.

[0177] Output: UL

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

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

[0180] A8. Arrange non-essential business flows.

[0181] After all guaranteed service flows have been orchestrated, non-guaranteed service flows are inserted into the remaining time slots that match the service direction.

[0182] After inserting a non-guaranteed service flow, the following can be obtained: Figure 11 ,in, Figure 11 f3 in the text refers to the inserted non-guaranteed service flow. Figure 11 The black rectangle in the table represents the scheduling slots occupied by non-guaranteed service flows in the orchestration window. Slots not displayed in slots 0-39 represent slots where no service flows have been orchestrated, such as slot 5 and slot 7. These will not be elaborated further below.

[0183] A9. Send TSN gate list.

[0184] The cell-level orchestration map is sent to each TSN gating point according to UE level. For example, the TSN gating list for UE1 can be as follows: Figure 12 As shown.

[0185] Example 2: Add a URLLC user.

[0186] Based on eMBB users, URLLC users are introduced, using a DS frame structure. All users initiate uplink services. The orchestration result of eMBB users can be as described above. Figure 12 As shown, the orchestration results for URLLC users can be as follows: Figure 13 As shown, it may include the following steps.

[0187] B1. Determine the length of the arrangement window.

[0188] The period for eMBB users is 20ms. In this example, the periods for UE1-f3 and UE2-f4 are both 2ms. During UE-level merging, considering that the orchestration window length for eMBB users is 20ms, the overall orchestration window length is actually 20ms.

[0189] B2. Determine the start time of the arrangement window.

[0190] The start time of the orchestration window is set to the base time of the eMBB user.

[0191] B3. Matches the frame structure.

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

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

[0194] B4: Frame structure slot check:

[0195] Check if the time slot type matches the service direction. In this example, the data packets are all in the uplink time slot.

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

[0197] Determine air interface frequency domain resources: Assume that there are no resources exceeding the frequency domain in this example.

[0198] Check if the eMBB and URLLC services of the same user are in the same time slot: Figure 13 The time slots marked with arrows indicate that two types of guaranteed service flows for the same UE are in the same time slot. The guaranteed service flow and time slot markings [must be extended].

[0199] B5: Delayed processing.

[0200] Assuming UE1-f3 and UE2-f4 have large delay margins, then UE1-f3 and UE2-f4 should be moved. The result after the move is as follows. Figure 14 As shown.

[0201] against Figure 14 The output can be as follows:

[0202] UE1{{period=40, offset=4, Mini-slot Offset=0, size=20},

[0203] {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},

[0204] {period=40,offset=22,Mini-slot Offset=0,size=20},

[0205] {period=40,offset=28,Mini-slot Offset=0,size=20},

[0206] {period=40,offset=30,Mini-slot Offset=0,size=20},

[0207] {period=40,offset=36,Mini-slot Offset=0,size=20},{period=40,offset=38,Mini-slot Offset=0,size=20}}。

[0208] UE2{{period=40,offset=0,Mini-slot Offset=1,size=30},

[0209] {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-slotOffset=1,size=30},

[0210] {period=40,offset=18,Mini-slot Offset=1,size=30},

[0211] {period=40,offset=20,Mini-slot Offset=1,size=30},

[0212] {period=40,offset=24,Mini-slot Offset=1,size=30},

[0213] {period=40,offset=28,Mini-slot Offset=1,size=30},

[0214] {period=40,offset=34,Mini-slot Offset=1,size=30},

[0215] {period=40, offset=38, Mini-slot Offset=1, size=30}}.

[0216] B6: Merge UE configuration items.

[0217] In this example, neither of the following two situations exists, so no configuration items are merged.

[0218] If multiple data packets of a UE are in the same time slot, UE-level configuration items can be merged.

[0219] If a guaranteed service flow has multiple configuration items within the orchestration period, and there is no packet-level delay or all data packets of the flow are delayed as a whole within the orchestration window, then only one configuration item can be output.

[0220] B7. Arrange non-essential business flows.

[0221] After all guaranteed service flows are orchestrated, non-guaranteed service flows are inserted into the remaining time slots that match the service direction. In this example, all uplink time slots are occupied, and non-guaranteed service flows are sent in downlink time slots; the scheduler then adds resources for non-guaranteed service flows based on their resource requests.

[0222] B8. Send TSN gate list.

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

[0224] For example, the eMBB+URLLC user TSN gating list for UE1 can be as follows: Figure 15 As shown.

[0225] The foregoing primarily describes the solutions provided by the embodiments of this disclosure from a methodological perspective. To achieve the aforementioned functions, it includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this disclosure can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0226] This disclosure embodiment can divide the base station into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one functional module. The integrated module can be implemented in hardware or software. It should be noted that the module division in this disclosure embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. The following description uses the example of dividing each functional module according to each function.

[0227] Figure 16 This is a schematic diagram illustrating the composition of a communication device provided in an embodiment of this disclosure. Figure 16 As shown, the communication device 50 includes an acquisition unit 501 and a processing unit 502.

[0228] The communication device 50 can be the aforementioned base station or a chip of the base station. When the communication device 50 is used to implement the functions of the base station in the above embodiments, each unit is specifically used to implement the following functions.

[0229] The acquisition unit 501 is used to acquire the business characteristics of multiple guaranteed business flows;

[0230] The processing unit 502 is used to determine the orchestration result of the guarantee service flow based on the service characteristics of multiple guarantee service flows. The orchestration result of the guarantee service flow is used to indicate the scheduling time slots of multiple guarantee service flows within the orchestration window. The number of scheduling time slots of each guarantee service flow in a cycle is determined according to the delay jitter parameter in the service characteristics of the guarantee service flow.

[0231] In some embodiments, the processing unit 502 is specifically configured to: for each of the multiple guaranteed service flows, determine the reference time slot of the guaranteed service flow in each period within the orchestration window based on the first packet arrival time and period in the service characteristics of the guaranteed service flow; determine the windowing time domain length corresponding to the guaranteed service flow based on the latency jitter parameter of the guaranteed service flow; determine the scheduling time window of the guaranteed service flow in each period within the orchestration window based on the windowing time domain length and the reference time slot of the guaranteed service flow in each period within the orchestration window; the scheduling time window includes the reference time slot and the time slot adjacent to the reference time slot; take the time slot included in the scheduling time window of the guaranteed service flow in each period within the orchestration window as the scheduling time slot of the guaranteed service flow; and obtain the orchestration result of the guaranteed service flow based on the scheduling time slots of the multiple guaranteed service flows.

[0232] In some embodiments, the processing unit 502 is specifically configured to: determine the scheduling time slots to be adjusted from the respective scheduling time slots of multiple guaranteed service flows, wherein the scheduling time slots to be adjusted are scheduling time slots that do not meet the transmission constraints; determine the adjustable scheduling time slots from the scheduling time slots to be adjusted based on the delay margin of the scheduling time slots to be adjusted; adjust the time domain position of the adjustable scheduling time slots to obtain the adjusted scheduling time slots; wherein the delay margin of the adjusted scheduling time slots meets the delay requirements of the corresponding guaranteed service flows, and the adjusted scheduling time slots meet the transmission constraints; and obtain the orchestration result of the guaranteed service flows based on the adjusted scheduling time slots.

[0233] In some embodiments, the processing unit 502 is specifically configured to: when there are multiple adjustable scheduling time slots, determine 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; wherein, the flow priority of the adjustable scheduling time slot is the priority of the guaranteed service flow corresponding to the adjustable scheduling time slot; and adjust the time domain position of the multiple adjustable scheduling time slots sequentially based on the adjustment order of the multiple adjustable scheduling time slots to obtain multiple adjusted scheduling time slots.

[0234] In some embodiments, the acquisition unit 501 is further configured to acquire the service characteristics of non-guaranteed service flows;

[0235] The processing unit 502 is also used to determine the orchestration result of the non-guaranteed service flow based on the service characteristics of the non-guaranteed service flow and the orchestration result of the guaranteed service flow. The orchestration result of the non-guaranteed service flow is used to indicate the scheduling time slot of the non-guaranteed service flow within the orchestration window.

[0236] In some embodiments, the service characteristics of a non-guaranteed service flow include the transmission direction of the non-guaranteed service flow. The processing unit 502 is specifically used to determine the scheduling time slot of the non-guaranteed service flow from the remaining time slots in the orchestration window, excluding the scheduling time slots of the guaranteed service flow, based on the transmission direction of the non-guaranteed service flow.

[0237] In some embodiments, the processing unit 502 is specifically configured to: determine the scheduling time slot of the non-guaranteed service flow in the first remaining time slot based on the existence of a first remaining time slot in the remaining time slots, wherein the first remaining time slot is a time slot in the remaining time slots with the same transmission direction as the non-guaranteed service flow; or, determine the scheduling time slot of the non-guaranteed service flow in the second remaining time slot based on the absence of a first remaining time slot in the remaining time slots, wherein the second remaining time slot is a time slot in the remaining time slots with the opposite transmission direction to the non-guaranteed service flow.

[0238] In some embodiments, the processing unit 502 is further configured to: determine the duration and start time of the orchestration window; and determine the position of the orchestration window on the wireless temporal resources based on the duration and start time of the orchestration window.

[0239] In some embodiments, the acquisition unit 501 is further configured to acquire the period of multiple guaranteed service flows and the frame structure period of the radio frame.

[0240] The processing unit 502 is specifically used to determine the duration of the orchestration window based on the periods of multiple guaranteed service flows and the frame structure period of the radio frame.

[0241] In some embodiments, the processing unit 502 is specifically configured to: determine the highest priority assurance service flow from a plurality of assurance service flows; and determine the start time of the orchestration window based on the arrival time of the first packet of the highest priority assurance service flow.

[0242] In some embodiments, the service orchestration result includes multiple service configuration items, which are used to indicate a scheduled time slot of a guaranteed service flow of a terminal within an orchestration window; the processing unit 502 is further used to merge at least two service configuration items that meet the merging conditions among the multiple service configuration items to obtain merged service configuration items; wherein, the merging conditions include any one of the following: the at least two service configuration items to be merged belong to the same guaranteed service flow, and the scheduled time slots of the guaranteed service flow in each cycle within the orchestration window have not been extended; the at least two service configuration items to be merged belong to the same guaranteed service flow, and the scheduled time slots of the guaranteed service flow in each cycle within the orchestration window have undergone the same extension process; the at least two service configuration items to be merged belong to the same terminal and indicate the same time slot.

[0243] It should be noted that, Figure 16 The units in the text can also be called modules; for example, an acquisition unit can be called an acquisition module. Additionally, in... Figure 16 In the embodiments shown, the names of the various units may not be the same as those shown in the figures. For example, the acquisition unit may also be called the communication unit.

[0244] Figure 16If the various units in the present disclosure are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this disclosure, in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods of the various embodiments of this disclosure. Storage media for storing computer software products include various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0245] In the case where the communication device 50 implements the functions of the integrated module in hardware, this disclosure provides a schematic diagram of the structure of a network device. For example... Figure 17 As shown, the network device 60 includes: a processor 602, a communication interface 603, and a bus 604. Optionally, the network device 60 may also include a memory 601.

[0246] Processor 602 may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with this disclosure. Processor 602 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with this disclosure. Processor 602 may also be a combination that implements computing functions, such as including one or more microprocessor combinations, a combination of a DSP and a microprocessor, etc.

[0247] Communication interface 603 is used to connect to other devices via a communication network. This communication network can be Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0248] The memory 601 may be a read-only memory (ROM) or other type of static storage device capable of storing static information and instructions, random access memory (RAM) or other type of dynamic storage device capable of storing information and instructions, or electrically erasable programmable read-only memory (EEPROM), 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 accessible by a computer, but is not limited thereto.

[0249] In one possible implementation, the memory 601 can exist independently of the processor 602. The memory 601 can be connected to the processor 602 via a bus 604 and is used to store instructions or program code. When the processor 602 calls and executes the instructions or program code stored in the memory 601, it can implement the service orchestration method provided in the embodiments of this disclosure.

[0250] In another possible implementation, the memory 601 can also be integrated with the processor 602.

[0251] Bus 604 can be an extended industry standard architecture (EISA) bus, etc. Bus 604 can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 17 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0252] Through the above description of the implementation methods, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the base station or terminal can be divided into different functional modules to complete all or part of the functions described above.

[0253] This disclosure also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be executed by computer instructions instructing related hardware. The program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can also be an external storage device of the base station, such as a pluggable hard drive, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the base station. Further, the computer-readable storage medium can include both internal storage units and external storage devices of the base station. The computer-readable storage medium is used to store the computer program and other programs and data required by the base station. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0254] This disclosure also provides a computer program product that includes computer instructions that, when executed on a computer, cause the computer to perform any of the business orchestration methods provided in the above embodiments.

[0255] Although this disclosure has been described herein in conjunction with various embodiments, those skilled in the art will understand and implement other variations of the disclosed embodiments by reviewing the accompanying drawings, the disclosure, and the appended claims in carrying out the claimed disclosure. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality. A single processor or other unit can implement several functions listed in the claims. While different dependent claims may recite certain measures, this does not mean that these measures cannot be combined to produce good results.

[0256] Although this disclosure has been described in conjunction with specific features and embodiments, it will be apparent that various modifications and combinations can be made therein without departing from the spirit and scope of this disclosure. Accordingly, this specification and drawings are merely exemplary illustrations of the disclosure as defined by the appended claims and are to be considered as covering any and all modifications, variations, combinations, or equivalents within the scope of this disclosure. It is obvious that those skilled in the art can make various alterations and modifications to this disclosure without departing from its spirit and scope. Thus, this disclosure is also intended to include any such modifications and modifications that fall within the scope of the claims of this disclosure and their equivalents.

[0257] The above are merely specific embodiments of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A service orchestration method, characterized by, The method comprises: obtaining service characteristics of a plurality of guarantee service flows; determining a scheduling result of the guarantee service flows based on the service characteristics of the plurality of guarantee service flows, wherein the scheduling result of the guarantee service flows is used to indicate scheduling time slots of the plurality of guarantee service flows in a scheduling window, and a number of the scheduling time slots of each guarantee service flow in a period is determined according to a time delay jitter parameter in the service characteristics of the guarantee service flow.

2. The method of claim 1, wherein, The determining of the scheduling result of the guarantee service flows based on the service characteristics of the plurality of guarantee service flows comprises: for each guarantee service flow in the plurality of guarantee service flows, determining a reference time slot of each period in the scheduling window based on a first packet arrival time and a period in the service characteristics of the guarantee service flow; determining a windowed time domain length corresponding to the guarantee service flow based on a time delay jitter parameter of the guarantee service flow; determining a scheduling time window of each period in the scheduling window of the guarantee service flow based on the windowed time domain length and the reference time slot of each period in the scheduling window of the guarantee service flow, 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 each period in the scheduling window of the guarantee service flow as the scheduling time slots of the guarantee service flow; obtaining the scheduling result of the guarantee service flows based on the scheduling time slots of the plurality of guarantee service flows.

3. The method of claim 2, wherein, The obtaining of the scheduling result of the guarantee service flows based on the scheduling time slots of the plurality of guarantee service flows comprises: determining a to-be-adjusted scheduling time slot from the scheduling time slots of the plurality of guarantee 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 guarantee service flow, and the adjusted scheduling time slot satisfies the transmission constraint condition; obtaining the scheduling result of the guarantee 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 the guarantee service flow corresponding to 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 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 guarantee service flow corresponding to the scheduling time slot; a number of scheduled terminals in a transmission time interval corresponding to the time slot is less than a preset number; The frequency domain resource occupied by the user in the time slot is not more than the frequency domain resource limit; Different types of guaranteed service flows of the same user are not supported in the time slot.

6. The method of claim 2, wherein, After the arrangement result of the guaranteed service flow is determined, 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 the remaining time slots 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 slots 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 based on the presence of 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 determining the scheduling time slot of the non-guaranteed service flow in a second remaining time slot based on the absence of the 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.

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 preset requirements on delay requirement.

10. The method of claim 1, wherein, The method further includes: 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 cycle of the plurality of guaranteed service flows and a frame structure cycle of a wireless frame; determining the time length of the arrangement window based on the cycle of the plurality of guaranteed service flows and the frame structure cycle 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 a 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 merged service configuration items belong to the same guaranteed service flow, and the scheduling time slots of the guaranteed service flow in each cycle in the arrangement window have not been subjected to postponement processing. The at least two merged service configuration items belong to the same guaranteed service flow, and the scheduling time slots of the guaranteed service flow in each cycle in the arrangement window have been subjected to the same postponement processing. The at least two business configuration items to be merged belong to the same terminal and indicate the same time slot.

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

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

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

Images