Communication method and apparatus

Abstract

A communication method and a communication device are provided. The method includes: acquiring data transmission time lengths and data transmission time windows of N first devices in a network, where the data transmission time lengths of the N first devices have a one-to-one correspondence with the data transmission time windows of the N first devices, and the N first devices are connected to a third device in the network; and determining N offsets based on the data transmission time lengths and data transmission time windows of the N first devices, where the N offsets have a one-to-one correspondence with the N first devices, and the N offsets allow the data transmitted by the N first devices to arrive at the third device at different times. According to the above design, the traffic peak-to-average ratio of the aggregated link between the third device and the second device can be reduced, and the bandwidth utilization of the aggregated link can be improved.

Description

[Technical Field]

[0001] TECHNICAL FIELD Embodiments of the present application relate to the field of wireless communications, and in particular to communication methods and devices. [Background technology]

[0002] In an aggregated networking scenario, the transmission times of uplink and downlink data must comply with certain constraints. Specifically, distributed units (DUs) and radio units (RUs) require time synchronization and transmit and receive data based on the same wireless scheduling periodicity and the same periodicity boundaries. Therefore, data received by multiple RUs is transmitted in parallel to a switch based on the same periodicity, and the switch then transmits the data to the DU. Similarly, data transmitted by a DU to multiple RUs is also transmitted in parallel to a switch based on the same periodicity, and the switch then transmits the data to the corresponding RU.

[0003] For example, in the aggregation networking scenario shown in Figure 1, multiple RUs are connected to a switch, which is in turn connected to a DU. The traffic on the aggregation link (i.e., the transmission link between the DU and the switch) alternates between traffic peaks and valleys with wireless scheduling periodicity, as shown in Figure 2, but the average bandwidth is not high. As a result, the utilization rate of the physical bandwidth is low and the requirement for the upper limit of the physical bandwidth is high.

[0004] If the peak-to-average ratio is reduced by increasing the switch buffer, the cost of the switch increases, the forwarding delay increases, the delay uncertainty increases, and the buffer overhead of the DU and RU increases further. Summary of the Invention [Means for solving the problem]

[0005] The present application provides a communication method and apparatus for solving the problems of low physical bandwidth utilization of aggregated links and high requirements on the upper limit of physical bandwidth in an aggregated networking scenario.

[0006] According to a first aspect, the present application provides a communication method, the method being capable of being performed by a second device or a module (e.g., a chip) within the second device. The method includes the steps of acquiring data transmission time lengths and data transmission time windows of N first devices in a network, wherein the data transmission time lengths of the N first devices have a one-to-one correspondence with the data transmission time windows of the N first devices, where N is a positive integer greater than or equal to 2, and the N first devices are connected to a third device in the network; and determining N offsets based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, where the N offsets have a one-to-one correspondence with the N first devices, and the offset corresponding to the i-th first device among the N first devices is for determining the data transmission start time of the i-th first device in the data transmission time window of the i-th first device, and the N offsets allow the data transmitted by the N first devices to arrive at the third device at different times, where i is a positive integer and i is any one of 1 to N.

[0007] According to the above design, the N offsets are determined based on the acquired data transmission time lengths of the N first devices and the acquired data transmission time windows of the N first devices, so that the data transmitted by the N first devices corresponding to the N offsets arrive at the third device at different times, thereby reducing the traffic peak-to-average ratio of the aggregated link between the third device and the second device, improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirements of the aggregated link, reducing switch buffer requirements, and reducing the construction costs of operator fronthaul networks.

[0008] In a possible design, the third device is determined based on topology information of the network, the network topology information of the network includes connection relationships between the third device, the fourth device, and N first devices, the third device is connected to M first devices within the fourth device and the N first devices, the number of nodes separating the third device and the second device is less than the number of nodes separating the fourth device and the second device, M is less than N, and M is a positive integer.

[0009] According to the foregoing design, a device in a network that is separated from a second device by a small number of nodes may be determined based on topology information of the network.

[0010] In a possible design, K of the N first devices are connected to a fourth device, and the offsets of the K first devices within the N offsets allow data transmitted by the K first devices to arrive at the fourth device at different times, where K is less than N and K is a positive integer.

[0011] According to the above design, the data respectively transmitted by the K first devices connected to the fourth device arrive at the fourth device at different times.

[0012] In a possible design, when the N offsets are determined based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, the N offsets are determined based on the transmission delay between the N first devices and the third device, and the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices.

[0013] According to the above design, to further ensure that the data transmitted by the N first devices corresponding to the N offsets arrive at the third device at different times, the N offsets may be determined with reference to transmission delays between the N first devices and the third device.

[0014] In a possible design, the start position of the data transmission time window of the i-th first device is determined based on the minimum value of the data processing delay of the i-th first device, and the end position of the data transmission time window of the i-th first device is determined based on the maximum value of the data processing delay of the i-th first device.

[0015] According to the above design, the buffering capability of the second device is not taken into account, and no data buffering delay is performed in the first device. The above solution for determining the data transmission time window is simple.

[0016] In a possible design, the start position of the data transmission time window of the i-th first device is determined based on the greater of the minimum data processing delay of the i-th first device and the difference between the earliest time point at which the second device receives data and the minimum transmission delay between the i-th first device and the second device, and the end position of the data transmission time window of the i-th first device is determined based on the smaller of the maximum data processing delay of the i-th first device and the difference between the latest time point at which the second device receives data and the maximum transmission delay between the i-th first device and the second device.

[0017] According to the above design, the earliest time at which the second device receives data and the latest time at which the second device receives data depend on the buffer capacity of the second device, and the data transmission time window determined by the above solution is more accurate.

[0018] In a possible design, the data transmission time length of the i-th first device is determined based on the average amount of data transmitted by the i-th first device to the second device and the data transmission rate of the i-th first device.

[0019] In a possible design, the data transmission time length of the i-th first device is a predicted value.

[0020] In a possible design, N first devices may send data to the same second device, or N first devices may send data to different second devices.

[0021] According to the above design, it is not limited whether the N first devices transmit data to the same second device.

[0022] In a possible design, the method further includes a step of transmitting N pieces of first information to N first devices, where the N first devices are in a one-to-one correspondence with the N pieces of first information, and the first information corresponding to the i-th first device includes an offset corresponding to the i-th first device and a data transmission time window of the i-th first device, or a data transmission start time of the i-th first device within the data transmission time window of the i-th first device.

[0023] According to the above design, the corresponding offset and the corresponding data transmission time window, or the corresponding data transmission start time in the data transmission time window, can be notified to the N first devices respectively, so that the data respectively transmitted by the N first devices arrive at the third device at different times.

[0024] According to a second aspect, the present application provides a communication method, which can be performed by a second device or a module (e.g., a chip) within the second device, including the steps of: acquiring a data transmission time length of M1 and a data transmission time window of M1, where the data transmission time length of M1 is a time length for the second device to transmit data to the first device of M1, and the data transmission time window of M1 is a time window for the second device to transmit data to the first device of M1, the data transmission time length of M1 having a one-to-one correspondence with the data transmission time window of M1, and M1 is a positive integer equal to or greater than 2; and determining an offset of M1 based on the data transmission time length of M1 and the data transmission time window of M1. and determining an offset of M1 corresponding to a j-th first device among the M1 first devices for determining a data transmission start time point of the second device in the j-th data transmission time window among the M1 first devices, the offset of M1 allowing the data transmitted by the second device to the M1 first device to arrive at a third device at different times, the M1 first device being connected to the third device, j being a positive integer and j being any one of 1 to M1.

[0025] According to the above design, the M1 offset is determined based on the time length for which the second device transmits data to the first device of M1 and the time window for which the second device transmits data to the first device of M1, and the M1 offset allows the data transmitted by the second device to the first device of M1 to arrive at the third device at different times, thereby reducing the traffic peak-to-average ratio of the aggregated link between the third device and the second device, improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirements of the aggregated link, reducing switch buffer requirements, and reducing the construction costs of operator fronthaul networks.

[0026] In a possible design, a data transmission time length of M2 and a data transmission time window of M2 are obtained, the data transmission time length of M2 is a time length for a fourth device to transmit data to a first device of M2, the data transmission time window of M2 is a time window for the fourth device to transmit data to a first device of M2, the data transmission time length of M2 has a one-to-one correspondence with the data transmission time window of M2, M2 is a positive integer, the fourth device and the second device are connected to a fifth device, when an offset of M1 is determined based on the data transmission time length of M1 and the data transmission time window of M1, the offset of M1 and the offset of M2 are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2, the offset of M2 has a one-to-one correspondence with the first device of M2, and the offset corresponding to the kth first device among the first devices of M2 is the start of data transmission of the fourth device in the kth data transmission time window within the data transmission time window of M2. The offset of M1 and the offset of M2 are for determining a time point, where k is a positive integer and k is any one of 1 to M2, and the offset of M1 and the offset of M2 enable the time point at which data sent by the second device to the first device of M1 arrives at the third device to be different, the time point at which data sent by the fourth device to the first device of M2 arrives at the third device to be different, the time point at which data sent by the second device arrives at the fifth device to be different from the time point at which data sent by the fourth device arrives at the fifth device, and the first device of M2 is connected to the third device.

