Communication method and device

Abstract

A communication method and device, the method comprising: acquiring data transmission durations of N first devices and data transmission time windows of the N first devices in a network, the data transmission durations of the N first devices being in one-to-one correspondence with the data transmission time windows of the N first devices; the N first devices are connected to a third device in the network; determining N offsets according to the data transmission duration of the N first devices and the data transmission time windows of the N first devices; the N offsets are in one-to-one correspondence with the N first devices; the N offsets enable the time for the data sent by the N first devices to reach the third device to be different. By adopting the above design, the flow peak-to-average ratio of the convergence link between the third device and the second device can be reduced, and the bandwidth utilization rate of the convergence link can be improved.

Description

Communication method and device Technical Field

[0001] The embodiments of the present application relate to the field of wireless communications, and in particular to a communication method and apparatus. Background Art

[0002] In converged networking scenarios, the transmission timing of uplink and downlink data must adhere to certain constraints. Specifically, the distributed unit (DU) and radio unit (RU) must be time-synchronized, transmitting and receiving data according to the same radio scheduling cycle and cycle boundaries. Therefore, data received by multiple RUs is sent concurrently to the switch at the same cycle, and then sent by the switch to the DU. Similarly, data sent by the DU to multiple RUs is also sent concurrently to the switch at the same cycle, and then sent by the switch to the corresponding RUs.

[0003] For example, in the converged networking scenario shown in Figure 1, multiple RUs are connected to a switch, which in turn is connected to the DUs. Traffic on the converged link (the transmission link between the DUs and the switch) experiences alternating peaks and valleys following the wireless scheduling cycle, but the average bandwidth is low, as shown in Figure 2. This results in low physical bandwidth utilization and a high upper limit on physical bandwidth.

[0004] Reducing the peak-to-average traffic ratio by increasing the switch cache will increase switch costs, increase forwarding delays, and increase delay uncertainty, further increasing the cache overhead of the DU and RU.

[0005] Summary of the Invention

[0006] The present application provides a communication method and apparatus to solve the problem of low physical bandwidth utilization of an aggregated link and high upper limit requirement for physical bandwidth in an aggregated networking scenario.

[0007] In a first aspect, the present application provides a communication method that can be performed by a second device or a module (such as a chip) in the second device. The method includes: obtaining data transmission durations and data transmission time windows of N first devices in a network, wherein the data transmission durations of the N first devices correspond one-to-one to the data transmission time windows of the N first devices, and N is a positive integer greater than or equal to 2; the N first devices are connected to a third device in the network; and N offsets are determined based on the data transmission durations of the N first devices and the data transmission time windows of the N first devices. The N offsets correspond one-to-one to the N first devices. The offset corresponding to the i-th first device among the N first devices is used to determine the data transmission start time of the i-th first device within the data transmission time window of the i-th first device. The N offsets cause the time when data sent by the N first devices reaches the third device to be different, and i is a positive integer, i being any one from 1 to N.

[0008] By adopting the above design, N offsets are determined based on the acquired data transmission duration of the N first devices and the data transmission time window of the N first devices, so that the N offsets correspond to different times when the data sent by the N first devices arrive at the third device. This can reduce the peak-to-average traffic ratio of the aggregation link between the third device and the second device, improve the bandwidth utilization of the aggregation link, reduce data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0009] In one possible design, the third device is determined based on the topology information of the network, the topology information of the network includes the connection relationship between the third device, the fourth device and N first devices, the third device connects the fourth device and M first devices among the N first devices, the number of nodes between the third device and the second device is less than the number of nodes between the fourth device and the second device, M is less than N, and M is a positive integer.

[0010] With the above design, it is possible to determine, based on the topology information of the network, a device with a smaller number of nodes spaced apart from the second device in the network.

[0011] In one possible design, K first devices out of N first devices are connected to a fourth device, and the offsets of the K first devices out of the N offsets make the time at which data sent by the K first devices arrive at the fourth device different, K is less than N, and K is a positive integer.

[0012] By adopting the above design, it can be achieved that the data sent by the K first devices connected to the fourth device arrive at the fourth device at different times.

[0013] In one possible design, when determining N offsets based on the data transmission duration of N first devices and the data transmission time windows of N first devices, the N offsets are determined based on the transmission delay between the N first devices and the third device, the data transmission duration of the N first devices, and the data transmission time windows of the N first devices.

[0014] With the above design, N offsets can be determined in combination with the transmission delay between the N first devices and the third device, further ensuring that the time when the data sent by the N first devices corresponding to the N offsets arrives at the third device is different.

[0015] In one possible design, the starting position of the data sending 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 ending position of the data sending 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.

[0016] With the above design, the buffering capacity of the second device is not considered, and no data buffering delay is performed inside the first device. The above solution for determining the data transmission time window is relatively simple.

[0017] In one possible design, the starting position of the data sending time window of the i-th first device is determined based on the larger value of the difference between the earliest time when 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 minimum value of the data processing delay of the i-th first device; the ending position of the data sending time window of the i-th first device is determined based on the smaller value of the difference between the latest time when the second device receives data and the maximum value of the transmission delay between the i-th first device and the second device, and the maximum value of the data processing delay of the i-th first device.

[0018] With the above design, the earliest time the second device receives data and the latest time the second device receives data depend on the buffering capacity of the second device. The data sending time window determined by the above solution is more accurate.

[0019] In one possible design, the duration of data transmission by the i-th first device is determined according to an average amount of data sent by the i-th first device to the second device and a data transmission rate of the i-th first device.

[0020] In one possible design, the duration of data transmission by the i-th first device is a predicted value.

[0021] In one possible design, N first devices send data to the same second device, or N first devices send data to different second devices.

[0022] With the above design, there is no restriction on whether N first devices send data to the same second device.

[0023] In a possible design, it also includes: sending N first information to N first devices, the N first devices correspond one-to-one to the N 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 sending time window of the i-th first device, or the data sending start time of the i-th first device within the data sending time window of the i-th first device.

[0024] With the above design, the corresponding offset and data transmission time window, or the data transmission start time within the data transmission time window, can be notified to each of the N first devices, so that the data sent by the N first devices arrive at the third device at different times.

[0025] In a second aspect, the present application provides a communication method, which can be executed by a second device or a module (such as a chip) in the second device. The method includes: obtaining M1 data transmission durations and M1 data transmission time windows, where the M1 data transmission duration is the duration for a second device to send data to M1 first devices, and the M1 data transmission time window is the time window for the second device to send data to the M1 first devices, the M1 data transmission duration and the M1 data transmission time window correspond one-to-one, and M1 is a positive integer greater than or equal to 2; determining M1 offsets according to the M1 data transmission durations and the M1 data transmission time window, and the M1 offsets correspond one-to-one to the M1 first devices; wherein the offset corresponding to the jth first device among the M1 first devices is used to determine the data transmission start time of the second device within the jth data transmission time window in the M1 data transmission time window, and the M1 offset makes the time when the data sent by the second device to the M1 first device arrives at the third device different, and the M1 first device is connected to the third device, j is a positive integer, and j is any one from 1 to M1.

[0026] With the above design, M1 offsets are determined based on the duration of the second device sending data to M1 first devices and the time window in which the second device sends data to M1 first devices. The M1 offset makes the time when the data sent by the second device to the M1 first devices arrive at the third device different, thereby reducing the peak-to-average traffic ratio of the aggregation link between the third device and the second device, improving the bandwidth utilization of the aggregation link, and reducing data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0027] In one possible design, M2 data transmission durations and M2 data transmission time windows are obtained, where the M2 data transmission duration is the duration for the fourth device to send data to the M2 first devices, the M2 data transmission time window is the time window for the fourth device to send data to the M2 first devices, the M2 data transmission duration and the M2 data transmission time window correspond one to one, and M2 is a positive integer; the fourth device and the second device are connected to the fifth device; when determining M1 offsets according to the M1 data transmission duration and the M1 data transmission time window, the M1 offset and M2 offsets; wherein, the M2 offsets correspond one-to-one to the M2 first devices; the offset corresponding to the kth first device among the M2 first devices is used to determine the data sending start time of the fourth device within the kth data sending time window among the M2 data sending time windows, k is a positive integer, and k is any one from 1 to M2; the M1 offsets and the M2 offsets make the time when the data sent by the second device to the M1 first devices arrive at the third device different, and the time when the data sent by the fourth device to the M2 first devices arrives at the third device different, and the time when the data sent by the second device arrives at the fifth device is different from the time when the data sent by the fourth device arrives at the fifth device, and the M2 first devices are connected to the third device.

