A data transmission method, apparatus, device, and storage medium

Abstract

This invention discloses a data transmission method, apparatus, device, and storage medium. The method includes: obtaining the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval; determining the number of data blocks and the size of each data block within the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval; and uploading data according to the size of each data block. Through the technical solution of this invention, block transmission can be flexibly performed, further reducing the total latency.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a data transmission method, apparatus, device and storage medium. Background Technology

[0002] TDM-PON uses time-division multiplexing to support uplink and downlink data transmission from multiple ONUs (Optical Network Units) on a single wavelength channel. In mobile fronthaul networks, each ONU corresponds to one or more RRUs (Radio Remote Units), dividing the uplink channel into multiple time slots, with one ONU transmitting uplink data in each time slot. A key issue with using TDM-PON as a fronthaul network is latency limitation. Traditional request-and-grant-based dynamic bandwidth allocation methods result in millisecond-level latency, failing to meet the latency requirements of mobile fronthaul. To address this issue, NTT Corporation of Japan proposed a dynamic bandwidth allocation mechanism based on the collaboration of BBUs and OLTs (Optical Line Terminals), namely M-DBA (Mobile Dynamic Bandwidth Allocation).

[0003] During wireless communication, the User Equipment (UE) needs to request uplink resources from the base station. The UE sends a Schedule Request (SR) to the base station to indicate a resource request, various Uplink Control Information (UCI) messages to indicate the UE state and channel state, and a Buffer State Report (BSR) to indicate the number of Resource Blocks (RBs) requested. The base station's MAC layer scheduler combines the information uploaded by the UE with existing time-frequency resources to determine the allocation of resources (PRBs & MCS) to the UE. Only after obtaining an Uplink Scheduling Grant (UL Grant) from the base station can the UE transmit data. Taking LTE as an example, the LTE scheduling period is also called the Transmission Time Interval (TTI), defined as 1ms, which is the length of a subframe. This means the base station performs user scheduling every TTI. After sending various uplink request messages and uplink control messages to the base station, the UE will receive a Downlink Control Information (DCI) message from the base station. After receiving the DCI, it will wait 4ms before transmitting uplink data. Therefore, through M-DBA, the OLT can accurately obtain the amount of data cached by each ONU within one TTI before the ONU transmits data uplink, without the ONU needing to report its bandwidth requirements.

[0004] Directly sending a TTI (Transmission Time Interval) of data will cause a large transmission delay and waiting delay for the ONU. In order to reduce the transmission delay and waiting delay of data on TDM-PON, NTT Corporation of Japan proposed to divide a TTI of data into equal blocks for transmission, that is, to transmit uplink data in multiple polling cycles.

[0005] While dividing and transmitting a TTI data into equal blocks can reduce the waiting and transmission latency of ONUs in PON (Passive Optical Network), if the transmission latency and added overhead time of all ONUs dividing the data into equal blocks do not fill a full polling cycle, the next polling cycle must wait until all the data of the next data block arrives at the ONU before it can begin. This will result in a waste of bandwidth and time slot resources. Summary of the Invention

[0006] This invention provides a data transmission method, apparatus, device, and storage medium that solves the problem of wasted bandwidth and time slot resources when TTI data is transmitted in equal blocks.

[0007] According to one aspect of the present invention, a data transmission method is provided, the method comprising:

[0008] The following parameters are considered: the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0009] The number of data blocks and the size of each data block are determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0010] Data is uploaded based on the size of each data block.

[0011] According to another aspect of the present invention, a data transmission apparatus is provided, the data transmission apparatus comprising:

[0012] The parameter acquisition module is used to obtain the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0013] The data block determination module is used to determine the number of data blocks and the size of each data block during the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0014] The data upload module is used to upload data according to the size of each data block.

[0015] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0016] At least one processor; and

[0017] A memory communicatively connected to the at least one processor; wherein,

[0018] The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the data transmission method described in any embodiment of the present invention.

[0019] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the data transmission method described in any embodiment of the present invention.