[0027] According to the above design, when the fourth device and the second device are connected to the fifth device, the M1 offset and the M2 offset allow the data sent by the second device to the first device of M1 to arrive at the third device at different times, the data sent by the fourth device to the first device of M2 to arrive at the third device at different times, and the time at which the data sent by the second device arrives at the fifth device to be different from the time at which the data sent by the fourth device arrives at the fifth device, thereby improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirements of the aggregated link, reducing switch buffer requirements, and reducing the construction costs of operator fronthaul networks.

[0028] In a possible design, when the M1 offset and the M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2, the M1 offset and the M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, the data transmission time window of M2, the transmission delay between the second device and the fifth device, and the transmission delay between the fourth device and the fifth device.

[0029] According to the above design, to further ensure that the time at which the data transmitted by the second device reaches the fifth device is different from the time at which the data transmitted by the fourth device reaches the fifth device, the M1 offset and the M2 offset may be determined with reference to the transmission delay between the second device and the fifth device and the transmission delay between the fourth device and the fifth device.

[0030] In a possible design, the start position of the jth data transmission time window in M1's data transmission time window is determined based on the sum of the minimum delay corresponding to the data processing and data buffering capabilities of the jth first device and the maximum transmission delay between the second device and the jth first device, and the end position of the jth data transmission time window in M1's data transmission time window is determined based on the sum of the maximum delay corresponding to the data processing and data buffering capabilities of the jth first device and the minimum transmission delay between the second device and the jth first device.

[0031] In a possible design, the jth data transmission time length among the data transmission time lengths of M1 is determined based on the average amount of data transmitted by the second device to the jth first device and the data transmission rate of the second device.

[0032] The data transmission time length of M1 may be a predicted value.

[0033] In a possible design, data is sent to each of M1 first devices based on the offset of M1.

[0034] According to a third aspect, an embodiment of the present application provides a communication device. The device may be a second device or a module (e.g., a chip) within the second device. The device has a function for implementing any one of the implementation forms in the first and second aspects. The function may be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the function.

[0035] According to a fourth aspect, an embodiment of the present application provides a communication device including a processor and a memory. The memory is configured to store computer instructions. When the device operates, the processor executes the computer instructions stored in the memory to enable the device to perform any one of the implementation forms of the first and second aspects.

[0036] According to a fifth aspect, an embodiment of the present application provides a communication device including a unit or means configured to perform any one of the steps of the implementation forms of the first and second aspects.

[0037] According to a sixth aspect, an embodiment of the present application provides a communication device including a processor and an interface circuit, wherein the processor is configured to communicate with another device via the interface circuit and to perform any one of the implementation forms of the first and second aspects, and there are one or more processors.

[0038] According to a seventh aspect, an embodiment of the present application provides a communication device including a processor coupled to a memory. The processor is configured to invoke a program stored in the memory to perform any one of the implementations of the first and second aspects. The memory may be located internal or external to the device. There may be one or more processors.

[0039] According to an eighth aspect, an embodiment of the present application further provides a computer-readable storage medium, the computer-readable storage medium storing instructions, which, when executed on a communication device, cause any one of the implementation forms of the first and second aspects to be executed.

[0040] According to a ninth aspect, an embodiment of the present application further provides a computer program product, the computer program product including a computer program or instructions, which, when executed by a communication device, performs any one of the implementation forms of the first and second aspects.

[0041] According to a tenth aspect, an embodiment of the present application further provides a chip system including a processor configured to perform any one of the implementation forms of the first and second aspects.

[0042] According to an eleventh aspect, an embodiment of the present application further provides a communication system including a second device, a plurality of first devices, and a third device, the devices being configured to perform any one of the implementation forms of the first and second aspects. The plurality of first devices are connected to the third device. [Brief explanation of the drawings]

[0043] [Figure 1] FIG. 1 is a diagram of an aggregated networking scenario according to the present application. [Figure 2] 1 is a diagram of traffic on an aggregated link according to the present application; [Figure 3] 1 is a diagram of a possible non-limiting system to which the present application may be applied. [Figure 4A] FIG. 2 is a diagram of another aggregation networking scenario according to the present application. [Figure 4B] FIG. 1 is a diagram of yet another aggregated networking scenario according to the present application. [Figure 4C] 1 is a diagram illustrating an aggregation network according to the present application as a ring network. [Figure 5] 1 is a diagram of various delays in the uplink and downlink directions according to the present application; [Figure 6] 1 is a schematic flow chart of a communication method according to the present application; [Figure 7] FIG. 1 is a diagram of yet another aggregated networking scenario according to the present application. [Figure 8] FIG. 10 is a diagram of determining an offset in the uplink direction according to the present application. [Figure 9] 4 is a schematic flow chart of another communication method according to the present application. [Figure 10] FIG. 10 is a diagram of determining an offset in the downlink direction according to the present application. [Figure 11] 1 is a diagram of traffic on an aggregated link obtained using an embodiment of the present application according to the present application; [Figure 12] 1 is a diagram of a possible communication device structure according to the present application; DETAILED DESCRIPTION OF THE INVENTION

[0044] The following clearly and completely describes the technical solutions of the embodiments of the present application with reference to the accompanying drawings of the embodiments of the present application. It is clear that the described embodiments are only a part, not all, of the embodiments of the present application. The terms "first" and "second," the numbers of corresponding terms, etc. in the specification, claims, and accompanying drawings of the present application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms are interchangeable in appropriate circumstances and are merely a way of distinguishing between objects having the same attributes in the embodiments of the present application. In addition, the terms "include," "contain," and any other variations thereof mean to cover non-exclusive inclusion, so that a process, method, system, product, or device that includes a series of units is not necessarily limited to those units and may include other units not expressly listed or other units inherent to such a process, method, system, product, or device.

[0045] FIG. 3 is a diagram of a possible, non-limiting system. As shown in FIG. 3, a communication system 1000 includes a radio access network (RAN) 100 and a core network (CN) 200. The RAN 100 includes at least one RAN node (e.g., 110a and 110b in FIG. 1 , collectively referred to as 110) and at least one terminal (e.g., 120a-120j in FIG. 1 , collectively referred to as 120). The RAN 100 may further include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in FIG. 3). The terminal 120 is wirelessly connected to the RAN node 110. The RAN node 110 is wirelessly or wired connected to the core network 200. The core network devices in the core network 200 and the RAN nodes 110 in the RAN 100 may be different physical devices or may be the same physical device that integrates the logical functions of the core network and the radio access network.

[0046] The RAN 100 may be a cellular system associated with the 3rd generation partnership project (3GPP), such as a 4G or 5G mobile communication system, or a future-oriented evolved system (e.g., a 6G mobile communication system). Alternatively, the RAN 100 may be an open access network (open RAN, O-RAN, or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (Wi-Fi) system. Alternatively, the RAN 100 may be a communication system that integrates multiple systems mentioned above.

[0047] The RAN node 110, which may also be referred to as an access network device, RAN entity, access node, etc., forms part of a communication system to help the terminal 120 implement wireless access. The multiple RAN nodes 110 in the communication system 1000 may be the same type of node or different types of nodes. In some scenarios, the roles of the RAN node 110 and the terminal 120 are relative. For example, the network element 120i in FIG. 3 may be a helicopter or an unmanned aerial vehicle, or may be configured as a mobile base station. In the case of the terminal 120j accessing the RAN 100 through the network element 120i, the network element 120i is a base station. In the case of the base station 110a, the network element 120i is a terminal. The RAN node 110 and the terminal 120 may also be referred to as communication devices. For example, the network elements 110a and 110b in FIG. 1 may be understood as communication devices having base station functionality, and the network elements 120a to 120j may be understood as communication devices having terminal functionality.

[0048] In possible scenarios, the RAN node may be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a next-generation base station for a 6th generation (6G) mobile communication system, a base station for a future mobile communication system, an access node for a Wi-Fi system, etc. The RAN node may be a macro base station (e.g., 110a in FIG. 3), a micro base station or an indoor station (e.g., 110b in FIG. 3), a relay node or a donor node, or a radio controller in a CRAN scenario. Optionally, the RAN node may alternatively be a server, a wearable device, a vehicle, an in-vehicle device, etc. For example, an access network device in a vehicle-to-everything (V2X) technology may be a road side unit (RSU).

[0049] In another possible scenario, multiple RAN nodes cooperate to help terminals implement radio access, with different RAN nodes each implementing some functions of a base station. For example, the RAN nodes may be a central unit (CU), DU, CU control plane (CP), CU user plane (UP), RU, etc. The CU and DU may be located separately or may be included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0050] In different systems, the CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meanings. For example, in an ORAN system, the CU is also called an O-CU (open CU), the DU is also called an O-DU, the CU-CP is also called an O-CU-CP, the CU-UP is also called an O-CU-UP, and the RU is also called an O-RU. For ease of explanation, the CU, CU-CP, CU-UP, DU, and RU are used as examples for explanation in this application. Any one of the CU (or CU-CP or CU-UP), DU, and RU in this application may be implemented using a software module, a hardware module, or a combination thereof.

[0051] A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, and smart city. Terminals may be mobile phones, tablet computers, computers with wireless transceiver capabilities, wearable devices, vehicles, unmanned aerial vehicles, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. In the embodiments of the present application, the device form of the terminal is not limited.

[0052] The following describes technical concepts that may be used in this application.

[0053] The fronthaul is the data transmission path between the DU and the RU.

[0054] The downlink direction is the direction of data transmission from the DU to the RU.

[0055] The uplink direction is the direction of data transmission from the RU to the DU.