[0028] With the above design, when the fourth device and the second device are connected to the fifth device, the M1 offsets and the M2 offsets make the data sent by the second device to the M1 first devices arrive at the third device at different times, and the data sent by the fourth device to the M2 first devices arrive at the third device at different times, and the time when the data sent by the second device arrives at the fifth device is different from the time when the data sent by the fourth device arrives at the fifth device, thereby improving the bandwidth utilization of the aggregation link, reducing data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0029] In one possible design, when determining M1 offsets and M2 offsets based on M1 data sending durations, M1 data sending time windows, M2 data sending durations, and M2 data sending time windows, the M1 offsets and M2 offsets are determined based on M1 data sending durations, M1 data sending time windows, M2 data sending durations, M2 data sending time windows, the transmission delay between the second device and the fifth device, and the transmission delay between the fourth device and the fifth device.

[0030] By adopting the above design, M1 offsets and M2 offsets can be determined in combination with the transmission delay between the second device and the fifth device and the transmission delay between the fourth device and the fifth device, further ensuring that the time when the data sent by the second device arrives at the fifth device is different from the time when the data sent by the fourth device arrives at the fifth device.

[0031] In one possible design, the starting position of the j-th data sending time window among the M1 data sending time windows is determined based on the sum of the minimum delay corresponding to the data processing and data caching capabilities of the j-th first device and the maximum transmission delay between the second device and the j-th first device, and the ending position of the j-th data sending time window among the M1 data sending time windows is determined based on the sum of the maximum delay corresponding to the data processing and data caching capabilities of the j-th first device and the minimum transmission delay between the second device and the j-th first device.

[0032] In one possible design, the j-th data transmission duration among the M1 data transmission durations is determined according to an average amount of data sent by the second device to the j-th first device and a data transmission rate of the second device.

[0033] The duration of M1 data transmission may be a predicted value.

[0034] In one possible design, data is sent to M1 first devices respectively according to M1 offsets.

[0035] In a third aspect, an embodiment of the present application provides a communication device, which may be a second device or a module (such as a chip) in the second device. The device has the function of implementing any of the implementation methods of the first to second aspects above. The function can be implemented by hardware or by hardware executing corresponding software implementations. The hardware or software includes one or more modules corresponding to the above functions.

[0036] In a fourth aspect, an embodiment of the present application provides a communication device comprising a processor and a memory; the memory is used to store computer instructions, and when the device is running, the processor executes the computer instructions stored in the memory so that the device executes any implementation method in the above-mentioned first to second aspects.

[0037] In a fifth aspect, an embodiment of the present application provides a communication device, comprising a unit or means for executing each step of any implementation method in the above-mentioned first to second aspects.

[0038] In a sixth aspect, an embodiment of the present application provides a communication device, comprising a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute any of the implementation methods in the first to second aspects above. The processor comprises one or more.

[0039] In a seventh aspect, an embodiment of the present application provides a communication device, comprising a processor coupled to a memory, the processor configured to call a program stored in the memory to execute any of the implementation methods described in aspects 1 to 2 above. The memory may be located within or outside the device. The processor may be one or more.

[0040] In an eighth aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein instructions are stored in the computer-readable storage medium, which, when executed on a communication device, enables any implementation method in the above-mentioned first to second aspects to be executed.

[0041] In the ninth aspect, an embodiment of the present application further provides a computer program product, which includes a computer program or instructions. When the computer program or instructions are run by a communication device, any implementation method in the above-mentioned first to second aspects is executed.

[0042] In the tenth aspect, an embodiment of the present application further provides a chip system, comprising: a processor for executing any implementation method in the above-mentioned first to second aspects.

[0043] In the eleventh aspect, an embodiment of the present application also provides a communication system, comprising: a second device for executing any implementation method of the above-mentioned first aspect to the second aspect, multiple first devices, and a third device, wherein the multiple first devices are connected to the third device. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] FIG1 is a schematic diagram of a converged networking scenario in this application;

[0045] FIG2 is a flow diagram of the aggregation link in this application;

[0046] FIG3 is a schematic diagram of a possible, non-limiting system for use in the present application;

[0047] FIG4A is a schematic diagram of another converged networking scenario in this application;

[0048] FIG4B is a schematic diagram of another converged networking scenario in this application;

[0049] FIG4C is a schematic diagram of a ring network in the present application;

[0050] FIG5 is a schematic diagram of various delays in the uplink and downlink directions in this application;

[0051] FIG6 is a flowchart illustrating an overview of a communication method in the present application;

[0052] FIG7 is a schematic diagram of another converged networking scenario in this application;

[0053] FIG8 is a schematic diagram of determining an offset in the uplink direction in the present application;

[0054] FIG9 is a flowchart illustrating another communication method in the present application;

[0055] FIG10 is a schematic diagram of determining an offset in the downlink direction in the present application;

[0056] FIG11 is a flow diagram of a converged link obtained by using an embodiment of the present application;

[0057] FIG12 is a schematic structural diagram of a possible communication device in this application. DETAILED DESCRIPTION

[0058] The technical solutions in the embodiments of the present application will be described clearly and completely below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, not all of the embodiments. The terms "first", "second" and corresponding terminology labels in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the terms used in this way are interchangeable where appropriate, and this is merely a way of distinguishing objects of the same properties when describing the embodiments of the present application. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, so that a process, method, system, product or device that includes a series of units is not necessarily limited to those units, but may include other units that are not clearly listed or inherent to these processes, methods, products or devices.

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

[0060] The RAN 100 may be a cellular system related to the Third Generation Partnership Project (3GPP), such as a 4G or 5G mobile communication system, or a future-oriented evolutionary system (such as a 6G mobile communication system). The RAN 100 may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN 100 may also be a communication system that integrates two or more of the above systems.

[0061] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, forms part of the communication system and facilitates wireless access for terminal 120. Multiple RAN nodes 110 in communication system 1000 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 3 can be a helicopter or drone, which can be configured as a mobile base station. For terminal 120j accessing RAN 100 via network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functionality, and network elements 120a-120j can be understood as communication devices with terminal functionality.

[0062] In one possible scenario, a 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 in a sixth-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system. A RAN node may be a macro base station (such as 110a in Figure 3 ), a micro base station or an indoor station (such as 110b in Figure 3 ), a relay node or a donor node, or a wireless controller in a CRAN scenario. Alternatively, a RAN node may be a server, a wearable device, a vehicle, or an onboard device. For example, the access network device in vehicle-to-everything (V2X) technology may be a roadside unit (RSU).

[0063] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes implement part of the functions of the base station respectively. For example, the RAN node can be a centralized unit (CU), DU, CU-control plane (CP), CU-user plane (UP), or RU. The CU and DU can be set separately, or they can be included in the same network element, such as the baseband unit (BBU). The RU can 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).

[0064] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0065] 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, smart city, etc. A terminal may be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, drone, helicopter, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of the present application do not limit the device form of the terminal.

[0066] The following is an explanation of the technical concepts that may be involved in this application:

[0067] Fronthaul: The data transmission path between DU and RU.

[0068] Downlink direction: data transmission direction from DU to RU.

[0069] Uplink direction: data transmission direction from RU to DU.

[0070] Radio scheduling period: This includes the subframe period and the symbol period. The subframe period corresponds to the wireless user data scheduling period as described in the 3GPP specification. For example, the subframe period is 1 millisecond (ms) or 0.5 ms. The symbol period corresponds to the transmission time of an orthogonal frequency division multiplexing (OFDM) symbol as described in the 3GPP specification. For example, the symbol period is 0.66 microseconds (µs) or 0.33 µs.

[0071] Peak-to-average ratio: The ratio of the peak flow rate to the mean flow rate, which represents the uniformity of the flow rate.