[0020] This invention, through obtaining the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, determines the number of data blocks and the size of each data block within the TTI transmission time based on these factors. Data is then uploaded according to the size of each data block. This solves the problem of wasted bandwidth and time slot resources caused by equally divided and transmitted TTI data, enabling flexible block transmission and further reducing total latency.

[0021] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0022] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1 This is a flowchart of a data transmission method according to Embodiment 1 of the present invention;

[0024] Figure 2 This is a schematic diagram of the structure of a data transmission device according to Embodiment 2 of the present invention;

[0025] Figure 3 This is a schematic diagram of the structure of an electronic device according to Embodiment 3 of the present invention. Detailed Implementation

[0026] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0027] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0028] Example 1

[0029] Figure 1 This is a flowchart of a data transmission method according to Embodiment 1 of the present invention. This embodiment is applicable to data transmission in TDM-PON mobile fronthaul networks. The method can be executed by the data transmission device in this embodiment, which can be implemented in software and / or hardware, such as... Figure 1 As shown, the method specifically includes the following steps:

[0030] S110, obtain the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0031] Here, the number of ONUs refers to the total number of ONUs in the TDM-PON system, which can be denoted as N; the bandwidth overhead introduced by the fronthaul is denoted as H, in bits; the guard interval of the ONU uplink transmission window is denoted as G, which depends on the specific TDM-PON standard and is considered a constant; the bandwidth capacity of the PON network is denoted as C; and the bandwidth overhead introduced by channel coding is denoted as R. FEC The average bit rate of each ONU-to-OLT connection can be denoted as r, and the average bit rate of the k-th ONU-to-OLT connection is denoted as rk. k The length of the TTI transmission interval is denoted as TTI, which is 1ms.

[0032] Specifically, the following methods can be used to obtain the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval: based on the transmission of a TTI bandwidth in blocks, the following methods can be obtained:

[0033] S120 determines the number of data blocks and the size of each data block within the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0034] In this process, based on the equal division and transmission of a TTI bandwidth, the data of one TTI is divided into variable-length blocks according to time sequence, and the size of each data block is denoted as B1, B2, ... B1. S S represents the number of data blocks that are divided within the TTI transmission time.

[0035] Specifically, the number of data blocks and the size of each data block within the TTI transmission time can be determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, and the length of the TTI transmission interval. The maximum number of data blocks that can be divided within the TTI transmission time can be determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, and the length of the TTI transmission interval. The final number of data blocks can be determined based on the determined maximum number of data blocks that can be divided within the TTI transmission time, the latency requirements and bandwidth efficiency requirements of the fronthaul network. Finally, the size of each data block can be determined based on the final number of data blocks, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, and the length of the TTI transmission interval.

[0036] Optionally, the number of data blocks and the size of each data block are determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, including:

[0037] The maximum number of data blocks that can be split during the TTI transmission time is determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0038] The size of each data block is determined based on the maximum number of data blocks to be split, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0039] Specifically, the method for determining the maximum number of data blocks that can be divided within the TTI transmission time can be as follows, based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval: The total delay under the worst-case waiting condition for TTI equal-block transmission is determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. The data block size constraint is then obtained based on the PON network bandwidth capacity limit, thereby obtaining the maximum number of data blocks that can be divided within the TTI transmission time.

[0040] Specifically, the size of each data block can be determined based on the maximum number of data blocks that can be split, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. This can be achieved by obtaining the maximum number of data blocks that can be split within the TTI transmission time, and then determining the size of each data block using a formula that accounts for the maximum number of data blocks, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. It should be noted that the determined size of each data block must meet bandwidth efficiency requirements and fronthaul network latency requirements.

[0041] Optionally, the maximum number of data blocks that can be split during the TTI transmission time is determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, including:

[0042] The maximum number of data blocks that can be split during the TTI transmission time is determined based on the following formula:

[0043]

[0044] Where, N TP Where N is the maximum number of data blocks that can be split within the TTI transmission time, H is the number of ONUs, H is the bandwidth overhead introduced by the fronthaul, G is the guard interval of the ONU uplink transmission window, C is the bandwidth capacity of the PON network, and R is the maximum number of data blocks that can be split within the TTI transmission time. FEC The bandwidth overhead introduced by channel coding, r k Let be the average bit rate of the k-th ONU-to-OLT connection, and TTI be the length of the TTI transmission interval.