[0056] The wireless scheduling periodicity includes subframe periodicity and symbol periodicity. The subframe periodicity corresponds to the wireless user data scheduling periodicity described in the 3GPP specifications. For example, the subframe periodicity is 1 millisecond (ms) or 0.5 ms. The symbol periodicity corresponds to the transmission duration of an orthogonal frequency division multiplexing (OFDM) symbol described in the 3GPP specifications. For example, the symbol periodicity is 0.66 microseconds (μs) or 0.33 μs.

[0057] The peak-to-average ratio is the ratio of peak traffic to average traffic, and indicates the uniformity of the traffic.

[0058] Embodiments of the present application can be applied to a centralized radio access network (CRAN), which is also called an aggregation network. In a CRAN deployment mode, DUs are located in a central equipment room, and RUs are distributed to remote sites. The distance between DUs and RUs is long. A characteristic of the CRAN networking topology is that one DU is connected to multiple RUs. Therefore, to save long-distance optical fiber, a link aggregation device is usually added between the DU and RU. Link aggregation devices include passive wavelength division devices and active switch devices, etc. The link aggregation device will be referred to as a switch for short hereinafter.

[0059] In addition, the embodiments of the present application may also be applied to other networks, which are not limited in the present application. In the following, an aggregation network is used as an example for explanation.

[0060] In the following, some possible networking scenarios for aggregation networks are described using examples.

[0061] Scenario 1: The aggregation network includes one DU, multiple RUs, and multiple switches. As shown in Figures 1 and 4A, each switch is connected to at least two RUs, and the link between the DU and the switch is called an aggregation link, and the link between the switch and the RU is called a branch link.

[0062] As shown in FIG. 4A, there may be at least one root switch among multiple switches, and the root switch is connected to a DU.

[0063] In Figure 4A, RU 1 to RU 3 are connected to switch A, RU 4 to RU 6 are connected to switch B, switch A is connected to switch B, switch B is connected to DU, RU 7 to RU 9 are connected to switch C, and switch C is connected to DU.

[0064] Scenario 2: The aggregation network includes multiple DUs, multiple RUs, and multiple switches. The switch connected to the DU is also called the DU-side switch, and multiple DUs may be connected to the same switch. The switch connected to the RU is also called the RU-side switch, and the RU-side switch is connected to at least two RUs. The link between the DU-side switch and the RU-side switch is called the aggregation link.

[0065] As shown in FIG. 4B, DU 1 and DU 2 are connected to switch A, RU 1, RU 2, and RU 3 are connected to switch B, and switch A is connected to switch B.

[0066] Scenario 3: The aggregation network is a ring network, and the aggregation network includes multiple DUs, multiple RUs, and multiple switches, and the switches are connected to form a ring network, as shown in FIG. 4C.

[0067] 4C, the aggregation network includes seven switches, and switches 1 to 7 form a ring network. Switch 1 is connected to three DUs, and each switch other than switch 1 is connected to three RUs.

[0068] It will be understood that the above scenarios 1 to 3 are merely examples and are not intended to limit the embodiments of the present application.

[0069] This application separately proposes the concepts of a time window for uplink data transmission and a time window for downlink data transmission. The time window for uplink data transmission is the time window for an RU to transmit data, i.e., the time window for an RU to transmit data to a DU, and may also be referred to as the data transmission time window of the RU. When an RU transmits data to different DUs, the data transmission time window of the RU may change. The time window for downlink data transmission is the time window for a DU to transmit data, i.e., the time window for a DU to transmit data to an RU, and may also be referred to as the data transmission time window of the DU. When a DU transmits data to different RUs, the data transmission time window of the DU may change.

[0070] (1) RU data transmission time window In the uplink direction, the UE needs to transmit data at the periodic boundaries of the wireless scheduling periodicity. The RU processes the data received from the UE and transmits the processed data to the DU. Therefore, the data transmission time window of the RU is after the periodic boundary.

[0071] The data transmission time window of the RU is related to the transmission delay (T34) for the RU to transmit data to the DU, the delay (T3a) for the RU to process the data, and the data buffering capability of the DU, as shown in Figure 5. The data buffering capability of the DU is an optional factor, and the data transmission time window of the RU may be determined by the DU. It should be understood that the data transmission time window of the RU may be further related to other factors, which are not limited in this application.

[0072] In the uplink direction, the data transmission time window of an RU may be determined in, but not limited to, the following manner.

[0073] Method 1: When the data buffering capability of the DU is not taken into consideration, in other words, when the data buffering delay is not performed in the RU, the DU can receive all the data transmitted by the RU, the data transmission time window of the RU can be determined in the following manner.

[0074] The start position of the data transmission time window of the RU is determined based on the minimum value of the data processing delay of the RU, and the end position of the data transmission time window of the RU is determined based on the maximum value of the data processing delay of the RU.

[0075] For example, if the maximum value of the data processing delay (T3a) of the RU is Ta3max and the minimum value is Ta3min, the data transmission time window of the RU is [Ta3min, Ta3max]. In other words, the RU does not buffer data, but processes the data received from the terminal, and determines the start and end positions of the RU's data transmission time window based only on the RU's data processing delay.

[0076] Correspondingly, the DU also needs to have a time window for receiving data, allowing multiple data packets of the same periodicity to arrive at different times within the time window. The data reception time window of the DU is [Ta4min, Ta4max], where Ta4min = Ta3min + T34min, and Ta4max = Ta3max + T34max.

[0077] Method 2: When the data buffer capability of the DU, i.e., the inherent capability of the DU, is taken into consideration, the data transmission time window of the RU can be determined in the following manner.

[0078] The start position of the RU's data transmission time window is determined based on the larger of the minimum data processing delay of the RU and the difference between the earliest point at which the DU receives data and the minimum transmission delay between the RU and the DU, and the end position of the RU's data transmission time window is determined based on the smaller of the maximum data processing delay of the RU and the difference between the latest point at which the DU receives data and the maximum transmission delay between the RU and the DU.

[0079] For example, the maximum value of the data processing delay (T3a) of the RU is Ta3max and the minimum value is Ta3min, the earliest time point at which the DU receives data is marked as Ta4min*, and the latest time point at which the DU receives data is marked as Ta4max*. In this case, the start position (i.e., left boundary) of the RU's data transmission time window is the larger of Ta4min*-T34min and Ta3min. The end position (i.e., right boundary) of the RU's data transmission time window is the smaller of Ta4max*-T34max and Ta3min.

[0080] (2) DU data transmission time window In the downlink direction, the RU needs to transmit data at the periodic boundary of the wireless scheduling periodicity. Therefore, the DU needs to transmit data to the RU before the periodic boundary. The RU receives and processes the data. After a certain delay compensation is performed, the data is transmitted at the periodic boundary through the antenna port. Therefore, the data transmission time window of the DU is before the periodic boundary.

[0081] For example, the data transmission time window of a DU is related to the transmission delay (T12) for the DU to transmit data to the RU and the delay (T2a) corresponding to the data processing and data buffering capabilities of the RU, as shown in Figure 5. It should be understood that the data transmission time window of a DU may be further related to other factors, which are not limited in this application.

[0082] In a possible implementation form, the start position of the DU's data transmission time window is determined based on the sum of the minimum delay corresponding to the RU's data processing and data buffering capabilities and the maximum transmission delay between the DU and the RU, and the end position of the DU's data transmission time window is determined based on the sum of the maximum delay corresponding to the RU's data processing and data buffering capabilities and the minimum transmission delay between the DU and the RU.

[0083] In the downlink direction, if data arrives at an RU early, the RU buffers the data for a certain period, i.e., performs a certain delay compensation, in order to allow the moment when the data finally arrives at the antenna port to be the periodicity boundary.

[0084] The delay compensation capability of an RU is expressed as the variable range of T2a. T2amin is used to represent the minimum value of T2a, T2amax is used to represent the maximum value of T2a, and the difference between T2amax and T2amin is used to represent the delay compensation capability of the RU. Assume that the maximum value of the transmission delay (T12) for a DU to transmit data to an RU is T12max, and the minimum value is T12min. In the downlink direction, the start position (i.e., left boundary) of the DU's data transmission time window is T2amax + T12min. In other words, if the timing advance for transmitting data by the DU is greater than T2amax + T12min, the RU's delay compensation capability is insufficient, and the data may arrive at the antenna port earlier than the periodic boundary. The end position (i.e., right boundary) of the DU's data transmission time window is T2amin + T12max. In other words, if the timing advance for transmitting data by the DU is less than T2amin + T12max, the data may arrive at the antenna port later than the periodic boundary, even if the RU does not perform compensation. Therefore, after the capability negotiation between the DU and the RU, the DU can obtain by calculation that the data transmission time window of the DU is [T1amax, T1amin]. Both T1amax and T1amin in this specification are expressed based on the periodic timing advance, where T1amax=T2amax+T12min, and T1amin=T2amin+T12max.

[0085] It will be understood that both the DU and the RU need to have certain data buffer capabilities to accommodate different intermediate transmission delays (T12 and T34), jitter in the intermediate transmission delays, and different types of interconnections between the DU and the RU. The methods for determining the data transmission time window of the RU and the methods for determining the data transmission time window of the DU are merely examples and are not intended to limit the present application.

[0086] Based on this, the present application provides a communication method for solving the problem of low physical bandwidth utilization of aggregated links and high requirements for the upper limit of physical bandwidth in an aggregated networking scenario. When N RUs transmit data to the same DU, the following method may be performed by the DU. When N RUs transmit data to at least two DUs, the following method may be performed by any one of the at least two DUs or by a designated DU of the at least two DUs. The designated DU may be agreed upon in advance or determined by the at least two DUs through negotiation, which is not a limitation of the present application.