[0072] The embodiments of the present application can be applied to a centralized radio access network (CRAN), where a CRAN is also called an aggregation network. In a CRAN deployment, the DU is located in a central computer room, and the RUs are distributed at remote sites, increasing the distance between the DUs and RUs. A characteristic of the CRAN networking topology is that one DU connects to multiple RUs. Therefore, link aggregation devices are often added between the DUs and RUs to save long-distance optical fiber. Link aggregation devices include passive wavelength division multiplexing devices and active switch devices. Hereinafter, link aggregation devices are referred to as switches.

[0073] In addition, the embodiments of the present application can also be applied to other networks, and the present application does not limit this. The following description only takes the converged network as an example.

[0074] The following examples illustrate several possible converged network scenarios:

[0075] Scenario 1: The aggregation network includes a DU, multiple RUs, and multiple switches. Each switch connects to at least two RUs. 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. This is shown in Figures 1 and 4A.

[0076] Among the multiple switches, there may be at least one root switch, and the root switch is connected to the DU, as shown in FIG4A .

[0077] In FIG4A , RU1 to RU3 are connected to switch A, RU4 to RU6 are connected to switch B, switch A is connected to switch B, switch B is connected to DU, RU7 to RU9 are connected to switch C, and switch C is connected to DU.

[0078] Scenario 2: The aggregation network includes multiple DUs, multiple RUs, and multiple switches. Switches connected to DUs are also called DU-side switches, and multiple DUs can be connected to the same switch. Switches connected to RUs are also called RU-side switches, and RU-side switches connect to at least two RUs. The link between a DU-side switch and an RU-side switch is called an aggregation link.

[0079] As shown in FIG4B , DU1 and DU2 are connected to switch A, RU1 , RU2 , and RU3 are connected to switch B, and switch A is connected to switch B.

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

[0081] In FIG4C , the converged network includes seven switches. Switches 1 to 7 form a ring network, wherein switch 1 is connected to three DUs, and each switch except switch 1 is connected to three RUs.

[0082] 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.

[0083] The present application proposes the concept of time windows for uplink data transmission and downlink data transmission respectively, wherein the time window for uplink data transmission refers to the time window for RU to send data, that is, the time window for RU to send data to DU, which can also be called the data sending time window of RU. When RU sends data to different DUs, the data sending time window of RU may be different. The time window for downlink data transmission refers to the time window for DU to send data, that is, the time window for DU to send data to RU, which can also be called the data sending time window of DU. When DU sends data to different RUs, the data sending time window of DU may be different.

[0084] (1) RU data transmission time window

[0085] In the uplink direction, the terminal needs to send data at the cycle boundary of the radio scheduling period. The RU processes the data received from the terminal and sends the processed data to the DU. Therefore, the RU's data transmission time window is after the cycle boundary.

[0086] The RU's data transmission time window is related to the transmission delay (T34) of the RU sending data to the DU, the delay (T3a) of the RU processing data, and the data buffering capacity of the DU, as shown in Figure 5. The data buffering capacity of the DU is an optional factor, and the RU's data transmission time window can be determined by the DU. It is understood that the RU's data transmission time window can also be related to other factors, which is not limited in this application.

[0087] In the uplink direction, the RU's data transmission time window can be determined using, but not limited to, the following methods:

[0088] Method 1: If the data buffering capability of the DU is not considered, that is, when no data buffering delay is performed within the RU, all data DUs sent by the RU can be received. The RU's data transmission time window can be determined as follows:

[0089] The starting position of the RU's data transmission time window is determined according to the minimum value of the RU's data processing delay, and the ending position of the RU's data transmission time window is determined according to the maximum value of the RU's data processing delay.

[0090] For example, the maximum value of the RU's data processing delay (T3a) is Ta3max, and the minimum value is Ta3min. Therefore, the RU's data transmission time window is [Ta3min, Ta3max]. That is, the RU does not cache data, but processes the data received from the terminal. The start and end positions of the RU's data transmission time window are determined solely by the RU's data processing delay.

[0091] Accordingly, the DU also has a data reception time window, allowing multiple packets within the same period to arrive at different times within the time window. The DU data reception time window is [Ta4min, Ta4max], where Ta4min = Ta3min + T34min, and Ta4max = Ta3max + T34max.

[0092] Method 2: Taking into account the DU's data buffering capability, that is, the DU's inherent capability, the RU's data transmission time window can be determined as follows:

[0093] The starting position of the RU's data transmission time window is determined by the larger value of the difference between the earliest time the DU receives data and the minimum value of the transmission delay between the RU and the DU, and the minimum value of the RU's data processing delay. The ending position of the RU's data transmission time window is determined by the smaller value of the difference between the latest time the DU receives data and the maximum value of the transmission delay between the RU and the DU, and the maximum value of the RU's data processing delay.

[0094] For example, the maximum value of the RU's data processing delay (T3a) is Ta3max, and the minimum value is Ta3min. The earliest time a DU receives data is Ta4min*, and the latest time a DU receives data is Ta4max*. The starting position (i.e., the left boundary) of the RU's data transmission time window is the larger value of Ta4min*-T34min or Ta3min. The ending position (i.e., the right boundary) of the RU's data transmission time window is the smaller value of Ta4max*-T34max or Ta3min.

[0095] (2) DU data transmission time window

[0096] In the downlink direction, the RU needs to send data at the cycle boundary of the radio scheduling cycle. Therefore, the DU must send data to the RU before the cycle boundary. The RU receives the data, processes it, and after a certain delay compensation, sends the data through the antenna port at the cycle boundary. Therefore, the DU's data transmission time window is before the cycle boundary.

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

[0098] In one possible implementation, the starting 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 caching capabilities and the maximum transmission delay between the DU and the RU, and the ending 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 caching capabilities and the minimum transmission delay between the DU and the RU.

[0099] In the downlink direction, if the data arrives at the RU earlier, the RU will buffer the data for a certain period of time, that is, perform a certain amount of delay compensation, so that the time when the data finally arrives at the antenna port is the cycle boundary.

[0100] The RU's delay compensation capability is reflected in the variable range of T2a. T2amin represents the minimum value of T2a, and T2amax represents the maximum value of T2a. The difference between T2amax and T2amin represents the RU's delay compensation capability. Assume that the maximum transmission delay (T12) of data sent from the DU to the RU is T12max, and the minimum is T12min. In the downlink direction, the starting position (left boundary) of the DU's data transmission time window is T2amax + T12min. In other words, if the DU sends data ahead of time by more than T2amax + T12min, the RU's delay compensation capability is insufficient, and the data may arrive at the antenna port before the cycle boundary. The ending position (right boundary) of the DU's data transmission time window is T2amin + T12max. In other words, if the DU sends data ahead of time by less than T2amin + T12max, even if the RU does not compensate, the data will arrive at the antenna port after the cycle boundary. Therefore, after capability negotiation between the DU and the RU, the DU can calculate the data transmission time window of the DU as [T1amax, T1amin]. Here, T1amax and T1amin are both expressed as the advance amount of the cycle: T1amax = T2amax + T12min, and T1amin = T2amin + T12max.

[0101] It is understood that to accommodate different intermediate transmission delays (T12 and T34), jitter associated with these delays, and to accommodate interconnection between different DU and RU models, both the DU and RU must have a certain data buffering capacity. The above methods for determining the RU's data transmission time window and the DU's data transmission time window are provided for illustrative purposes only and are not intended to limit this application.

[0102] Based on this, the present application provides a communication method to solve the problem of low physical bandwidth utilization of the converged link in the converged networking scenario and high upper limit requirements for the physical bandwidth. Among them, when N RUs send data to the same DU, the execution subject of the following method can be the DU. When N RUs send data to at least two DUs, the execution subject of the following method can be any one of the at least two DUs, or a designated DU of the at least two DUs. The designated DU can be agreed in advance or determined by negotiation between at least two DUs. This application does not limit this.

[0103] Specifically, as shown in FIG6 , the method includes:

[0104] Step 600: Obtain data transmission durations and data transmission time windows of N RUs in the network, where the data transmission durations of the N RUs correspond one-to-one to 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.

[0105] For example, taking the i-th RU among N RUs as an example, the data transmission duration of the i-th RU is determined based on the average amount of data sent by the i-th RU to the DU and the data transmission rate of the i-th RU. Here, i is a positive integer, and i is any value from 1 to N.