[0045] Optionally, the size of each data block is determined based on the maximum number of data blocks to be divided, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, including:

[0046] The size of each data block is determined based on the following formula:

[0047]

[0048]

[0049] Where S = N TP B m Let m be the size of the m-th data block.

[0050] It is important to note that when initially determining the size of each data block, S = N. TP S can be in [0, N] TP Within the range of ], the value of S is adjusted according to TTI transmission constraints, such as the worst total latency limit and bandwidth efficiency limit of TTI transmission.

[0051] In a specific example, when transmitting a TTI bandwidth in equal blocks, the number of ONUs N in the TDM-PON system is determined. The data from the RRU for one TTI is divided into multiple equal-length data blocks on the ONUs and then transmitted in the TDM-PON network. The unit for dividing the data block is us (µs), which can be considered a fixed-length time slot, denoted as B. The bandwidth capacity of the PON network is C. The size of the ONU uplink transmission window is:

[0052] T send =T payload +G

[0053] Wherein, the protection interval of the ONU uplink transmission window is G, which is a constant, and T is... on T sync T delim and T off The sum, T on T represents the time delay for the ONU laser to turn on. sync T represents the ONU synchronization delay. delim T represents frame delimiting delay. off This represents the time delay before the ONU laser is turned off.

[0054] G = T on +T sync +T delim +T off

[0055] Among them, T payload The transmission delay is the latency of the net payload, which is the transmission delay of the actual authorized uplink data buffered in the ONU.

[0056] The length of the TTI transmission interval is the length of one subframe, defined as 1ms.

[0057] To meet the bandwidth capacity limitations of a PON network, the data block size B should satisfy:

[0058]

[0059] That is, when transmitting data in equal chunks:

[0060]

[0061] Then, the maximum number of data blocks N that can be split within the TTI transmission time. TP for:

[0062]

[0063] Since the length of the equally divided data blocks is already at a critical point, it can be equivalent to a variable-length block transmission. Therefore, the maximum number of data blocks S that can be divided under variable-length block transmission conditions can be derived.max for:

[0064] S max =N TP

[0065] The range of the number of data blocks S divided within a TTI transmission time is:

[0066] S∈[0,S max ]

[0067] The length of the polling period m is equal to the length of the data block (m+1):

[0068]

[0069] This block arrangement ensures minimal waste of bandwidth and time slot resources, according to the following formula:

[0070]

[0071] Constructing a system of S linear equations, we obtain B1, B2, ..., B S The value of determines the number of data blocks and the size of each data block within the TTI transmission time.

[0072] S130 uploads data based on the size of each data block.

[0073] Specifically, the method for uploading data based on the size of each data block can be as follows: obtain the number of data blocks to be divided within the TTI transmission time and the size of each data block, and upload the data according to the size of the divided data blocks.

[0074] Optionally, data can be uploaded based on the size of each data block, including:

[0075] Acquire propagation latency and processing latency;

[0076] The target total delay is determined based on the propagation delay, processing delay, number of data blocks divided within the TTI transmission time, size of each data block, bandwidth overhead introduced by the fronthaul, guard interval of the ONU uplink transmission window, bandwidth capacity of the PON network, bandwidth overhead introduced by channel coding, and average bit rate of each ONU-to-OLT connection.

[0077] If the total target latency is less than or equal to the latency threshold, then data is uploaded according to the size of each data block.

[0078] Among them, the propagation delay T propThis refers to the propagation delay of data over the physical transmission medium. In TDM-PON, the physical transmission medium refers to optical fiber. The propagation delay caused by transmission over optical fiber is 5 μs / km, mainly related to the physical distance between the ONU and the OLT. Processing delay T proc This mainly occurs within the ONU and OLT, such as forward error correction coding delay and receiver decoding delay. It is primarily related to hardware implementation and can generally be considered a constant. The target total delay is the worst-case total delay calculated in PON for variable-length block transmission, and the delay threshold is the delay value that meets the delay requirements of the fronthaul network.