[0087] Specifically, as shown in FIG. 6, the method includes the following steps:

[0088] Step 600: Obtain data transmission time lengths and data transmission time windows of N RUs in a network, where the data transmission time lengths of the N RUs have a one-to-one correspondence with the data transmission time windows of the N RUs, where N is a positive integer greater than or equal to 2, and the N RUs are connected to a first switch in the network.

[0089] The i-th RU among N RUs is used as an example. The data transmission time length of the i-th RU is determined based on the average data amount of data transmitted by the i-th RU to the DU and the data transmission rate of the i-th RU, where i is a positive integer and is any one of 1 to N.

[0090] For example, when estimating the average amount of data transmitted by the i-th RU to the DU, the DU may refer to at least one of a radio service load, a cell measurement result, a traffic model, cell history data, or cell configuration information. In addition, the DU may refer to another parameter to further estimate the average amount of data transmitted by the i-th RU to the DU. This is not limited in the present application.

[0091] The data transmission rate of the i-th RU may be the enhanced common public radio interface (eCPRI) port rate of the i-th RU.

[0092] Since the data transmitted to the DU by the i-th RU is the data transmitted to the DU by the terminal accessing the i-th RU, the DU may not be able to obtain the exact amount of data transmitted by the terminal. Therefore, the data transmission time length of the i-th RU is a predicted value.

[0093] For example, for the data transmission time window of N RUs, please refer to the above related description of the data transmission time window of RU, and the details will not be repeated here.

[0094] Note that N RUs may transmit data to the same DU, or N RUs may transmit data to different DUs. This is not a limitation in the present application. For example, as shown in FIG. 1, three RUs may transmit data to the same DU. In another example, as shown in FIG. 4B, five RUs, RU 1 to RU 3, may transmit data to DU 1, and RU 4 and RU 5 may transmit data to DU 2.

[0095] In addition, it will be understood that all RUs in a network may transmit data simultaneously at the periodic boundaries of one wireless scheduling periodicity, or some RUs in a network may transmit data simultaneously at the periodic boundaries of one wireless scheduling periodicity. N RUs in this application are RUs that transmit data simultaneously.

[0096] For example, in the network shown in Figure 7, the network includes a total of seven RUs. At the same time, RU 1, RU 2, and RU 4 transmit data to the DU, while the other RUs do not transmit data. Therefore, only the data transmission time length and data transmission time window corresponding to RU 1, RU 2, and RU 4, respectively, need to be obtained.

[0097] Note that when N RUs are connected to a first switch in a network, the first switch here may be a first switch directly connected to the RUs or a first switch indirectly connected to the RUs. For example, the RUs are connected to the first switch through another switch.

[0098] In a possible implementation, an arbitrary switch is selected as the first switch based on topology information of the network.

[0099] In another possible implementation, the first switch is determined based on network topology information, where the network topology information includes connection relationships between the first switch, the second switch, and N RUs, the first switch is connected to the second switch and M RUs among the N RUs, the number of nodes separating the first switch and the DU is less than the number of nodes separating the second switch and the DU, M is less than N, and M is a positive integer.

[0100] For example, if the network includes multiple switches, the multiple switches here refer to multiple switches on the RU side, and based on the topology information of the network, a root switch, a switch separated from the DU by the smallest number of nodes, or a switch separated from the DU-side switch by the smallest number of nodes can be determined as the first switch from the multiple switches.

[0101] In the following, scenarios A to C are used as examples for explanation.

[0102] Scenario A: Assume that three RUs transmit data to a DU simultaneously, and the three RUs are directly connected to a switch, as shown in Figure 1. In this case, the switch is the first switch.

[0103] Scenario B: Assume that RU 1, RU 2, and RU 4 simultaneously transmit data to the DU, and RU 1 and RU 2 are directly connected to Switch A, RU 1 and RU 2 are connected to Switch B through Switch A, and RU 4 is directly connected to Switch B, as shown in Figure 7.

[0104] In one example, switch A or switch B is selected as the first switch based on the topology information of the network shown in Figure 7. If the first switch is switch B, the N RUs include RU 1, RU 2, and RU 4. If the first switch is switch A, the N RUs include RU 1 and RU 2.

[0105] In another example, from the topology information of the network shown in Figure 7, it can be seen that switch A needs to be connected to the DU via switch B, and switch B is directly connected to the DU. Therefore, the number of nodes separating switch B and the DU (0) is less than the number of nodes separating switch A and the DU (1), and switch B is used as the first switch.

[0106] Scenario C: As shown in Figure 4C, assume that RUs 1 to 3 in switch 2 transmit data to DU 1, RUs 4 to 6 in switch 3 transmit data to DU 3, and RUs 8 and 7 in switch 4 transmit data to DU 1. That is, RUs 1 to 8 transmit data simultaneously.

[0107] In one example, switch 2, switch 3, or switch 4 is selected as the first switch based on the topology information of the network shown in Figure 4C. If the first switch is switch 2, the N RUs include RU 1 to RU 8. If the first switch is switch 3, the N RUs include RU 4 to RU 8. If the first switch is switch 4, the N RUs include RU 7 and RU 8.

[0108] In another example, from the topology information of the network shown in Fig. 4C, it can be seen that switch 2 is directly connected to switch 1, switch 2 separates switch 3 and switch 1, and switch 3 and switch 2 separate switch 4 and switch 1. In other words, the number of nodes separating switch 2 and DU is 0, the number of nodes separating switch 3 and DU is 1, the number of nodes separating switch 4 and DU is 2, and switch B is used as the first switch.

[0109] It will be appreciated that the above scenarios are merely examples and are not intended to limit the present application.

[0110] When the first switch is a root switch, or a switch separated from the DU by a small number of nodes, or a switch separated from the switch on the DU side by a small number of nodes, since the number of RUs corresponding to the first switch is large, the data transmission times of more RUs can be adjusted, and the effect of reducing the traffic peak-to-average ratio of the aggregated link is more obvious.

[0111] Step 610: Determine N offsets according to the data transmission time lengths of the N RUs and the data transmission time windows of the N RUs, where the N offsets have a one-to-one correspondence with the N RUs.

[0112] The offset corresponding to the i-th RU is for determining the start time of data transmission of the i-th RU in the data transmission time window of the i-th RU, and the N offsets allow the data transmitted by the N RUs to arrive at the first switch at different times.

[0113] For example, the offset corresponding to the i-th RU includes an offset of the start of data transmission for the i-th RU relative to the start of the data transmission time window for the i-th RU, or an offset of the start of data transmission for the i-th RU relative to the end of the data transmission time window for the i-th RU.

[0114] The N offsets enabling the data transmitted by the N RUs to arrive at the first switch at different times can also be described as the N offsets enabling the overlapping time length of the data transmission times of the N RUs to be as short as possible. For example, the N offsets enable the N RUs to start transmitting data at different times and enable the overlapping time length of the data transmission times of the N RUs to be as short as possible.

[0115] The networking scenario shown in Figure 1 is used as an example. Assume that three RUs (RU1, RU2, and RU3) simultaneously transmit data to a DU. As shown in Figure 8, three hollow rectangles represent the data transmission time windows of the three RUs: RU1, RU2, and RU3, respectively. The data transmission time windows of the three RUs are later than the periodicity boundaries. Three solid black rectangles represent the data transmission time lengths of the three RUs: RU1, RU2, and RU3, respectively. Three offsets are determined based on the data transmission time lengths of the three RUs and their data transmission time windows. As a result, the overlapping time lengths of the data transmission time lengths of the three RUs are less than a preset threshold, and the data of the three RUs may arrive at the switch at different times. Offset 1 is the offset of the start of RU1's data transmission from the start of RU1's data transmission time window. Offset 2 is the offset of the start of data transmission for RU 2 relative to the start of the data transmission time window for RU 2. Offset 3 is the offset of the start of data transmission for RU 3 relative to the start of the data transmission time window for RU 3.

[0116] Additionally, in some possible embodiments, when K RUs among the N RUs are connected to the second switch, the offsets of the K RUs among the N offsets further allow data transmitted by the K RUs to arrive at the second switch at different times, where K is less than N and K is a positive integer. The offsets of the K RUs allow data transmitted by the K RUs to arrive at the second switch at different times.

[0117] It will be understood that the offset of each of the K RUs makes it possible to make the overlapping time length of the data transmission time lengths of the K RUs as short as possible. For example, the offset of each of the K RUs makes it possible to make the start times at which the K RUs transmit data different from each other and to make the overlapping time length of the data transmission time lengths of the K RUs as short as possible.

[0118] For example, in the above-mentioned Scenario B, Switch B can be used as the first switch based on the topology information of the network shown in Figure 7. In addition, because RU 1 and RU 2 are directly connected to Switch A, the offset of RU 1, the offset of RU 2, and the offset of RU 4 enable the time at which the data sent by RU 1, the time at which the data sent by RU 2, and the time at which the data sent by RU 4 arrive at Switch B to be different from each other. The offset of RU 1 and the offset of RU 2 further enable the time at which the data sent by RU 1 arrives at Switch A to be different from the time at which the data sent by RU 2 arrives at Switch A.