[0106] Exemplarily, when estimating the average amount of data sent by the i-th RU to the DU, the DU may refer to at least one of the wireless service load, cell measurement results, traffic model, cell historical data, or cell configuration information. In addition, the average amount of data sent by the i-th RU to the DU may be estimated in combination with other parameters. This application does not limit this.

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

[0108] The data sent by the i-th RU to the DU is data sent by the terminal connected to the i-th RU. Therefore, the DU may not be able to obtain the exact amount of data sent by the terminal. Therefore, the data transmission duration of the i-th RU is a predicted value.

[0109] For example, the data sending time windows of N RUs can refer to the above description of the data sending time windows of RUs, which will not be repeated here.

[0110] It should be noted that N RUs can send data to the same DU, or N RUs can send data to different DUs, and this application does not limit this. For example, as shown in Figure 1, three RUs can send data to the same DU. For another example, as shown in Figure 4B, RU1 to RU3 of the five RUs can send data to DU1, and RU4 and RU5 can send data to DU2.

[0111] In addition, it is understood that all RUs in the network send data simultaneously at the cycle boundary of a wireless scheduling cycle, or some RUs in the network send data simultaneously at the cycle boundary of a wireless scheduling cycle. The N RUs in this application are RUs that send data at the same time.

[0112] For example, in the network shown in Figure 7, there are seven RUs. At the same time, RU1, RU2, and RU4 send data to the DU, while the other RUs do not. Therefore, only the data transmission duration and data transmission time window corresponding to RU1, RU2, and RU4 need to be obtained.

[0113] Regarding the N RUs connected to the first switch in the network, it should be noted that the first switch here can be the first switch to which the RUs are directly connected, or the first switch to which the RUs are indirectly connected, for example, the RUs are connected to the first switch through other switches.

[0114] In a possible implementation, any switch is selected as the first switch according to network topology information.

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

[0116] Exemplarily, when the network includes multiple switches, the multiple switches here refer to multiple RU-side switches. Then, the root switch can be determined from the multiple switches based on the network topology information, or the switch with the least number of nodes separated from the DU, or the switch with the least number of nodes separated from the switches on the DU side as the first switch.

[0117] The following uses scenarios A to C as examples for explanation:

[0118] Scenario A: As shown in Figure 1, assume that three RUs send data to the DU simultaneously. The three RUs are directly connected to a switch. In this case, the switch is the first switch.

[0119] Scenario B: As shown in Figure 7, assume that RU1, RU2, and RU4 send data to the DU simultaneously. RU1 and RU2 are directly connected to switch A. RU1 and RU2 are connected to switch B through switch A, and RU4 is directly connected to switch B.

[0120] In one example, according to the network topology information shown in FIG7 , switch A or switch B is selected as the first switch. If the first switch is switch B, the N RUs include RU1, RU2, and RU4. If the first switch is switch A, the N RUs include RU1 and RU2.

[0121] In another example, according to the topology information of the network shown in Figure 7, switch A needs to be connected to the DU through switch B, and switch B is directly connected to the DU. Therefore, the number of nodes between switch B and the DU (0) is less than the number of nodes between switch A and the DU (1), and switch B is used as the first switch.

[0122] Scenario C: As shown in Figure 4C, assume that RU1 to RU3 in switch 2 send data to DU1, RU4 to RU6 in switch 3 send data to DU3, and RU8 and RU7 in switch 4 send data to DU1. In other words, RU1 to RU8 send data simultaneously.

[0123] In one example, based on the network topology information shown in Figure 4C , switch 2, switch 3, or switch 4 is selected as the first switch. If switch 2 is the first switch, the N RUs include RU1 through RU8. If switch 3 is the first switch, the N RUs include RU4 through RU8. If switch 4 is the first switch, the N RUs include RU7 and RU8.

[0124] In another example, according to the topology information of the network shown in Figure 4C, switch 2 is directly connected to switch 1, switch 3 is separated from switch 1 by switch 2, and switch 4 is separated from switch 1 by switch 3 and switch 2. That is, the number of nodes between switch 2 and the DU is 0, the number of nodes between switch 3 and the DU is 1, and the number of nodes between switch 4 and the DU is 2. Switch B is used as the first switch.

[0125] It should be understood that the above scenarios are merely examples and are not intended to limit the present application.

[0126] It can be seen that when the first switch is the root switch, or the switch with fewer nodes between it and the DU, or the switch with fewer nodes between it and the switch on the DU side, the larger the number of RUs corresponding to it, the more RUs' data sending time can be adjusted, making the effect of reducing the peak-to-average traffic ratio of the aggregation link more obvious.

[0127] Step 610: Determine N offsets according to the data transmission duration of the N RUs and the data transmission time window of the N RUs, and the N offsets correspond to the N RUs one-to-one.

[0128] The offset corresponding to the i-th RU is used to determine the data sending start time of the i-th RU within the data sending time window of the i-th RU. The N offsets make the time when the data sent by the N RUs arrive at the first switch different.

[0129] Exemplarily, the offset corresponding to the i-th RU includes the offset of the data sending start time of the i-th RU relative to the starting position of the data sending time window of the i-th RU, or the offset of the data sending start time of the i-th RU relative to the ending position of the data sending time window of the i-th RU.

[0130] The N offsets cause the data sent by the N RUs to arrive at the first switch at different times. Alternatively, the N offsets minimize the overlap between the durations of the data transmissions of the N RUs. For example, the N offsets cause the data sent by the N RUs to start at different times, minimizing the overlap between the durations of the data transmissions of the N RUs.

[0131] Taking the networking scenario shown in Figure 1 as an example, assume that three RUs (RU1, RU2, and RU3) simultaneously send data to the DU. As shown in Figure 8, the three hollow rectangles represent the data transmission time windows of these three RUs: RU1, RU2, and RU3. The data transmission time windows of these three RUs are later than the cycle boundary. The three solid black rectangles represent the data transmission durations of these three RUs: RU1, RU2, and RU3. Three offsets are determined based on the data transmission durations and their data transmission time windows. These offsets ensure that the overlapping durations of the data transmission durations of the three RUs are less than a preset threshold, thereby ensuring that the data from these three RUs arrive at different times on the switch. Offset 1 is the offset of RU1's data transmission start time relative to the start of RU1's data transmission time window. Offset 2 is the offset of RU2's data transmission start time relative to the start of RU2's data transmission time window. Offset 3 is the offset of the data transmission start time of RU3 relative to the start position of the data transmission time window of RU3.

[0132] Furthermore, in some possible embodiments, when K RUs out of N RUs are connected to a second switch, the offsets of the K RUs out of the N offsets further cause data sent by the K RUs to arrive at the second switch at different times, where K is less than N and is a positive integer. The offsets of the K RUs cause data sent by the K RUs to arrive at the second switch at different times.

[0133] It can be understood that the offsets of the K RUs make the overlapping duration of the data transmission durations of the K RUs as short as possible. For example, the offsets of the K RUs make the start times of the K RUs sending data different, and the overlapping duration of the data transmission durations of the K RUs as short as possible.

[0134] For example, in the aforementioned scenario B, switch B can be used as the first switch based on the network topology information shown in Figure 7. Furthermore, because RU1 and RU2 are directly connected to switch A, the offsets of RU1, RU2, and RU4 cause the arrival times of data sent by RU1, RU2, and RU4 at switch B to differ from each other. The offsets of RU1 and RU2 also cause the arrival times of data sent by RU1 and RU2 at switch A to differ from each other.

[0135] For another example, in the aforementioned scenario C, switch 2 can be used as the first switch based on the network topology information shown in FIG4C . Furthermore, RU1 to RU3 are connected to switch 2, RU4 to RU6 are connected to switch 3, and RU8 and RU7 are connected to switch 4. Therefore, the offsets corresponding to RU1 to RU8 cause data sent by RU1 to RU8 to arrive at switch 2 at different times. Furthermore, the offsets corresponding to RU4 to RU6 cause data sent by RU4 to RU6 to arrive at switch 3 at different times. Furthermore, the offsets corresponding to RU7 and RU8 cause data sent by RU7 and RU8 to arrive at switch 4 at different times.

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