[0079] Specifically, the target total delay can be determined based on the propagation delay, processing delay, number of data blocks divided within the TTI transmission time, size of each data block, bandwidth overhead introduced by the fronthaul, guard interval of the ONU uplink transmission window, bandwidth capacity of the PON network, bandwidth overhead introduced by channel coding, and average bit rate of each ONU-to-OLT connection. The worst-case delay for equally divided block transmission can be determined based on these factors, and the worst total delay for variable-length block transmission in PON can then be determined based on this worst-case delay.

[0080] Specifically, if the target total latency is less than or equal to the latency threshold, the data upload method based on the size of each data block can be as follows: obtain the size of each data block; if the obtained target total latency is less than or equal to the latency threshold, it is determined that the target total latency meets the latency requirements of the fronthaul network; based on meeting the latency requirements of the fronthaul network, data is uploaded according to the size of each data block; if the target total latency is greater than the latency threshold, it is determined that the target total latency does not meet the latency requirements of the fronthaul network; the number of data blocks is reduced by one, the target total latency is recalculated, until the target total latency meets the latency requirements of the fronthaul network; and data is uploaded according to the final calculated size of each data block.

[0081] In a specific example, to prevent collisions, the OLT allocates different time slots to each ONU within a polling cycle. Assume that within a polling cycle, n ONUs send data before the transmission time of the k-th ONU begins:

[0082] 0≤n≤N-1

[0083] The waiting delay for the k-th ONU-to-OLT connection is the transmission delay of the k-th ONU uplink data block. The waiting delay is mainly caused by the time division multiple access (TDM-PON) characteristic. Multiple ONUs share a single wavelength channel, but only one ONU can transmit uplink data at any given time. Other ONUs must wait for this ONU to complete its data transmission before they can continue transmitting in sequence.

[0084]

[0085] Therefore, the total delay T wait for:

[0086]

[0087] Considering the worst-case waiting situation when TTI is divided into equal blocks, the number of blocks that need to be waited for is N-1, therefore T wait It can be represented as:

[0088]

[0089] Therefore, in a single polling cycle, the ONU that is scheduled last has the worst latency performance, and the worst total latency max(D) is:

[0090] max(D) = max(T) wait )+T send +T prop +T proc

[0091] Right now:

[0092]

[0093] Among them, T prop For propagation delay, T proc To handle latency, it can be considered a constant. Since the length of the equally divided data blocks is already at a critical state, it can be equivalent to a variable-length block transmission. It is known that the latency of data on an ONU in PON is calculated from the time one TTI of data from the RRU completely arrives at the ONU. Therefore, for block transmission, the worst-case total latency in PON is determined by the duration of the last polling cycle. Thus, the worst-case total latency of variable-length block transmission in PON is:

[0094]

[0095] To meet the latency requirements of the fronthaul network, taking the industry standard of 250µs as an example, the worst-case total latency needs to meet the following:

[0096] max(D) <= 250us

[0097] If the worst total latency meets the latency requirements of the fronthaul network, then data is uploaded according to the size of each data block; if the worst total latency does not meet the latency requirements of the fronthaul network, then step S-1 is repeated to recalculate the target total latency until the target total latency meets the latency requirements of the fronthaul network, and then data is uploaded according to the size of each data block calculated in the final step.

[0098] Optionally, data can be uploaded based on the size of each data block, including:

[0099] The transmission delay for each data block is determined based on the size of each data block, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, the bandwidth overhead introduced by the fronthaul, and the bandwidth capacity of the PON network.

[0100] If the transmission delay of any data block is greater than or equal to the guard interval of the ONU uplink transmission window, then data is uploaded according to the size of each data block.

[0101] Transmission delay refers to the time it takes for the ONU to transmit the first bit of data until the last bit of data is transmitted. It is mainly related to the amount of data transmitted by the ONU and the bandwidth capacity of the PON.

[0102] Specifically, the transmission delay for each data block is expressed as follows:

[0103]