[0119] As another example, in the above-described Scenario C, Switch 2 may be used as the first switch based on the topology information of the network shown in FIG. 4C . In addition, RUs 1 to 3 are connected to Switch 2, RUs 4 to 6 are connected to Switch 3, and RUs 8 and 7 are connected to Switch 4. Therefore, the offsets corresponding to RUs 1 to 8 respectively allow data transmitted by RU 1 to RU 8 respectively to arrive at Switch 2 at different times, the offsets corresponding to RUs 4 to 6 respectively further allow data transmitted by RU 4 to RU 6 respectively to arrive at Switch 3 at different times, and the offsets corresponding to RUs 7 and 8 respectively further allow data transmitted by RUs 7 and 8 respectively to arrive at Switch 4 at different times.

[0120] In addition, in a possible design, when the N offsets are determined based on the data transmission time lengths of the N RUs and the data transmission time windows of the N RUs, the N offsets are determined based on the transmission delay between the N RUs and the first switch, the data transmission time lengths of the N RUs, and the data transmission time windows of the N RUs.

[0121] For example, in scenario B, as shown in FIG. 7, assume that RU 1, RU 2, and RU 4 simultaneously transmit data to the DU, and RU 1 and RU 2 are directly connected to switch A, RU 1 and RU 2 are connected to switch B through switch A, and RU 4 is directly connected to switch B. When the offsets corresponding to RU 1, RU 2, and RU 4, respectively, are determined, the transmission delay between RU 1 and switch A (T1A), the transmission delay between RU 2 and switch A (T2A), the transmission delay between RU 1 and switch B (T1B), the transmission delay between RU 2 and switch B (T2B), and the transmission delay between RU 4 and switch B (T4B) can be further obtained.

[0122] Assume that the offset of each RU is the offset of the start time of data transmission of the RU with respect to the start position of the data transmission time window of the RU. The start position of the data transmission time window of RU 1 is the same as the start position of the data transmission time window of RU 2. If there are requirements regarding the time when the data of each RU reaches the switch based on the actual situation, for example, if the time when the data of RU 1 reaches switch A is earlier than the time when the data of RU 2 reaches switch A, then in the following, different scenarios will be referred to to explain the change of the offset of RU 1.

[0123] When T1A = T2A and the offsets of RU 1 and RU 2 are determined, if the offset of RU 1 (P 10 ) is smaller than the offset of RU 2 (P 20 ).

[0124] When T1A > T2A and the offsets of RU 1 and RU 2 are determined, assuming that the offset of RU 2 (P 20 ) remains unchanged, the offset of RU 1 (P 11 ) is smaller than the offset of RU 1 in the scenario of T1A = T2A (P 10 ), that is, P 11 < P 10 . In other words, RU 1 transmits data earlier than in the scenario of T1A = T2A. As a result, the time when the data of RU 1 reaches switch A is earlier than the time when the data of RU 2 reaches switch A, and the overlapping time length between the data transmission time length of RU 1 and the data transmission time length of RU 2 is less than the preset threshold.