[0137] For example, in scenario B, as shown in Figure 7, assume that RU1, RU2, and RU4 simultaneously send data to the DU. RU1 and RU2 are directly connected to switch A. RU1 and RU2 are connected to switch B through switch A, and RU4 is directly connected to switch B. When determining the offsets corresponding to RU1, RU2, and RU4, the transmission delay between RU1 and switch A (T1A), the transmission delay between RU2 and switch A (T2A), the transmission delay between RU1 and switch B (T1B), the transmission delay between RU2 and switch B (T2B), and the transmission delay between RU4 and switch B (T4B) can also be obtained.

[0138] Assume that the offset of each RU is the offset of the RU's data transmission start time relative to the start position of the RU's data transmission time window. The start position of RU1's data transmission time window is the same as the start position of RU2's data transmission time window. If, based on actual conditions, there are requirements for the time at which each RU's data arrives at the switch, for example, RU1's data arrives at switch A earlier than RU2's data, the following describes how RU1's offset changes based on different scenarios:

[0139] If T1A=T2A, when determining the offset of RU1 and the offset of RU2, the offset of RU1 (P 10 ) is less than the offset of RU2 (P 20 ).

[0140] If T1A>T2A, when determining the offset of RU1 and the offset of RU2, assume that the offset of RU2 (P 20) remains unchanged, the offset of RU1 (P 11 ) can be smaller than the offset of RU1 (P 10 ), that is, P 11 <P 10 That is, RU1 sends data earlier than in the scenario where T1A=T2A, so that RU1's data arrives at switch A earlier than RU2's data, and the overlap between RU1's data transmission duration and RU2's data transmission duration is less than a preset threshold.

[0141] If T1A < T2A, when determining the offset of RU1 and the offset of RU2, assume that the offset of RU2 (P 20 ) remains unchanged, the offset of RU1 (P 12 ) can be equal to the offset of RU2 in the scenario of T1A=T2A (P 10 ), or, the offset of RU1 (P 12 ) can be smaller than the offset of RU2 (P 10 ). Or, the offset of RU1 (P 12 ) can be greater than the offset of RU2 in the scenario of T1A=T2A (P 10 ), that is, RU1 can send data later than in the scenario of T1A=T2A. 12 =P 10 When T1A < T2A, the overlapping duration of RU1's data transmission duration and RU2's data transmission duration can be shortened compared to the overlapping duration in the previous scenario (eg, T1A = T2A). 12 <P 10 When T1A < T2A, the overlapping duration of RU1's data transmission duration and RU2's data transmission duration can be shortened compared to P 12 =P 10 The overlap time in the scene becomes shorter. 12 >P 10 When T1A<T2A, compensation can be achieved due to P 12 The increase in the data transmission duration of RU1 and the overlapping duration of RU2 becomes longer, so that even if P 12 Increasing the time interval can also ensure that the overlapping time interval between the data transmission duration of RU1 and the data transmission duration of RU2 does not become longer than the overlapping time interval in the previous scenario (eg, T1A=T2A).

[0142] It is understandable that the above description is only based on the example of keeping the offset of RU2 unchanged. In addition, it can also be assumed that the offset of RU1 remains unchanged and the offset of RU2 is changed, or the offsets of RU1 and RU2 are changed at the same time. This application does not limit this.

[0143] It should be noted that when determining the N offsets, if the transmission delay between the N RUs and the first switch is not considered, and the N offsets are determined only based on the data transmission duration of the N RUs and the data transmission time window of the N RUs, then the overlap of the data transmission duration of the N RUs determined at this time does not need to consider the transmission delay between the N RUs and the first switch.

[0144] When determining the N offsets, if the transmission delay between the N RUs and the first switch is taken into account, that is, the N offsets are determined based on the transmission delay between the N RUs and the first switch, the data transmission duration of the N RUs, and the data transmission time window of the N RUs, then the overlap of the data transmission durations of the N RUs determined at this time also needs to be determined in combination with the transmission delay between the N RUs and the first switch.

[0145] Similarly, the offsets corresponding to RU1, RU2 and RU4 can be determined by combining T1B, T2B and T4B, as well as the data transmission durations and data transmission time windows corresponding to RU1, RU2 and RU4.

[0146] In addition, in a possible design, after determining N offsets, N first information are sent to N RUs, and the N RUs correspond one-to-one to the N first information. The first information corresponding to the i-th RU includes the offset corresponding to the i-th RU and the data sending time window of the i-th RU, or the data sending start time of the i-th RU within the data sending time window of the i-th RU.

[0147] In addition, for the ring network scenario, as shown in Figure 4C, when determining the offset of each RU, priority can be given to ensuring that the data arriving at the switch with the shortest distance from the DU side switch is staggered, and then ensuring that the data arriving at the switch with the second shortest distance from the DU side switch is staggered, and so on.

[0148] Taking the above scenario 3 as an example, it is possible to prioritize ensuring that the data arriving at switch 2 is staggered, then ensuring that the data arriving at switch 3 is staggered, and then ensuring that the data arriving at switch 4 is staggered.

[0149] By adopting the above method, it can be achieved that in the uplink direction, each RU in the N RUs can determine the corresponding data sending time according to the corresponding offset, so that the time when the data sent by the N RUs arrives at the first switch is different, thereby reducing the peak-to-average traffic ratio of the aggregation link between the first switch and the DU, improving the bandwidth utilization of the aggregation link, reducing the data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0150] In the embodiment shown in FIG6 above, the RU may be the first device, the DU may be the second device, and the first switch may be the third device. For example, the second device may obtain the data transmission duration and the data transmission time window of the N first devices in the network, and the N first devices are connected to the third device in the network. Furthermore, the second device may determine N offsets based on the data transmission duration and the data transmission time window of the N first devices, and the N offsets make the time when the data sent by the N first devices arrive at the third device different. By adopting the above design, the time when the data sent by the N first devices arrives at the third device can be different, thereby reducing the peak-to-average traffic ratio of the aggregation link between the third device and the second device, improving the bandwidth utilization of the aggregation link, reducing the data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0151] Based on this, the present application also provides a communication method to solve the problem of low physical bandwidth utilization of the converged link in the converged networking scenario and high upper limit requirements for the physical bandwidth. As shown in Figure 9, the method includes:

[0152] Step 900: The first DU obtains M1 data transmission durations and M1 data transmission time windows. The M1 data transmission duration is the duration during which the first DU sends data to the M1 RUs, and the M1 data transmission time window is the time window during which the first DU sends data to the M1 RUs. The M1 data transmission durations and the M1 data transmission time windows correspond one-to-one, and M1 is a positive integer greater than or equal to 2. The M1 RUs are connected to the first switch.

[0153] For example, taking the jth RU among M1 RUs as an example, the jth data transmission duration among the M1 data transmission durations is determined based on the average amount of data sent from the first DU to the jth RU and the data transmission rate of the first DU. Where j is a positive integer, and j is any one from 1 to M1.

[0154] The average amount of data sent by the first DU to the j-th RU is determined according to the amount of data that the first DU needs to send to the j-th RU, that is, according to the amount of data to be sent to the j-th RU.

[0155] Exemplarily, when estimating the average amount of data sent by the first DU to the j-th RU, the first DU may refer to at least one of the wireless service load, cell measurement results, traffic model, cell historical data or cell configuration information. In addition, the first DU may also estimate the average amount of data sent by the first DU to the j-th RU in combination with other parameters. This application does not limit this.

[0156] It should be noted that although the first DU can know the amount of data that needs to be sent to the j-th RU each time, the duration of the first DU sending data to the j-th RU is generally in the microsecond range. Therefore, if the offset corresponding to the j-th RU and the offsets corresponding to other RUs are re-determined each time before the first DU sends data to the j-th RU, it will bring a lot of signaling overhead and resource consumption. Generally, M1 offsets are adjusted periodically, for example, the period can be 30s or 60s. Therefore, the duration of the data transmission from the first DU to the j-th RU is also a predicted value.

[0157] The data transmission rate of the first DU may be the forward port rate of the first DU.