[0104] Specifically, if the transmission delay of any data block is greater than or equal to the protection interval of the ONU uplink transmission window, the data upload method based on the size of each data block can be as follows: If the transmission delay of any data block is greater than or equal to the protection interval of the ONU uplink transmission window, it proves that the bandwidth efficiency requirement is met, and data is uploaded according to the size of each data block; if the transmission delay of any data block is less than the protection interval of the ONU uplink transmission window, it proves that the bandwidth efficiency requirement is not met, the number of data blocks is reduced by one, the transmission delay of each data block is recalculated, until the transmission delay of any data block is greater than or equal to the protection interval of the ONU uplink transmission window, and data is uploaded according to the final calculated size of each data block.

[0105] In a specific example, if the transmission delay for each data block is:

[0106]

[0107] From a bandwidth efficiency perspective, it is necessary to:

[0108]

[0109] If the transmission delay corresponding to any calculated data block is greater than or equal to G, then data is uploaded according to the calculated size of each data block; if the transmission delay corresponding to any calculated data block is less than G, then the number of data blocks is reduced by one, and the transmission delay of each data block is recalculated until the transmission delay of any data block is greater than or equal to the guard interval of the ONU uplink transmission window, and then data is uploaded according to the final calculated size of each data block.

[0110] The technical solution of this embodiment obtains the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. Based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, the number of data blocks to be divided within the TTI transmission time and the size of each data block are determined. Data is uploaded according to the size of each data block, which solves the problem of wasted bandwidth and time slot resources when TTI data is equally divided and transmitted in blocks, and enables flexible block transmission, further reducing the total latency.

[0111] Example 2

[0112] Figure 2 This is a schematic diagram of a data transmission device according to Embodiment 2 of the present invention. This embodiment is applicable to data transmission in TDM-PON mobile fronthaul networks. The device can be implemented using software and / or hardware, and can be integrated into any device that provides data transmission functionality, such as... Figure 2 As shown, the data transmission device specifically includes: a parameter acquisition module 210, a data block determination module 220, and a data upload module 230.

[0113] Among them, the parameter acquisition module 210 is used to acquire the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0114] The data block determination module 220 is used to determine the number of data blocks and the size of each data block during the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0115] The data upload module 230 is used to upload data according to the size of each data block.

[0116] Optionally, the data block determination module is specifically used for:

[0117] The maximum number of data blocks that can be split during the TTI transmission time is determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0118] The size of each data block is determined based on the maximum number of data blocks to be split, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval.

[0119] Optionally, the data upload module is specifically used for:

[0120] Acquire propagation latency and processing latency;

[0121] The target total delay is determined based on the propagation delay, processing delay, number of data blocks divided within the TTI transmission time, size of each data block, bandwidth overhead introduced by the fronthaul, guard interval of the ONU uplink transmission window, bandwidth capacity of the PON network, bandwidth overhead introduced by channel coding, and average bit rate of each ONU-to-OLT connection.

[0122] If the total target latency is less than or equal to the latency threshold, then data is uploaded according to the size of each data block.

[0123] Optionally, the data upload module is specifically used for:

[0124] The transmission delay for each data block is determined based on the size of each data block, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, the bandwidth overhead introduced by the fronthaul, and the bandwidth capacity of the PON network.

[0125] If the transmission delay of any data block is greater than or equal to the guard interval of the ONU uplink transmission window, then data is uploaded according to the size of each data block.

[0126] Optionally, the data block determination module is specifically used for:

[0127] The maximum number of data blocks that can be split during the TTI transmission time is determined based on the following formula:

[0128]

[0129] Where, N TP Where N is the maximum number of data blocks that can be split within the TTI transmission time, H is the number of ONUs, H is the bandwidth overhead introduced by the fronthaul, G is the guard interval of the ONU uplink transmission window, C is the bandwidth capacity of the PON network, and R is the maximum number of data blocks that can be split within the TTI transmission time. FEC The bandwidth overhead introduced by channel coding, r k Let be the average bit rate of the k-th ONU-to-OLT connection, and TTI be the length of the TTI transmission interval.

[0130] Optionally, the data block determination module is specifically used for:

[0131] The size of each data block is determined based on the following formula:

[0132]

[0133]

[0134] Where S = N TP B m Let m be the size of the m-th data block.