[0125] When T1A < T2A and the offsets of RU 1 and RU 2 are determined, assuming that the offset of RU 2 (P 20 ) remains unchanged, the offset of RU 1 (P 12 ) is the offset of RU 2 in the scenario of T1A = T2A (P 10may be equal to, or the offset of RU 1 (P 12 ) may be smaller than the offset of RU 2 (P 10 ) in the scenario of T1A = T2A. Alternatively, the offset of RU 1 (P 12 ) may be larger than the offset of RU 2 (P 10 ) in the scenario of T1A = T2A. In other words, RU 1 can transmit data later than the scenario of T1A = T2A. P 12 = P 10 In the case of, since T1A < T2A, the overlapping time length between the data transmission time length of RU 1 and the data transmission time length of RU 2 is shorter than the overlapping time length of the previous scenario (e.g., T1A = T2A). P 12 < P 10 In the case of, since T1A < T2A, the overlapping time length between the data transmission time length of RU 1 and the data transmission time length of RU 2 is P 12 = P 10 shorter than the overlapping time length of the scenario. P 12 > P 10 In the case of, since TIA < T2A, compensation for the increase in the overlapping time length between the data transmission time length of RU 1 and the data transmission time length of RU 2 caused by P 12 may be implemented, and even when P 12 increases, it can be guaranteed that the overlapping time length between the data transmission time length of RU 1 and the data transmission time length of RU 2 does not become longer than the overlapping time length of the previous scenario (e.g., T1A = T2A).

[0126] It should be understood that the above description is provided using only an example where the offset of RU 2 remains unchanged. In addition, it may be assumed that the offset of RU 1 remains unchanged and the offset of RU 2 is changed, or both the offset of RU 1 and the offset of RU 2 are changed. This is not limited in this application.

[0127] It should be noted that if the transmission delay between the N RUs and the first switch is not taken into account when the N offsets are determined, and the N offsets are determined based only on the data transmission time lengths of the N RUs and the data transmission time windows of the N RUs, the transmission delay between the N RUs and the first switch does not need to be taken into account in the overlap state of the determined data transmission time lengths of the N RUs.

[0128] If the transmission delay between the N RUs and the first switch is taken into consideration when the N offsets are determined, in other words, if the N offsets are determined based on the transmission delay between the N RUs and the first switch, the data transmission time lengths of the N RUs, and the data transmission time windows of the N RUs, the overlap state of the determined data transmission time lengths of the N RUs also needs to be determined with reference to the transmission delay between the N RUs and the first switch.

[0129] Similarly, the offsets corresponding to RU 1, RU 2, and RU 4, respectively, can be determined by referring to T1B, T2B, and T4B, and the data transmission time lengths and data transmission time windows corresponding to RU 1, RU 2, and RU 4, respectively.

[0130] In addition, in a possible design, after the N offsets are determined, N pieces of first information are transmitted to the N RUs. The N RUs have a one-to-one correspondence with the N pieces of first information, and the first information corresponding to the i-th RU includes an offset corresponding to the i-th RU and a data transmission time window of the i-th RU, or a data transmission start time of the i-th RU within the data transmission time window of the i-th RU.

[0131] Additionally, in a ring network scenario as shown in FIG. 4C, when the offset for each RU is determined, it may be ensured that data arriving at the switch on the DU side separated from the switch by the fewest number of nodes is staggered first, then data arriving at the switch on the DU side separated from the switch by the second fewest number of nodes is staggered, and so on.

[0132] Scenario 3 above is used as an example: data arriving at switch 2 is first guaranteed to be staggered, then data arriving at switch 3 is guaranteed to be staggered, then data arriving at switch 4 is guaranteed to be staggered.

[0133] According to the above method, in the uplink direction, each of the N RUs can determine a corresponding data transmission time point based on a corresponding offset, so that the data transmitted by the N RUs arrive at the first switch at different times, thereby reducing the traffic peak-to-average ratio of the aggregated link between the first switch and the DU, improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirement of the aggregated link, reducing switch buffer requirements, and reducing the construction cost of the operator's fronthaul network.

[0134] In the embodiment shown in FIG. 6 , the RU may be a first device, the DU may be a second device, and the first switch may be a third device. For example, the second device may obtain data transmission time lengths and data transmission time windows of N first devices in the network, and the N first devices are connected to a third device in the network. Furthermore, the second device may determine N offsets based on the data transmission time lengths and data transmission time windows of the N first devices, where the N offsets enable the data transmitted by the N first devices to arrive at the third device at different times. According to the above design, the data transmitted by the N first devices may arrive at the third device at different times, thereby reducing the traffic peak-to-average ratio of the aggregated link between the third device and the second device, improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirements of the aggregated link, reducing switch buffer requirements, and reducing the construction costs of operator fronthaul networks.

[0135] Based on this, the present application further provides a communication method for solving the problem of low physical bandwidth utilization of aggregated links and high requirements for the upper limit of physical bandwidth in aggregated networking scenarios. As shown in Figure 9, the method includes the following steps:

[0136] Step 900: The first DU obtains the data transmission time length and the data transmission time window of M1, where the data transmission time length of M1 is the time length for the first DU to transmit data to the RU of M1, the data transmission time window of M1 is the time window for the first DU to transmit data to the RU of M1, the data transmission time length of M1 has a one-to-one correspondence with the data transmission time window of M1, and M1 is a positive integer greater than or equal to 2. The RU of M1 is connected to the first switch.

[0137] The jth RU among the RUs of M1 is used as an example. The jth data transmission time length among the data transmission time lengths of M1 is determined based on the average data amount of data transmitted by the first DU to the jth RU and the data transmission rate of the first DU. j is a positive integer, and j is any one of 1 to M1.

[0138] The average amount of data transmitted by the first DU to the jth RU is determined based on the amount of data that needs to be transmitted by the first DU to the jth RU, i.e., it is determined based on the amount of data scheduled to be transmitted to the jth RU.

[0139] For example, when estimating the average amount of data transmitted by the first DU to the jth RU, the first DU may refer to at least one of a radio service load, a cell measurement result, a traffic model, cell history data, or cell configuration information. In addition, the first DU may refer to another parameter to further estimate the average amount of data transmitted by the first DU to the jth RU. This is not limited in the present application.

[0140] Although the first DU can know the amount of data that needs to be transmitted to the jth RU each time, it should be noted that the time length during which the first DU transmits data to the jth RU is generally on the order of microseconds. Therefore, if the first DU re-determines the offset corresponding to the jth RU and the offset corresponding to another RU each time before transmitting data to the jth RU, a significant signaling overhead and resource consumption will occur. Generally, the M1 offset is adjusted periodically. For example, the periodicity can be 30 seconds or 60 seconds. Therefore, the data transmission time length during which the first DU transmits data to the jth RU is also a predicted value.

[0141] The data transmission rate of the first DU may be the fronthaul port rate of the first DU.

[0142] For example, for the data transmission time window of M1, please refer to the above related description of the data transmission time window of DU, and the details will not be repeated here.

[0143] Note that the RUs of M1 are connected to the first switch, where the first switch is generally the root switch on the RU side.

[0144] Step 910: The first DU determines an M1 offset based on the data transmission time length of M1 and the data transmission time window of M1, where the offset of M1 has a one-to-one correspondence with the RU of M1.

[0145] The offset corresponding to the jth RU among the RUs of M1 is for determining the start time of data transmission of the first DU in the jth data transmission time window among the data transmission time windows of M1, and the offset of M1 allows the data transmitted by the first DU to the RU of M1 to arrive at the first switch at different times.

[0146] The fact that the M1 offset enables the time points at which data transmitted by the first DU to the M1 RU arrive at the first switch to differ can also be explained as the fact that the M1 offset enables the overlapping time length of the data transmission time length of M1 to be as short as possible. For example, the M1 offset enables the start time points at which the first DU starts transmitting data to the M1 RU to differ, and enables the overlapping time length of the data transmission time length of M1 to be as short as possible.

[0147] The networking scenario shown in Figure 1 is used as an example. Assume that a DU transmits data to three RUs (RU 1, RU 2, and RU 3) simultaneously. As shown in Figure 10, three hollow rectangles represent the data transmission time windows during which the DU transmits data to the three RUs: the data transmission time window during which the DU transmits data to RU 1, the data transmission time window during which the DU transmits data to RU 2, and the data transmission time window during which the DU transmits data to RU 1, respectively. The data transmission time windows during which the DU transmits data to the three RUs are earlier than the periodicity boundary. Three solid black rectangles represent the data transmission time lengths during which the DU transmits data to the three RUs: the data transmission time length during which the DU transmits data to RU 1, the data transmission time length during which the DU transmits data to RU 2, and the data transmission time length during which the DU transmits data to RU 3, respectively. Three offsets are determined based on the data transmission time window during which the DU transmits data to the three RUs and the data transmission time length during which the DU transmits data to the three RUs. As a result, the overlapping time length of the data transmission time lengths during which the DU transmits data to the three RUs is less than a preset threshold, and the data transmitted by the DU to the three RUs arrives at the switch at different times. This reduces the traffic peak-to-average ratio of the aggregated link between the switch and the DU, improves the bandwidth utilization of the aggregated link, reduces data transmission delay jitter, reduces the peak bandwidth requirements of the aggregated link, reduces switch buffer requirements, and reduces the construction costs of the operator's fronthaul network. Offset 1 is the offset of the data transmission start time during which the DU transmits data to RU 1 relative to the start of the data transmission time window during which the DU transmits data to RU 2. Offset 2 is the offset of the data transmission start time during which the DU transmits data to RU 2 relative to the start of the data transmission time window during which the DU transmits data to RU 3. Offset 3 is the offset of the data transmission start time during which the DU transmits data to RU 3 relative to the start of the data transmission time window during which the DU transmits data to RU 3.

[0148] In addition, in some possible embodiments, a data transmission time length of M2 and a data transmission time window of M2 are obtained, where the data transmission time length of M2 is a time length for the second DU to transmit data to the RU of M2, the data transmission time window of M2 is a time window for the second DU to transmit data to the RU of M2, the data transmission time length of M2 has a one-to-one correspondence with the data transmission time window of M2, and M2 is a positive integer. The second DU and the first DU are connected to a second switch, and further, an M1 offset and an M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2.

[0149] The M2 offset has a one-to-one correspondence with the M2 RU. The offset corresponding to the kth RU in the M2 RU is used to determine the data transmission start time of the second DU in the kth data transmission time window in the M2 data transmission time window, where k is a positive integer and is any one of 1 to M2.

[0150] The M1 offset and M2 offset allow data sent by the first DU to the RU of M1 to arrive at the first switch at different times, data sent by the second DU to the RU of M2 to arrive at the first switch at different times, and the time at which the data sent by the first DU arrives at the second switch to be different from the time at which the data sent by the second DU arrives at the second switch. The RU of M2 is connected to the first switch.

[0151] It should be understood that the M1 RU and the M2 RU may be completely the same, completely different, or partially the same. This is not a limitation in the present application. The first DU transmits data, i.e., M1 pieces of data, separately to the M1 RUs, so that all of the M1 RUs receive the corresponding data and perform data processing. After a specific delay compensation is performed, the M1 data is transmitted at a periodic boundary via an antenna port. The second DU transmits data, i.e., M2 pieces of data, separately to the M2 RUs, so that all of the M2 RUs receive the corresponding data and perform data processing. After a specific delay compensation is performed, the M2 data is transmitted at a periodic boundary via an antenna port. The aforementioned periodic boundary is the same periodic boundary.

[0152] For example, in the networking scenario shown in FIG. 4B, DU 1 can transmit data to RU 1 and RU 2, and DU 2 can transmit data to RUs 1 to 5.

[0153] As another example, in the networking scenario shown in FIG. 4B, DU 1 can transmit data to RU 1 and RU 2, and DU 2 can transmit data to RU 1 and RU 2.

[0154] As another example, in the networking scenario shown in FIG. 4B, DU 1 can transmit data to RU 1 and RU 2, and DU 2 can transmit data to RU 3 and RU 4.

[0155] For example, in the networking scenario shown in FIG. 4B , DU 1 can transmit data to RU 1 and RU 2, and DU 2 can transmit data to RU 1 to RU 5. Because DU 1 and DU 2 are connected to switch A, the offsets respectively corresponding to the data transmitted by the first DU to RU 1 and RU 2 enable the time at which the data transmitted by the first DU to RU 1 arrives at switch B to be different from the time at which the data transmitted by the first DU to RU 2 arrives at switch B, and the offsets respectively corresponding to the data transmitted by the second DU to RU 1 to RU 5 enable the time at which the data transmitted separately by the second DU to RU 1 and RU 5 arrive at switch B to be different.

[0156] In addition, the offsets corresponding to the data transmitted by the first DU to RU 1 and RU 2, respectively, and the offsets corresponding to the data transmitted by the second DU to RU 1 to RU 5, respectively, enable the time at which the data transmitted by the first DU to RU 1 reaches switch A, the time at which the data transmitted by the first DU to RU 2 reaches switch A, the time at which the data transmitted by the second DU to RU 1 reaches switch A, the time at which the data transmitted by the second DU to RU 2 reaches switch A, the time at which the data transmitted by the second DU to RU 3 reaches switch A, the time at which the data transmitted by the second DU to RU 4 reaches switch A, and the time at which the data transmitted by the second DU to RU 5 reaches switch A to be different from one another.

[0157] In a possible design, when the M1 offset and the M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M, the M1 offset and the M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, the data transmission time window of M2, the transmission delay between the first DU and the second switch, and the transmission delay between the second DU and the second switch.

[0158] For example, in the networking scenario shown in FIG. 4B , DU 1 can transmit data to RU 1 and RU 2, and DU 2 can transmit data to RUs 1 to 5. The offsets corresponding to the data transmitted by the first DU to RU 1 and RU 2, respectively, and the offsets corresponding to the data transmitted by the second DU to RUs 1 to 5, respectively, can be determined by referring to the transmission delay between DU 1 and switch A and the transmission delay between DU 2 and switch A.

[0159] The offsets corresponding to the data transmitted by the first DU to RU 1 and RU 2, respectively, and the offsets corresponding to the data transmitted by the second DU to RUs 1 to 5, respectively, may be determined by the first DU, the second DU, or a designated DU among the first DU and the second DU. The designated DU may be agreed upon in advance or determined by the first DU and the second DU through negotiation.

[0160] Furthermore, the first DU transmits data to the M1 RUs separately based on the M1 offset.

[0161] According to the above design, when the first DU transmits data to the RU of M1, the first DU can determine a data transmission time point for transmitting data to the RU based on the offset corresponding to each RU, so that the data transmitted by the first DU to the RU of M1 arrives at the first switch at different times, thereby reducing the traffic peak-to-average ratio of the aggregation link between the first DU and the first switch, improving the bandwidth utilization of the aggregation link, reducing data transmission delay jitter, reducing the peak bandwidth requirement of the aggregation link, reducing switch buffer requirements, and reducing the construction cost of the operator's fronthaul network.

[0162] According to the above design, in the aggregated networking scenario shown in Figure 1, traffic on the aggregated link (i.e., the transmission link between the DU and the switch) alternates between traffic peaks and valleys with the wireless scheduling periodicity, but the average bandwidth increases. As shown in Figure 11, compared to Figure 2, the physical bandwidth utilization of the aggregated link is improved, and the requirement for the upper limit of the physical bandwidth is reduced.

[0163] In the embodiment shown in FIG. 9, the RU may be the first device, the first DU may be the second device, the first switch may be the third device, the second DU may be the fourth device, and the second switch may be the fifth device. For example, the second device may obtain the data transmission time length of M1 and the data transmission time window of M1, where the data transmission time length of M1 is the time length for the second device to transmit data to the first device of M1, and the data transmission time window of M1 is the time window for the second device to transmit data to the first device of M1, and the data transmission time length of M1 has a one-to-one correspondence with the data transmission time window of M1. Furthermore, the offset of M1 is determined based on the data transmission time length of M1 and the data transmission time window of M1, where the offset of M1 allows the data transmitted by the second device to the first device of M1 to arrive at the third device at different times, and the first device of M1 is connected to the third device. According to the above design, data sent by the second device to the first device of M1 may arrive at the third device at different times, thereby reducing the traffic peak-to-average ratio of the aggregated link between the second device and the third device, improving the bandwidth utilization of the aggregated link, reducing data transmission delay jitter, reducing the peak bandwidth requirements of the aggregated link, reducing switch buffer requirements, and reducing the construction costs of operator fronthaul networks.

[0164] FIG. 12 illustrates a possible structure of a communication device. It should be understood that the communication device 1200 may include any necessary form, such as a module, unit, element, circuit, or interface, appropriately configured together to implement the solution. The communication device 1200 may be a second device (e.g., a DU) or a component (e.g., a chip) of the second device to implement the method described in the above method embodiment. The communication device 1200 includes one or more processors 1201. The processor 1201 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a baseband processor or a central processing unit. The baseband processor may be configured to process communication protocols and communication data. The central processing unit may be configured to control the communication device, execute software programs, and process data of the software programs.

[0165] Optionally, in one design, the processor 1201 may include programs (also referred to as codes or instructions) 1203. The programs 1203 may execute on the processor 1201, causing the communication device 1200 to perform the methods described in the previous embodiments.

[0166] In yet another possible design, the communications device 1200 may include circuitry (not shown in FIG. 12) configured to implement the methods described in the previous embodiments.

[0167] Optionally, the communication device 1200 may include one or more memories 1202, and programs 1204 (also referred to as codes or instructions) may be stored in the memories 1202. The programs 1204 may be executed on the processor 1201, such that the communication device 1200 performs the methods described in the preceding method embodiments.

[0168] Optionally, the processor 1201 and / or the memory 1202 may include artificial intelligence (AI) modules 1207 and 1208, which are configured to implement AI-related functions. The AI ​​modules may be implemented using software, hardware, or a combination of software and hardware. For example, the AI ​​modules may include a radio access network intelligent controller (RAN intelligent controller, RIC) module. For example, the AI ​​modules may be a near real-time RIC or a non-real-time RIC.

[0169] Optionally, the processor 1201 and / or the memory 1202 may further store data. The processor and the memory may be located separately or integrated together.

[0170] Optionally, the communications device 1200 may further include a transceiver 1205 and / or an antenna 1206. The processor 1201 may also be referred to as a processing unit and controls the communications device. The transceiver 1205 may also be referred to as a transceiver unit, transceiver machine, transceiver circuitry, etc., and is configured to implement transceiver functionality of the communications device by using the antenna 1206.

[0171] For example, the processor 1201 calls the memory 1202 to acquire data transmission time lengths and data transmission time windows of the N first devices in the network, where the data transmission time lengths of the N first devices have a one-to-one correspondence with the data transmission time windows of the N first devices, where N is a positive integer greater than or equal to 2, and the N first devices are connected to a third device in the network; and determine N offsets based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, where the N offsets have a one-to-one correspondence with the N first devices, and the offset corresponding to the i-th first device among the N first devices is for determining the data transmission start time of the i-th first device in the data transmission time window of the i-th first device, and the N offsets allow the time at which the data transmitted by the N first devices arrive at the third device to be different, where i is a positive integer and i is any one of 1 to N.

[0172] In a possible design, the processor 1201 is further configured to determine the third device based on topology information of the network, the topology information of the network including connection relationships between the third device, the fourth device, and N first devices, the third device being connected to M first devices within the fourth device and the N first devices, the number of nodes separating the third device and the second device being less than the number of nodes separating the fourth device and the second device, M being less than N, and M being a positive integer.

[0173] In a possible design, K of the N first devices are connected to a fourth device, and the offsets of the K first devices within the N offsets allow data transmitted by the K first devices to arrive at the fourth device at different times, where K is less than N and K is a positive integer.

[0174] In a possible design, processor 1201 is further configured to determine N offsets based on transmission delays between the N first devices and the third device, data transmission time lengths of the N first devices, and data transmission time windows of the N first devices, where the N offsets are determined based on data transmission time lengths of the N first devices and data transmission time windows of the N first devices.

[0175] In a possible design, the start position of the data transmission time window of the i-th first device is determined based on the minimum value of the data processing delay of the i-th first device, and the end position of the data transmission time window of the i-th first device is determined based on the maximum value of the data processing delay of the i-th first device.

[0176] In a possible design, the start position of the data transmission time window of the i-th first device is determined based on the greater of the minimum data processing delay of the i-th first device and the difference between the earliest time point at which the second device receives data and the minimum transmission delay between the i-th first device and the second device, and the end position of the data transmission time window of the i-th first device is determined based on the smaller of the maximum data processing delay of the i-th first device and the difference between the latest time point at which the second device receives data and the maximum transmission delay between the i-th first device and the second device.

[0177] In a possible design, the data transmission time length of the i-th first device is determined based on the average amount of data transmitted by the i-th first device to the second device and the data transmission rate of the i-th first device.

[0178] In a possible design, the data transmission time length of the i-th first device is a predicted value.

[0179] In a possible design, N first devices may send data to the same second device, or N first devices may send data to different second devices.

[0180] In a possible design, the transceiver 1205 is configured to transmit N pieces of first information to N first devices, where the N first devices have a one-to-one correspondence with the N pieces of first information, and the first information corresponding to the i-th first device includes an offset corresponding to the i-th first device and a data transmission time window of the i-th first device, or a data transmission start time of the i-th first device within the data transmission time window of the i-th first device.

[0181] In another example, the processor 1201 invokes the memory 1202 to obtain a data transmission time length of M1 and a data transmission time window of M1, where the data transmission time length of M1 is a time length for a second device to transmit data to the first device of M1, and the data transmission time window of M1 is a time window for the second device to transmit data to the first device of M1, and the data transmission time length of M1 has a one-to-one correspondence with the data transmission time window of M1, and M1 is a positive integer greater than or equal to 2; and based on the data transmission time length of M1 and the data transmission time window of M1, determining an offset of M1, where the offset of M1 has a one-to-one correspondence with the first devices of M1, and the offset corresponding to the jth first device among the first devices of M1 is for determining the data transmission start time of the second device in the jth data transmission time window among the data transmission time windows of M1, and the offset of M1 allows the time at which the data transmitted by the second device to the first device of M1 arrives at the third device to be different, and the first device of M1 is connected to the third device, and j is a positive integer, and j is any one of 1 to M1.

[0182] In a possible design, processor 1201 is to acquire a data transmission time length of M2 and a data transmission time window of M2, where the data transmission time length of M2 is a time length for a fourth device to transmit data to a first device of M2, the data transmission time window of M2 is a time window for the fourth device to transmit data to the first device of M2, the data transmission time length of M2 has a one-to-one correspondence with the data transmission time window of M2, M2 is a positive integer, and the fourth device and the second device are connected to a fifth device; and determine an offset of M1 and an offset of M2 based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2, when an offset of M1 is determined based on the data transmission time length of M1 and the data transmission time window of M1. and the offset of M2 is in one-to-one correspondence with the first devices of M2, and the offset corresponding to the kth first device among the first devices of M2 is for determining a data transmission start time point of the fourth device in the kth data transmission time window among the data transmission time windows of M2, where k is a positive integer, and k is any one of 1 to M2, and the offset of M1 and the offset of M2 enable the time points at which data transmitted by the second device to the first device of M1 arrives at the third device to be different, the time points at which data transmitted by the fourth device to the first device of M2 arrives at the third device to be different, and the time points at which data transmitted by the second device arrives at the fifth device to be different from the time points at which data transmitted by the fourth device arrives at the fifth device, and the first device of M2 is connected to the third device.

[0183] In a possible design, processor 1201 is configured to determine the M1 offset and the M2 offset based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, the data transmission time window of M2, a transmission delay between the second device and the fifth device, and a transmission delay between the fourth device and the fifth device, when the M1 offset and the M2 offset are determined based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2.

[0184] In a possible design, the start position of the jth data transmission time window in M1's data transmission time window is determined based on the sum of the minimum delay corresponding to the data processing and data buffering capabilities of the jth first device and the maximum transmission delay between the second device and the jth first device, and the end position of the jth data transmission time window in M1's data transmission time window is determined based on the sum of the maximum delay corresponding to the data processing and data buffering capabilities of the jth first device and the minimum transmission delay between the second device and the jth first device.

[0185] In a possible design, the jth data transmission time length among the data transmission time lengths of M1 is determined based on the average amount of data transmitted by the second device to the jth first device and the data transmission rate of the second device.

[0186] In a possible design, transceiver 1205 is configured to transmit data to M1 first devices individually based on the M1 offset.

[0187] In the embodiments of the present application, unless otherwise specified or there is no logical contradiction, the terms and / or descriptions in different embodiments are consistent and may be cross-referenced, and the technical features in different embodiments may be combined to form a new embodiment based on the internal logical relationship of the different embodiments.

[0188] In this application, at least one means one or more, and more than one means two or more. The term "and / or" describes an association relationship between related objects and indicates that three relationships may exist. For example, A and / or B can represent the cases where only A is present, where both A and B are present, and where only B is present, and A and B may be singular or plural. In the text description of this application, the character " / " indicates an "or" relationship between related objects. In the formulas of this application, the character " / " indicates a "divide by" relationship between related objects.

[0189] It can be understood that various numbers in the embodiments of the present application are only used for distinction to facilitate description, and are not used to limit the scope of the embodiments of the present application. The sequence numbers of the above processes do not imply the execution order, and the execution order of the processes should be determined based on the functions and internal logic of the processes. [Explanation of symbols]

[0190] 100 Wireless Access Network 200 Core Network 110a RAN nodes, network elements, base stations 110b RAN node, network element 120a Terminal, network element 120b Terminal, Network Element 120c Terminal, Network Element 120d Terminal, network element 120e terminal, network element 120f Terminal, network element 120g terminals, network elements 120h Terminal, Network Element 120i terminals, network elements 120j terminal, network element 1000 Communication Systems 1200 Communication Equipment 1201 processor 1202 memory 1203 Program 1204 Program 1205 transceiver 1206 Antenna 1207 AI Module 1208 AI Module

Claims

1. acquiring data transmission time lengths and data transmission time windows of N first devices in a network, wherein the data transmission time lengths of the N first devices have a one-to-one correspondence with the data transmission time windows of the N first devices, where N is a positive integer equal to or greater than 1, and the N first devices are connected to a third device in the network; determining N offsets based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, wherein the N offsets have a one-to-one correspondence with the N first devices; Including, The offset corresponding to the i-th first device among the N first devices is for determining a data transmission start time point of the i-th first device in a data transmission time window of the i-th first device, and the N offsets allow the data transmitted by the N first devices to arrive at the third device at different times, where i is a positive integer and is any one of 1 to N; Communication method.

2. determining the third device based on topology information of the network, the topology information of the network including connection relationships between the third device, a fourth device, and the N first devices, the third device being connected to the fourth device and M first devices among the N first devices, the number of nodes separating the third device and the second device being less than the number of nodes separating the fourth device and the second device, M being less than N, and M being a positive integer; The method of claim 1 further comprising:

3. 3. The method of claim 2, wherein K first devices among the N first devices are connected to the fourth device, and the offsets of each of the K first devices in the N offsets allow data transmitted by the K first devices to arrive at the fourth device at different times, where K is less than N and K is a positive integer.

4. determining the N offsets based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, determining the N offsets based on transmission delays between the N first devices and the third device, the data transmission time lengths of the N first devices, and the data transmission time windows of the N first devices; 4. The method of claim 1, comprising:

5. 5. A method according to claim 1, wherein the start position of the data transmission time window of the i-th first device is determined based on a minimum value of the data processing delay of the i-th first device, and the end position of the data transmission time window of the i-th first device is determined based on a maximum value of the data processing delay of the i-th first device.

6. 5. The method of claim 1, wherein the start position of the data transmission time window of the i-th first device is determined based on the larger of the minimum value of the data processing delay of the i-th first device and the difference between the earliest time point at which the second device receives data and the minimum value of the transmission delay between the i-th first device and the second device, and the end position of the data transmission time window of the i-th first device is determined based on the smaller of the maximum value of the data processing delay of the i-th first device and the difference between the latest time point at which the second device receives the data and the maximum value of the transmission delay between the i-th first device and the second device.

7. 7. The method according to claim 1, wherein the data transmission time length of the i-th first device is determined based on an average amount of data transmitted by the i-th first device to the second device and a data transmission rate of the i-th first device.

8. The method according to claim 1 , wherein the data transmission time length of the i-th first device is a predicted value.

9. The method of claim 1 , wherein the N first devices transmit the data to the same second device, or the N first devices transmit the data to different second devices.

10. transmitting N pieces of first information to the N first devices, wherein the N first devices have a one-to-one correspondence with the N pieces of first information, and the first information corresponding to the i-th first device includes the offset corresponding to the i-th first device and the data transmission time window of the i-th first device, or the data transmission start time of the i-th first device within the data transmission time window of the i-th first device; The method of any one of claims 1 to 9, further comprising:

11. acquiring a data transmission time length of M1 and a data transmission time window of M1, wherein the data transmission time length of M1 is a time length for a second device to transmit data to the first device of M1, the data transmission time window of M1 is a time window for the second device to transmit the data to the first device of M1, the data transmission time length of M1 has a one-to-one correspondence with the data transmission time window of M1, and M1 is a positive integer equal to or greater than 2; determining an offset of M1 based on the data transmission time length of M1 and the data transmission time window of M1, wherein the offset of M1 has a one-to-one correspondence with the first device of M1; Including, The offset corresponding to the j-th first device among the M1 first devices is for determining the data transmission start time of the second device in the j-th data transmission time window among the M1 data transmission time windows, and the M1 offset allows the data transmitted by the second device to the M1 first device to arrive at a third device at different times, and the M1 first device is connected to the third device, j is a positive integer, and j is any one of 1 to M1; Communication method.

12. acquiring a data transmission time length of M2 and a data transmission time window of M2, wherein the data transmission time length of M2 is a time length for a fourth device to transmit data to a first device of M2, the data transmission time window of M2 is a time window for the fourth device to transmit the data to the first device of M2, the data transmission time length of M2 has a one-to-one correspondence with the data transmission time window of M2, M2 is a positive integer, and the fourth device and the second device are connected to a fifth device; determining an offset of the M1 based on a data transmission time length of the M1 and a data transmission time window of the M1; and the determining step further comprises: determining an offset of M1 and an offset of M2 based on the data transmission time length of M1, the data transmission time window of M1, the data transmission time length of M2, and the data transmission time window of M2; Including, The offset of M2 has a one-to-one correspondence with the first devices of M2, and the offset corresponding to the kth first device among the first devices of M2 is for determining the data transmission start time of the fourth device in the kth data transmission time window among the data transmission time windows of M2, where k is a positive integer, and k is any one of 1 to M2; The offset of M1 and the offset of M2 allow the data sent by the second device to the first device of M1 to arrive at the third device at different times, the data sent by the fourth device to the first device of M2 to arrive at the third device at different times, the time at which the data sent by the second device arrives at the fifth device to be different from the time at which the data sent by the fourth device arrives at the fifth device, and the first device of M2 is connected to the third device; The method of claim 11.

13. determining an offset of the M1 and an offset of the M2 based on a data transmission time length of the M1, a data transmission time window of the M1, a data transmission time length of the M2, and a data transmission time window of the M2; determining an offset of M1 and an offset of M2 based on a data transmission time length of M1, a data transmission time window of M1, a data transmission time length of M2, a data transmission time window of M2, a transmission delay between the second device and the fifth device, and a transmission delay between the fourth device and the fifth device; 13. The method of claim 12, comprising:

14. 14. A method according to claim 11, wherein the start position of the jth data transmission time window in the data transmission time window of M1 is determined based on the sum of the minimum value of delay corresponding to the data processing and data buffering capabilities of the jth first device and the maximum value of transmission delay between the second device and the jth first device, and the end position of the jth data transmission time window in the data transmission time window of M1 is determined based on the sum of the maximum value of the delay corresponding to the data processing and data buffering capabilities of the jth first device and the minimum value of the transmission delay between the second device and the jth first device.

15. 15. The method of claim 11, wherein the jth data transmission time length among the data transmission time lengths of M1 is determined based on an average amount of data transmitted by the second device to the jth first device and a data transmission rate of the second device.

16. separately transmitting the data to the first device of the M1 based on the offset of the M1.

15. The method of any one of claims 11 to 14, further comprising:

17. Acquiring, by a second device, data transmission time lengths of N first devices in a network and data transmission time windows of the N first devices, wherein the data transmission time lengths of the N first devices have a one-to-one correspondence with the data transmission time windows of the N first devices, where N is a positive integer equal to or greater than 1, and the N first devices are connected to a third device in the network; determining, by the second device, N offsets based on the data transmission time lengths of the N first devices and the data transmission time windows of the N first devices, wherein the N offsets have a one-to-one correspondence with the N first devices, and an offset corresponding to an i-th first device among the N first devices is for determining a data transmission start time of the i-th first device in the data transmission time window of the i-th first device, and the N offsets allow the data transmitted by the N first devices to arrive at the third device at different times, where i is a positive integer and is any one of 1 to N; a step of transmitting, by the second device, N pieces of first information to the N first devices, wherein the N first devices have a one-to-one correspondence with the N pieces of first information, and the first information corresponding to the i-th first device includes the offset corresponding to the i-th first device and the data transmission time window of the i-th first device, or the data transmission start time of the i-th first device within the data transmission time window of the i-th first device; transmitting, by each of the N first devices, data to the second device based on corresponding first information; A communication method, including:

18. A communication device comprising a unit configured to perform the method of any one of claims 1 to 16.

19. a processor and a memory, the memory is configured to store computer-executable instructions; The processor is configured to execute the computer-executable instructions stored in the memory to enable the communication device to perform the method of any one of claims 1 to 16. Communication equipment.

20. A chip coupled to a memory, the chip reading a computer program stored in the memory to perform the method of any one of claims 1 to 16.

21. 17. A computer-readable storage medium having stored thereon a computer program or instructions which, when executed by a communication device, perform the method of any one of claims 1 to 16.

22. A computer program product, said computer program product comprising a computer program which, when run on an apparatus, performs the method of any one of claims 1 to 16.

23. 17. A communication system comprising a plurality of first devices, a second device and a third device, the plurality of first devices being connected to the third device, the second device performing the method of any one of claims 1 to 16.

24. 24. The communication system of claim 23, wherein the first device is a radio unit, the second device is a distributed unit, and the third device is a first switch.

Images