[0158] Exemplarily, the M1 data sending time windows may refer to the above description of the data sending time window of the DU, which will not be repeated here.

[0159] It should be noted that M1 RUs are connected to the first switch, where the first switch is generally the root switch on the RU side.

[0160] Step 910: The first DU determines M1 offsets according to M1 data transmission durations and M1 data transmission time windows, and the M1 offsets correspond to the M1 RUs one-to-one.

[0161] Among them, the offset corresponding to the j-th RU in the M1 RUs is used to determine the data sending start time of the first DU in the j-th data sending time window in the M1 data sending time window. The M1 offsets make the time when the data sent by the first DU to the M1 RUs arrives at the first switch different.

[0162] The M1 offsets ensure that the data sent by the first DU to the M1 RUs arrives at the first switch at different times. Alternatively, the M1 offsets minimize the overlapping durations of the M1 data transmissions. For example, the M1 offsets ensure that the start times of data transmissions from the first DU to the M1 RUs differ, minimizing the overlapping durations of the M1 data transmissions.

[0163] Taking the networking scenario shown in Figure 1 as an example, assume that a DU simultaneously sends data to three RUs (RU1, RU2, and RU3). As shown in Figure 10, the three hollow rectangles represent the data transmission time windows for the DU to send data to the three RUs: the data transmission time window for the DU to send data to RU1, the data transmission time window for the DU to send data to RU2, and the data transmission time window for the DU to send data to RU1. The data transmission time windows for the DU to send data to the three RUs are earlier than the cycle boundary. The three solid black rectangles represent the data transmission durations for the DU to send data to the three RUs: the data transmission durations for the DU to send data to RU1, the data transmission durations for the DU to send data to RU2, and the data transmission durations for the DU to send data to RU3. Three offsets are determined based on the data transmission time window and the data transmission duration of the DU to the three RUs. This ensures that the overlapping duration of the data transmission duration of the DU to the three RUs is less than a preset threshold. This ensures that the data sent by the DU to the three RUs arrives at the switch at different times. This reduces the peak-to-average traffic ratio of the aggregation link between the switch and the DU, improves the bandwidth utilization of the aggregation link, and reduces data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch buffer demand, and lowering the operator's fronthaul network construction costs. Offset 1 is the offset of the data transmission start time of the DU to RU1 relative to the start position of the data transmission time window of the DU to RU1. Offset 2 is the offset of the data transmission start time of the DU to RU2 relative to the start position of the data transmission time window of the DU to RU2. Offset 3 is the offset of the data transmission start time of the DU to RU3 relative to the start position of the data transmission time window of the DU to RU3.

[0164] In addition, in some possible embodiments, M2 data sending durations and M2 data sending time windows are obtained, where the M2 data sending duration is the duration for the second DU to send data to M2 RUs, and the M2 data sending time window is the time window for the second DU to send data to M2 RUs. The M2 data sending duration and the M2 data sending time window correspond one to one, and M2 is a positive integer; the second DU and the first DU are connected to the second switch, and further, M1 offsets and M2 offsets are determined based on the M1 data sending durations, the M1 data sending time window, the M2 data sending duration, and the M2 data sending time window.

[0165] Among them, M2 offsets correspond to M2 RUs one-to-one; the offset corresponding to the k-th RU in the M2 RUs is used to determine the data transmission start time of the second DU in the k-th data transmission time window in the M2 data transmission time window, where k is a positive integer and is any one from 1 to M2;

[0166] The M1 offsets and the M2 offsets cause the data sent by the first DU to the M1 RUs to arrive at the first switch at different times, the data sent by the second DU to the M2 RUs to arrive at the first switch at different times, and the data sent by the first DU to arrive at the second switch at different times, and the M2 RUs are connected to the first switch.

[0167] It is understandable that the M1 RUs and the M2 RUs can be completely identical, completely different, or partially identical, and this application does not limit this. The data sent by the first DU to the M1 RUs is M1 data, and then the M1 RUs all receive the corresponding data and perform data processing. After a certain delay compensation, the M1 data is sent out through the antenna port at the cycle boundary. The data sent by the second DU to the M2 RUs is M2 data, and then the M2 RUs all receive the corresponding data and perform data processing. After a certain delay compensation, the M2 data is sent out through the antenna port at the cycle boundary. The above-mentioned cycle boundary is the same cycle boundary.

[0168] For example, in the networking scenario shown in FIG4B , DU1 can send data to RU1 and RU2 , and DU2 can send data to RU1 to RU5 .

[0169] For another example, in the networking scenario shown in FIG4B , DU1 can send data to RU1 and RU2, and DU2 can send data to RU1 and RU2.

[0170] For another example, in the networking scenario shown in FIG4B , DU1 can send data to RU1 and RU2 , and DU2 can send data to RU3 and RU4 .

[0171] For example, in the networking scenario shown in Figure 4B , DU1 can send data to RU1 and RU2, and DU2 can send data to RU1 through RU5. Because DU1 and DU2 are connected to switch A, the offsets corresponding to the first DU sending data to RU1 and RU2 respectively cause the time at which data sent by the first DU to RU1 arrives at switch B to be different from the time at which data sent by the first DU to RU2 arrives at switch B. Furthermore, the offsets corresponding to the second DU sending data to RU1 through RU5 respectively cause the time at which data sent by the second DU to RU1 through RU5 arrives at switch B to be different.

[0172] The offsets corresponding to the first DU sending data to RU1 and RU2, and the offsets corresponding to the second DU sending data to RU1 to RU5, respectively, ensure that the time when the data sent by the first DU to RU1 arrives at switch A, the time when the data sent by the first DU to RU2 arrives at switch A, the time when the data sent by the second DU to RU1 arrives at switch A, the time when the data sent by the second DU to RU2 arrives at switch A, the time when the data sent by the second DU to RU3 arrives at switch A, the time when the data sent by the second DU to RU4 arrives at switch A, and the time when the data sent by the second DU to RU5 arrives at switch A are all different.

[0173] In one possible design, when determining M1 offsets and M2 offsets based on M1 data sending durations, M1 data sending time windows, M2 data sending durations, and M2 data sending time windows, the M1 offsets and M2 offsets are determined based on the M1 data sending durations, M1 data sending time windows, M2 data sending durations, M2 data sending time windows, the transmission delay between the first DU and the second switch, and the transmission delay between the second DU and the second switch.

[0174] For example, in the networking scenario shown in Figure 4B, DU1 can send data to RU1 and RU2, and DU2 can send data to RU1 through RU5. When determining the offsets corresponding to the first DU sending data to RU1 and RU2, and the offsets corresponding to the second DU sending data to RU1 through RU5, the transmission delay between DU1 and switch A and the transmission delay between DU2 and switch A can be considered.

[0175] The offsets corresponding to the sending of data from the first DU to RU1 and RU2, respectively, and the offsets corresponding to the sending of data from the second DU to RU1 to RU5, respectively, may be determined by the first DU, or the second DU, or a designated DU among the first DU and the second DU. The designated DU may be agreed in advance or determined by negotiation between the first DU and the second DU.

[0176] Furthermore, the first DU sends data to M1 RUs respectively according to M1 offsets.

[0177] With the above design, when the first DU sends data to M1 RUs, the first DU can determine the data sending time to send data to the RU according to the offset corresponding to each RU, so that the data sent by the first DU to the M1 RUs arrives at the first switch at different times, thereby reducing the peak-to-average traffic 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, thereby reducing the peak bandwidth requirement of the aggregation link, reducing the switch cache requirement, and reducing the construction cost of the operator's fronthaul network.

[0178] With the above design, in the converged networking scenario shown in Figure 1, the traffic on the converged link (i.e., the transmission link between the DU and the switch) will show alternating traffic peaks and valleys following the wireless scheduling cycle, but the average bandwidth is improved. As shown in Figure 11, compared with Figure 2, the physical bandwidth utilization of the converged link is improved, and the upper limit requirement for the physical bandwidth is reduced.