[0135] The above-described products can perform the methods provided in any embodiment of the present invention, and have the corresponding functional modules and beneficial effects for performing the methods.

[0136] The technical solution of this embodiment obtains the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. Based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, the number of data blocks to be divided within the TTI transmission time and the size of each data block are determined. Data is uploaded according to the size of each data block, which solves the problem of wasted bandwidth and time slot resources when TTI data is equally divided and transmitted in blocks, and enables flexible block transmission, further reducing the total latency.

[0137] Example 3

[0138] Figure 3This is a schematic diagram of an electronic device according to Embodiment 3 of the present invention. The electronic device 10 is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (such as helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0139] like Figure 3 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 may also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0140] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0141] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as data transfer methods.

[0142] In some embodiments, the data transfer method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the data transfer method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the data transfer method by any other suitable means (e.g., by means of firmware).

[0143] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0144] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0145] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0146] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0147] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or computing systems that include middleware components (e.g., application servers), or computing systems that include frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0148] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0149] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0150] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A data transmission method, characterized by, include: The following parameters are considered: the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. The number of data blocks and the size of each data block are determined based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. Data is uploaded according to the size of each data block; The step of determining the number of data blocks and the size of each data block within the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval includes: Based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval, the maximum number of data blocks that can be split during the TTI transmission time is determined using the following formula: wherein, is the maximum number of split data blocks within a TTI transmission time, is the number of ONUs, is the bandwidth overhead introduced by the fronthaul, is the guard interval of the ONU upstream transmission window, is the bandwidth capacity of the PON network, is the bandwidth overhead introduced by the channel coding, is the average bit rate of the k-th ONU-to-OLT connection, is the length of the TTI transmission interval; The size of each data block is determined based on the following formula, taking into account the maximum number of data blocks to be split, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval: ， ； ； in, , Let m be the size of the m-th data block.

2. The method according to claim 1, characterized in that, Data is uploaded based on the size of each data block, including: Acquire propagation latency and processing latency; The target total delay is determined based on the propagation delay, processing delay, number of data blocks divided within the TTI transmission time, size of each data block, bandwidth overhead introduced by the fronthaul, guard interval of the ONU uplink transmission window, bandwidth capacity of the PON network, bandwidth overhead introduced by channel coding, and average bit rate of each ONU-to-OLT connection. If the total target latency is less than or equal to the latency threshold, then data is uploaded according to the size of each data block.

3. The method according to claim 1, characterized in that, Data is uploaded based on the size of each data block, including: The transmission delay for each data block is determined based on the size of each data block, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-OLT connection, the bandwidth overhead introduced by the fronthaul, and the bandwidth capacity of the PON network. If the transmission delay of any data block is greater than or equal to the guard interval of the ONU uplink transmission window, then data is uploaded according to the size of each data block.

4. A data transmission device, characterized in that, include: The parameter acquisition module is used to obtain the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. The data block determination module is used to determine the number of data blocks and the size of each data block during the TTI transmission time based on the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by the channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval. The data upload module is used to upload data according to the size of each data block; The data block determination module is specifically used to: determine the maximum number of data blocks to be divided within the TTI transmission time based on the following formula, according to the number of ONUs, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval: in, This represents the maximum number of data blocks that can be split within the TTI transmission time. For the number of ONUs, The bandwidth overhead introduced for the fronthaul The guard interval for the ONU uplink transmission window. This refers to the bandwidth capacity of the PON network. The bandwidth overhead introduced by channel coding Let k be the average bit rate of the k-th ONU-to-OLT connection. The length of the TTI transmission interval; The size of each data block is determined based on the following formula, taking into account the maximum number of data blocks to be split, the bandwidth overhead introduced by the fronthaul, the guard interval of the ONU uplink transmission window, the bandwidth capacity of the PON network, the bandwidth overhead introduced by channel coding, the average bit rate of each ONU-to-OLT connection, and the length of the TTI transmission interval: ， ； ； in, , Let m be the size of the m-th data block.

5. An electronic device, characterized in that, The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the data transmission method according to any one of claims 1-3.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that are used to cause a processor to execute the data transmission method according to any one of claims 1-3.

Images