[0179] In the embodiment shown in FIG9 , 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 M1 data transmission durations and M1 data transmission time windows, where the M1 data transmission duration is the duration during which the second device transmits data to the M1 first devices, and the M1 data transmission time window is the time window during which the second device transmits data to the M1 first devices. The M1 data transmission durations and the M1 data transmission time windows correspond one-to-one, and then M1 offsets are determined based on the M1 data transmission durations and the M1 data transmission time windows. The M1 offsets cause the data sent from the second device to the M1 first devices to arrive at the third device at different times, and the M1 first devices are connected to the third device. By adopting the above design, the time when the data sent by the second device to M1 first devices arrives at the third device can be different, thereby reducing the peak-to-average traffic ratio of the aggregation link between the second device and the third device, improving the bandwidth utilization of the aggregation link, and reducing the data transmission delay jitter, thereby reducing the peak bandwidth demand of the aggregation link, reducing the switch cache demand, and reducing the construction cost of the operator's fronthaul network.

[0180] Figure 12 shows a schematic diagram of the structure of a possible communication device. It is understandable that the communication device 1200 includes necessary forms such as modules, units, elements, circuits, or interfaces, which are appropriately configured together to implement this solution. The communication device 1200 can be a second device (for example, DU) or a component (for example, a chip) in 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 can be a general-purpose processor or a dedicated processor. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control the communication device, execute software programs, and process data of software programs.

[0181] Optionally, in one design, the processor 1201 may include a program 1203 (sometimes also referred to as code or instructions), and the program 1203 may be run on the processor 1201 so that the communication device 1200 performs the method described in the above embodiment.

[0182] In yet another possible design, the communication device 1200 includes a circuit (not shown in FIG12 ) configured to implement the method described in the above embodiments.

[0183] Optionally, the communication device 1200 may include one or more memories 1202 on which a program 1204 (sometimes also referred to as code or instructions) is stored. The program 1204 can be run on the processor 1201, so that the communication device 1200 executes the method described in the above method embodiment.

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

[0185] Optionally, data may be stored in the processor 1201 and / or the memory 1202. The processor and the memory may be provided separately or integrated together.

[0186] Optionally, the communication 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, which controls the communication device. The transceiver 1205 may also be referred to as a transceiver unit, a transceiver, a transceiver circuit, or a transceiver, and is configured to implement the transceiver function of the communication device via the antenna 1206.

[0187] For example, the processor 1201 calls the memory 1202 and executes: obtaining the data transmission duration and data transmission time windows of N first devices in the network, the data transmission duration of the N first devices corresponds one-to-one to the data transmission time windows of the N first devices, and N is a positive integer greater than or equal to 2; the N first devices are connected to the third device in the network; N offsets are determined according to the data transmission duration of the N first devices and the data transmission time windows of the N first devices; the N offsets correspond one-to-one to the N first devices; wherein, the offset corresponding to the i-th first device among the N first devices is used to determine the data transmission start time of the i-th first device within the data transmission time window of the i-th first device, and the N offsets make the time when the data sent by the N first devices reach the third device different, i is a positive integer, and i is any one from 1 to N.

[0188] In one possible design, the processor 1201 is further used to: determine the third device based on the network topology information, the network topology information includes the connection relationship between the third device, the fourth device and N first devices, the third device connects the fourth device and M first devices among the N first devices, the number of nodes between the third device and the second device is less than the number of nodes between the fourth device and the second device, M is less than N, and M is a positive integer.

[0189] In one possible design, K first devices out of N first devices are connected to a fourth device, and the offsets of the K first devices out of the N offsets make the time at which data sent by the K first devices arrive at the fourth device different, K is less than N, and K is a positive integer.

[0190] In one possible design, the processor 1201 is further used to: when determining N offsets based on the data transmission duration of the N first devices and the data transmission time windows of the N first devices, determine the N offsets based on the transmission delay between the N first devices and the third device, the data transmission duration of the N first devices and the data transmission time windows of the N first devices.

[0191] In one possible design, the starting position of the data sending 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 ending position of the data sending 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.

[0192] In one possible design, the starting position of the data sending time window of the i-th first device is determined based on the larger value of the difference between the earliest time when 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 minimum value of the data processing delay of the i-th first device; the ending position of the data sending time window of the i-th first device is determined based on the smaller value of the difference between the latest time when the second device receives data and the maximum value of the transmission delay between the i-th first device and the second device, and the maximum value of the data processing delay of the i-th first device.

[0193] In one possible design, the duration of data transmission by the i-th first device is determined according to an average amount of data sent by the i-th first device to the second device and a data transmission rate of the i-th first device.

[0194] In one possible design, the duration of data transmission by the i-th first device is a predicted value.

[0195] In one possible design, N first devices send data to the same second device, or N first devices send data to different second devices.

[0196] In one possible design, the transceiver 1205 is used to send N first information to N first devices, where the N first devices correspond one-to-one to the N 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 sending time window of the i-th first device, or the data sending start time of the i-th first device within the data sending time window of the i-th first device.

[0197] For another example, the processor 1201 calls the memory 1202 and executes: obtaining M1 data sending durations and M1 data sending time windows, where the M1 data sending duration is the duration for the second device to send data to the M1 first devices, and the M1 data sending time window is the time window for the second device to send data to the M1 first devices. The M1 data sending duration and the M1 data sending time window correspond one-to-one, and M1 is a positive integer greater than or equal to 2; determining M1 offsets based on the M1 data sending duration and the M1 data sending time window, and the M1 offsets correspond one-to-one to the M1 first devices; wherein the offset corresponding to the jth first device among the M1 first devices is used to determine the data sending start time of the second device within the jth data sending time window in the M1 data sending time window, and the M1 offset makes the time when the data sent by the second device to the M1 first device arrives at the third device different, and the M1 first device is connected to the third device, j is a positive integer, and j is any one from 1 to M1.

[0198] In one possible design, the processor 1201 is further used to: obtain M2 data transmission durations and M2 data transmission time windows, where the M2 data transmission duration is the duration for the fourth device to send data to the M2 first devices, the M2 data transmission time window is the time window for the fourth device to send data to the M2 first devices, the M2 data transmission duration and the M2 data transmission time window have a one-to-one correspondence, and M2 is a positive integer; the fourth device and the second device are connected to the fifth device; when determining M1 offsets according to the M1 data transmission duration and the M1 data transmission time window, M2 data transmission duration is determined according to the M1 data transmission duration, the M1 data transmission time window, the M2 data transmission duration, and the M2 data transmission time window. 1 offset and M2 offsets; wherein the M2 offsets correspond one-to-one to the M2 first devices; the offset corresponding to the kth first device among the M2 first devices is used to determine the data transmission start time of the fourth device within the kth data transmission time window among the M2 data transmission time windows, k is a positive integer, and k is any one from 1 to M2; the M1 offsets and the M2 offsets make the time when the data sent by the second device to the M1 first devices arrive at the third device different, and the time when the data sent by the fourth device to the M2 first devices arrives at the third device different, and the time when the data sent by the second device arrives at the fifth device is different from the time when the data sent by the fourth device arrives at the fifth device, and the M2 first devices are connected to the third device.

[0199] In one possible design, the processor 1201 is used to: when determining M1 offsets and M2 offsets based on M1 data sending durations, M1 data sending time windows, M2 data sending durations, and M2 data sending time windows, determine M1 offsets and M2 offsets based on M1 data sending durations, M1 data sending time windows, M2 data sending durations, M2 data sending time windows, the transmission delay between the second device and the fifth device, and the transmission delay between the fourth device and the fifth device.

[0200] In one possible design, the starting position of the j-th data sending time window among the M1 data sending time windows is determined based on the sum of the minimum delay corresponding to the data processing and data caching capabilities of the j-th first device and the maximum transmission delay between the second device and the j-th first device, and the ending position of the j-th data sending time window among the M1 data sending time windows is determined based on the sum of the maximum delay corresponding to the data processing and data caching capabilities of the j-th first device and the minimum transmission delay between the second device and the j-th first device.

[0201] In one possible design, the j-th data transmission duration among the M1 data transmission durations is determined according to an average amount of data sent by the second device to the j-th first device and a data transmission rate of the second device.

[0202] In one possible design, the transceiver 1205 is configured to send data to M1 first devices respectively according to M1 offsets.

[0203] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0204] In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next related objects are in an "or" relationship; in the formulas of this application, the character " / " indicates that the previous and next related objects are in a "division" relationship.

[0205] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A communication method, characterized in that: The method includes: Obtaining data transmission durations and data transmission time windows of N first devices in a network, wherein the data transmission durations of the N first devices correspond one-to-one to the data transmission time windows of the N first devices, and N is a positive integer greater than or equal to 2; the N first devices are connected to a third device in the network; Determining N offsets according to the data transmission duration of the N first devices and the data transmission time windows of the N first devices; the N offsets correspond one-to-one to the N first devices; Among them, the offset corresponding to the i-th first device among the N first devices is used to determine the data sending start time of the i-th first device within the data sending time window of the i-th first device, and the N offsets make the time when the data sent by the N first devices reach the third device different, i is a positive integer, and i is any one from 1 to N.

2. The method according to claim 1, wherein Also includes: The third device is determined based on the topology information of the network, the topology information of the network includes the connection relationship between the third device, the fourth device and the N first devices, the third device connects the fourth device and M first devices among the N first devices, the number of nodes between the third device and the second device is less than the number of nodes between the fourth device and the second device, M is less than N, and M is a positive integer.

3. The method according to claim 2, wherein K first devices among the N first devices are connected to the fourth device, and the offsets of the K first devices among the N offsets make the time at which data sent by the K first devices arrive at the fourth device different, K is less than N, and K is a positive integer.

4. The method according to any one of claims 1 to 3, wherein Determining N offsets according to the data transmission durations of the N first devices and the data transmission time windows of the N first devices includes: The N offsets are determined according to a transmission delay between the N first devices and the third device, a data transmission duration of the N first devices, and a data transmission time window of the N first devices.

5. The method according to any one of claims 1 to 4, characterized in that The starting position of the data sending 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 ending position of the data sending 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.

6. The method according to any one of claims 1 to 4, characterized in that The starting position of the data sending time window of the i-th first device is determined based on the larger value of the difference between the earliest time when 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 minimum value of the data processing delay of the i-th first device. The ending position of the data sending time window of the i-th first device is determined based on the smaller value of the difference between the latest time when the second device receives data and the maximum value of the transmission delay between the i-th first device and the second device, and the maximum value of the data processing delay of the i-th first device.

7. The method according to any one of claims 1 to 6, wherein: The duration of data transmission by the i-th first device is determined according to an average amount of data sent 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 any one of claims 1 to 7, wherein: The duration of data transmission by the i-th first device is a predicted value.

9. The method according to any one of claims 1 to 8, wherein The N first devices send data to the same second device, or the N first devices send data to different second devices.

10. The method according to any one of claims 1 to 9, wherein Also includes: N first information are sent to the N first devices, the N first devices correspond one-to-one to the N 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 sending time window of the i-th first device, or the data sending start time of the i-th first device within the data sending time window of the i-th first device.

11. A communication method, characterized in that: The method includes: Obtain M1 data transmission durations and M1 data transmission time windows, where the M1 data transmission duration is a duration during which the second apparatus transmits data to the M1 first apparatuses, and the M1 data transmission time windows are time windows during which the second apparatus transmits data to the M1 first apparatuses. The M1 data transmission durations and the M1 data transmission time windows correspond one to one, and M1 is a positive integer greater than or equal to 2; Determining M1 offsets according to the M1 data transmission durations and the M1 data transmission time windows, wherein the M1 offsets correspond one-to-one to the M1 first devices; Among them, the offset corresponding to the jth first device among the M1 first devices is used to determine the data sending start time of the second device within the jth data sending time window among the M1 data sending time windows. The M1 offsets make the time when the data sent by the second device to the M1 first devices arrives at the third device different. The M1 first devices are connected to the third device. j is a positive integer and j is any one from 1 to M1.

12. The method according to claim 11, wherein Also includes: Obtaining M2 data transmission durations and M2 data transmission time windows, where the M2 data transmission durations are durations during which the fourth device transmits data to the M2 first devices, and the M2 data transmission time windows are time windows during which the fourth device transmits data to the M2 first devices, the M2 data transmission durations and the M2 data transmission time windows corresponding one to one, and M2 being a positive integer; and connecting the fourth device and the second device to a fifth device; Determining M1 offsets according to the M1 data transmission durations and the M1 data transmission time windows includes: Determining the M1 offsets and the M2 offsets according to the M1 data transmission durations, the M1 data transmission time windows, the M2 data transmission durations, and the M2 data transmission time windows; The M2 offsets correspond one-to-one to the M2 first devices; the offset corresponding to the kth first device among the M2 first devices is used to determine the data transmission start time of the fourth device within the kth data transmission time window among the M2 data transmission time windows, where k is a positive integer and is any one from 1 to M2; The M1 offsets and the M2 offsets cause the data sent by the second device to the M1 first devices to arrive at the third device at different times, and the data sent by the fourth device to the M2 first devices to arrive at the third device at different times, and the data sent by the second device to arrive at the fifth device at different times from the data sent by the fourth device to arrive at the fifth device, and the M2 first devices are connected to the third device.

13. The method according to claim 12, wherein: Determining the M1 offsets and the M2 offsets according to the M1 data transmission durations, the M1 data transmission time windows, the M2 data transmission durations, and the M2 data transmission time windows includes: The M1 offsets and M2 offsets are determined according to the M1 data transmission durations, the M1 data transmission time windows, the M2 data transmission durations, the M2 data transmission time windows, the transmission delay between the second device and the fifth device, and the transmission delay between the fourth device and the fifth device.

14. The method according to any one of claims 11 to 13, wherein: The starting position of the jth data sending time window among the M1 data sending time windows is determined based on the sum of the minimum delay corresponding to the data processing and data caching capabilities of the jth first device and the maximum transmission delay between the second device and the jth first device, and the ending position of the jth data sending time window among the M1 data sending time windows is determined based on the sum of the maximum delay corresponding to the data processing and data caching capabilities of the jth first device and the minimum transmission delay between the second device and the jth first device.

15. The method according to any one of claims 11 to 14, wherein: The j-th data transmission duration among the M1 data transmission durations is determined according to an average amount of data transmitted by the second apparatus to the j-th first apparatus and a data transmission rate of the second apparatus.

16. The method according to any one of claims 11 to 14, wherein: Also includes: Data is sent to the M1 first devices respectively according to the M1 offsets.

17. A communication method, characterized in that: The method includes: The second device obtains data transmission durations and data transmission time windows of N first devices in the network, wherein the data transmission durations of the N first devices correspond to the data transmission time windows of the N first devices in a one-to-one manner, and N is a positive integer greater than or equal to 2; the N first devices are connected to a third device in the network; The second device determines N offsets based on the duration of data transmission by the N first devices and the data transmission time window of the N first devices; the N offsets correspond one-to-one to the N first devices; wherein the offset corresponding to the i-th first device among the N first devices is used to determine the start time of data transmission by the i-th first device within the data transmission time window of the i-th first device, and the N offsets ensure that the time when the data sent by the N first devices reaches the third device is different, and i is a positive integer, and i is any one from 1 to N; The second device sends N pieces of first information to the N first devices, the N first devices corresponding one-to-one to the N 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; Each of the N first devices sends data to the second device according to corresponding first information.

18. A communication device, characterized in that: Comprising means for performing the method according to any one of claims 1 to 16.

19. A communication device, characterized in that: including processor and memory; The memory is used to store computer-executable instructions; The processor is configured to execute the computer-executable instructions stored in the memory, so as to enable the communication device to perform the method according to any one of claims 1 to 16.

20. A chip, characterized in that: The chip is coupled to a memory, and the chip reads a computer program stored in the memory to execute the method according to any one of claims 1 to 16.

21. A computer-readable storage medium, characterized in that The storage medium stores a computer program or instruction, and when the computer program or instruction is executed by the communication device, the method according to any one of claims 1 to 16 is implemented.

22. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is run on a device, the method according to any one of claims 1 to 16 is performed.

23. A communication system, characterized in that: The system includes: a plurality of first devices, a second device, and a third device, wherein the plurality of first devices are connected to the third device, wherein the second device performs the method according to any one of claims 1 to 16.

24. The communication system according to claim 23, wherein: The first device is a wireless unit, the second device is a distributed unit, and the third device is a first switch.

Images