Transmission management method and apparatus

Abstract

A transmission management method and device can improve the service quality between nodes. In the method, a target node can adjust the transmission resources occupied by a to-be-transmitted file in a transmission process, the resource parameters of a sending node for processing the to-be-transmitted file, and the resource parameters of a receiving node for processing the to-be-transmitted file according to at least one of the state information of the sending node, the state information of the intermediate node between the sending node and the receiving node, and the state information of the receiving node, so that the available processing resources in the sending node meet the processing requirements of the to-be-transmitted file, the available processing resources in the receiving node meet the inverse processing requirements of the processed to-be-transmitted file, and the available transmission resources of the intermediate node meet the transmission requirements of the to-be-transmitted file, thereby improving the service quality between nodes. Furthermore, by comprehensively considering the available processing resources in the sending node, the available processing resources in the receiving node, and the available transmission resources of the intermediate node, the resource occupation of the to-be-transmitted file in the sending node, the receiving node, and the intermediate node can be balanced, thereby improving the resource utilization.

Description

Technical Field

[0001] This application relates to the field of communications, and specifically to a transmission management method and apparatus. Background Technology

[0002] In recent years, with the development of communication technology, business interactions between different nodes in communication systems have become more and more frequent, and users' demand for file transfer between nodes has also increased.

[0003] Currently, in order to meet users' needs for file transfer between nodes, the sending node can perform source encoding on the file to be transferred and channel encoding in combination with the communication status between the sending node and the receiving node, so that the encoded file to be transferred can be restored by the receiving node after it is transmitted to the receiving node.

[0004] However, the available computing resources in the receiving node may be insufficient to meet the source channel decoding requirements corresponding to the source channel coding of the sending node, resulting in a mismatch in resource consumption between the sending and receiving ends of file processing and reducing the quality of service (QoS) between nodes. Summary of the Invention

[0005] To address the aforementioned technical problems, embodiments of this application provide a transmission management method and apparatus that can improve the quality of service between nodes.

[0006] Firstly, a transmission management method is provided. This method can be executed by a target node, or by a component of the target node, such as its processor, chip, or chip system. It can also be implemented by a logic module or software capable of performing all or part of the target node's functions. The following explanation uses the execution of this method by the target node as an example. The transmission management method includes: acquiring first state information of a first node, second state information of a second node, and third state information of an intermediate node between the first and second nodes; determining a target transmission strategy for a target file sent from the first node to the second node based on at least one of the first, second, and third state information. The target transmission strategy includes: file preprocessing information, file inverse processing information, and target transmission resources.

[0007] Based on the above technical solution, the target node can adjust the transmission resources occupied by the file to be transmitted during transmission and the resource parameters of the sending and receiving nodes in processing the file to be transmitted, based on at least one of the status information of the sending and receiving nodes and the status information of the intermediate nodes between the sending and receiving nodes. This ensures that the available processing resources in the sending node meet the processing requirements of the file to be transmitted, the available processing resources in the receiving node meet the inverse processing requirements of the processed file to be transmitted, and the available transmission resources of the intermediate nodes between the sending and receiving nodes meet the transmission requirements of the file to be transmitted, thereby improving the quality of service between nodes. Furthermore, by comprehensively considering the available processing resources in the sending node, the available processing resources in the receiving node, and the available transmission resources of the intermediate nodes between the sending and receiving nodes, the resource occupancy of the file to be transmitted among the sending node, receiving node, and intermediate nodes can be balanced, improving resource utilization.

[0008] In conjunction with the first aspect mentioned above, the first node, the second node, and the intermediate node satisfy at least one of the following: the first node performs file preprocessing, and the second node performs file inverse processing; the first node performs file preprocessing, and the intermediate node performs file inverse processing; or the intermediate node performs file preprocessing, and the second node performs file inverse processing. By performing different processing operations at different node locations, the computing resources in each node can be fully utilized, improving resource utilization during file transfer.

[0009] In conjunction with the first aspect above, in one possible design, the first node performs file preprocessing, and the second node performs file inverse processing; the first status information includes the preprocessing capability information of the first node performing file preprocessing and / or the transmission task information of the target file; the second status information includes the inverse processing capability information of the second node performing file inverse processing and / or the service status information of the second node; the third status information includes the air interface status information between the first node and the second node.

[0010] In conjunction with the first aspect mentioned above, in one possible design, the first node performs file preprocessing, and the intermediate node performs file inverse processing; the first status information includes the preprocessing capability information of the first node performing file preprocessing and the transmission task information of the target file; the second status information includes the service status information of the second node; and the third status information includes the air interface status information between the first node and the second node and / or the inverse processing capability information of the intermediate node performing file inverse processing.

[0011] In conjunction with the first aspect above, in one possible design, the intermediate node performs file preprocessing, and the second node performs file inverse processing; the first status information includes the target file transmission task information; the second status information includes the inverse processing capability information of the second node performing file inverse processing and / or the service status information of the second node; the third status information includes the air interface status information between the first node and the second node and / or the preprocessing capability information of the intermediate node performing file preprocessing.

[0012] In conjunction with the first aspect mentioned above, in one possible design, file preprocessing is used to reduce the file size, and file inverse processing is used to restore or partially restore the file to its state before file preprocessing.

[0013] In conjunction with the first aspect above, in one possible design, the preprocessing capability information includes at least one of the following: an identifier of at least one preprocessing model and / or algorithm; adjustable parameter indicators of at least one preprocessing model and / or algorithm; the correlation between parameter adjustment and preprocessing time for each preprocessing model and / or algorithm in at least one preprocessing model and / or algorithm; the inverse processing model and / or algorithm corresponding to each preprocessing model and / or algorithm in at least one preprocessing model and / or algorithm; the queuing status of preprocessing tasks; available computing resources for preprocessing; and the estimated preprocessing time for the target file. The target node can adjust the preprocessing model (or algorithm) and resource requirements of the target file during transmission by referring to the relevant information of each preprocessing model and / or algorithm in the node performing file compression and the available computing resources for preprocessing, so that the available computing resources and available preprocessing models and / or algorithms in the node performing file preprocessing meet the preprocessing requirements of the target file. Furthermore, by referencing the parameters of each preprocessing model and / or algorithm to adjust the correlation between preprocessing time, the queuing status of preprocessing tasks, and the estimated preprocessing time for the target file, the target node can adjust the time spent on the target file during preprocessing, reduce the overall latency of the target file during transmission, and improve the quality of service between nodes. In addition, by referring to the inverse processing model adapted to each preprocessing model and / or algorithm to select the preprocessing model and / or algorithm, the target node can adapt preprocessing and inverse processing, ensuring that the node performing file inverse processing has the corresponding inverse processing model and / or algorithm to complete the file inverse processing operation.

[0014] In conjunction with the first aspect above, in one possible design, the inverse processing capability information includes at least one of the following: an identifier of at least one inverse processing model and / or algorithm; adjustable parameter indicators of at least one inverse processing model and / or algorithm; the correlation between parameter adjustment and inverse processing time for each inverse processing model and / or algorithm; a preprocessing model and / or algorithm corresponding to each inverse processing model and / or algorithm; the queuing status of inverse processing tasks; available computing power resources for inverse processing; and the estimated inverse processing time for the target file. The target node can adjust the model (or algorithm) and resource requirements for inverse processing during transmission of the target file by referring to the relevant information of each inverse processing model and / or algorithm in the node executing the file inverse processing, as well as the available computing power resources for inverse processing, so that the available computing power resources and available inverse processing models and / or algorithms in the node executing the file inverse processing meet the inverse processing requirements of the target file. Furthermore, by referencing the parameters of each inverse processing model and / or algorithm to adjust the correlation between inverse processing time, the queuing status of inverse processing tasks, and the estimated inverse processing time for the target file, the target node can adjust the time spent on the target file during inverse processing, reduce the overall latency of the target file during transmission, and improve the quality of service between nodes. In addition, by referring to the preprocessing model and / or algorithm adapted to each inverse processing model and / or algorithm to select the inverse processing model and / or algorithm, the target node can adapt preprocessing and inverse processing, ensuring that the nodes performing file preprocessing have the corresponding preprocessing model and / or algorithm to complete the file preprocessing operation.

[0015] In conjunction with the first aspect mentioned above, in one possible design, the air interface state information includes at least one of the following: signal-to-noise ratio; signal reference point; spectral efficiency; channel quality indicators; pre-allocated transmission resources for different transmission tasks; and rules for allocating transmission resources for different transmission tasks. The target node can adjust the resource requirements of the target file during transmission by referring to the communication environment and available transmission resources between the transmitting and receiving nodes, ensuring that the communication environment and available transmission resources between the transmitting and receiving nodes meet the transmission requirements of the target file, thereby improving the quality of service between nodes.

[0016] In conjunction with the first aspect mentioned above, in one possible design, the transmission task information includes at least one of the following: file size; buffer size; file format; color channels of the media file; file characteristics; file transmission time window; and the priority of the first node in transmitting the target file. The target node can adjust the transmission resources occupied by the target file during transmission, as well as the resource parameters of the sending and receiving nodes in processing the target file, by referring to the relevant requirements of the transmission task. While meeting the file transmission latency requirements, this approach balances the resource usage of the target file across the sending, receiving, and intermediate nodes, avoiding excessive resource consumption for lower latency and improving resource utilization.

[0017] In conjunction with the first aspect mentioned above, in one possible design, the service status information includes at least one of the following: the queuing status of the service tasks involving the target file; the priority of the service tasks involving the target file; the impact of preprocessing / reverse processing on the service quality of the service tasks involving the target file; and the priority of responding to the requests of the first node. The target node can adjust the transmission resources occupied by the target file during transmission and the resource parameters of the sending and receiving nodes in processing the target file by referring to the relevant status of the computing services provided by the service nodes. This ensures that the computing service can be executed normally, avoids long queuing times caused by lower transmission latency, and avoids consuming excessive resources for lower latency, thereby improving resource utilization.

[0018] In conjunction with the first aspect above, in one possible design, the target transmission resources include at least one of the following: time-frequency resources; channel resources.

[0019] In conjunction with the first aspect above, in one possible design, the file preprocessing information includes at least one of the following: a task identifier indicating whether file preprocessing should be performed; a processing rule indicating whether file preprocessing should be performed; first information about the target preprocessing model and / or algorithm; and input parameters required by the target preprocessing model and / or algorithm.

[0020] In conjunction with the first aspect mentioned above, in one possible design, the processing rules include: performing file preprocessing when the target file reaches the target size threshold.

[0021] In conjunction with the first aspect above, in one possible design, the first information includes at least one of the following: name information of the target preprocessing model and / or algorithm; accuracy information of the target preprocessing model and / or algorithm; version information of the target preprocessing model and / or algorithm; and hardware information used to execute the target preprocessing model and / or algorithm.

[0022] In conjunction with the first aspect above, in one possible design, the input parameters required by the target preprocessing model and / or algorithm include at least one of the following: target compression ratio; target compression quality; target quality of service requirements.

[0023] In conjunction with the first aspect above, in one possible design, the file inverse processing information includes at least one of the following: second information of the target inverse processing model and / or algorithm; input parameters required by the target inverse processing model and / or algorithm.

[0024] In conjunction with the first aspect above, in one possible design, the second information includes at least one of the following: name information of the target inverse processing model and / or algorithm; accuracy information of the target inverse processing model and / or algorithm; version information of the target inverse processing model and / or algorithm; and hardware information used to execute the target inverse processing model and / or algorithm.

[0025] In conjunction with the first aspect above, in one possible design, the input parameters required by the target inverse processing model and / or algorithm include at least one of the following: target decompression quality; target hardware requirements.

[0026] In conjunction with the first aspect mentioned above, in one possible design, the header of the preprocessed target file carries at least one of the following: file preprocessing information; partial information from the file preprocessing information; file inverse processing information; or partial information from the file inverse processing information. Since there is usually a time difference between the preprocessing and inverse processing flows, they may not execute the same decision. Therefore, exchanging preprocessing and inverse processing information through the header ensures the consistency and timeliness of processing parameters and content information, fully guaranteeing optimal QoS.

[0027] In conjunction with the first aspect described above, in one possible design, the method further includes at least one of the following: sending a transmission request message to a first node; sending a transmission request message to a second node; and sending a transmission request message to an intermediate node. The target node may notify any one of the first, second, and intermediate nodes in advance that it needs to manage the transmission of the target file, ensuring that any one of the first, second, and intermediate nodes is ready to transmit the target file.

[0028] In conjunction with the first aspect described above, in one possible design, the transmission request information includes at least one of the following: an identifier for determining the transmission strategy of the target file; and quality of service (QoS) requirement information for the target file. The identifier for determining the transmission strategy of the target file may indicate that the first node, second node, and intermediate nodes need to provide their own node status information for the subsequent determination of the transmission strategy. The QoS requirement information for the target file is used to indicate the transmission requirements for file transmission to the first node, second node, and intermediate nodes, ensuring the quality of service for file transmission between nodes.

[0029] In conjunction with the first aspect described above, in one possible design, the method further includes at least one of the following: receiving first status information sent by a first node; receiving second status information sent by a second node; and receiving third status information sent by an intermediate node.

[0030] In conjunction with the first aspect described above, in one possible design, the method further includes at least one of the following: sending the target transmission strategy to a first node; sending the target transmission strategy to a second node; and sending the target transmission strategy to an intermediate node. After determining the transmission strategy for the target file, the target node can adjust the resource parameters of the sending and receiving nodes in processing the target file through strategy distribution, and adjust the transmission resources allocated by the intermediate node for the target file during transmission.

[0031] In conjunction with the first aspect described above, in one possible design, the method further includes at least one of the following: receiving first verification information sent by a first node, the first verification information being used to verify the transmission strategy received by the first node; receiving second verification information sent by a second node, the second verification information being used to verify the transmission strategy received by the second node; and receiving third verification information sent by an intermediate node, the third verification information being used to verify the transmission strategy received by the intermediate node. The target node verifies whether the transmission strategy received by the target node is the same as the transmission strategy sent by the target node by receiving verification information from any of the first node, the second node, and the intermediate node.

[0032] In conjunction with the first aspect described above, in one possible design, the method further includes at least one of the following: sending a first acknowledgment to a first node if the transmission strategy in the first verification information matches the target transmission strategy; sending a second acknowledgment to a second node if the transmission strategy in the second verification information matches the target transmission strategy; and sending a third acknowledgment to an intermediate node if the transmission strategy in the third verification information matches the target transmission strategy. The target node verifies the transmission strategy received by any of the first, second, and intermediate nodes through a handshake confirmation process, ensuring that the node can receive the accurate transmission strategy.

[0033] In conjunction with the first aspect mentioned above, in one possible design, the system receives updated first status information sent by the first node; if the updated first status information and the first status information satisfy a first condition, the transmission strategy for the target file is redefined. The target node can update and manage the transmission strategy for the target file based on the status changes actively reported by the first node to ensure that the transmission strategy matches the status of the first node.

[0034] In conjunction with the first aspect above, in one possible design, the first condition includes at least one of the following: the information difference between the updated first state information and the first state information is greater than a first information difference threshold; the transmission time interval between the updated first state information and the first state information is greater than a first time difference threshold; the first parameter information is greater than a first parameter threshold, and the first parameter information is composed of the information difference between the updated first state information and the first state information and the transmission time interval.

[0035] In conjunction with the first aspect mentioned above, in one possible design, the updated second status information sent by the second node is received; if the updated second status information and the second status information satisfy the second condition, the transmission strategy of the target file is redefined. The target node can update and manage the transmission strategy of the target file based on the status changes actively reported by the second node to ensure that the transmission strategy matches the status of the second node.

[0036] In conjunction with the first aspect above, in one possible design, the second condition includes at least one of the following: the information difference between the updated second state information and the second state information is greater than a second information difference threshold; the transmission time interval between the updated second state information and the second state information is greater than a second time difference threshold; the second parameter information is greater than a second parameter threshold, and the second parameter information is composed of the information difference between the updated second state information and the second state information and the transmission time interval.

[0037] In conjunction with the first aspect mentioned above, in one possible design, the system receives updated third state information sent by intermediate nodes. If the updated third state information and the original third state information satisfy the third condition, the transmission strategy for the target file is redefined. The target node can update and manage the transmission strategy for the target file based on the state changes actively reported by the intermediate nodes to ensure that the transmission strategy matches the state of the intermediate nodes.

[0038] In conjunction with the first aspect above, in one possible design, the third condition includes at least one of the following: the information difference between the updated third state information and the third state information is greater than the third information difference threshold; the transmission time interval between the updated third state information and the third state information is greater than the third time difference threshold; the third parameter information is greater than the third parameter threshold, and the third parameter information is composed of the information difference between the updated third state information and the third state information and the transmission time interval.

[0039] In conjunction with the first aspect mentioned above, in one possible design, at a preset time within a preset period, the first state information of the first node, the second state information of the second node, and the third state information of the intermediate node at the preset time are obtained. Based on the first, second, and third state information at the preset time, the transmission strategy for the target file is redefined. The target node can periodically and proactively query the state information of the first, second, and intermediate nodes to update the transmission strategy for managing the target file, thereby avoiding a situation where any of the first, second, and intermediate nodes fails to detect state changes in a timely manner, resulting in a mismatch in the transmission strategy.

[0040] In conjunction with the first aspect mentioned above, in one possible design, if the redefined first transmission strategy differs from the target transmission strategy, the first transmission strategy is sent to at least one of the first node, the second node, and the intermediate node. The target node can then send the new transmission strategy to the first node, the second node, and the intermediate node if the redefined new transmission strategy differs from the original transmission strategy, thus avoiding the repeated transmission of the same strategy even when the new transmission strategy is identical to the original one.

[0041] In conjunction with the first aspect mentioned above, in one possible design, the first node is a user node, the second node is a service node, and the intermediate node is a base station; or, the first node is a service node, the second node is a user node, and the intermediate node is a base station.

[0042] In conjunction with the first aspect mentioned above, in one possible design, the target node is either a base station or a service node.

[0043] In conjunction with the first aspect mentioned above, in one possible design, the target node is the central unit in the base station.

[0044] In conjunction with the first aspect mentioned above, in one possible design, the service node is any user node other than the first node.

[0045] Secondly, a transmission management method is provided. This method can be executed by a first node, or by a component of the first node, such as its processor, chip, or chip system. It can also be implemented by a logic module or software capable of performing all or part of the functions of the first node. The following explanation uses the execution of this method by the first node as an example. In this transmission management method, the first node performs file preprocessing, including: obtaining a target transmission strategy, which includes file preprocessing information; performing file preprocessing on the target file to be sent to the second node based on the file preprocessing information to obtain a preprocessed target file; and sending the preprocessed target file to the intermediate node between the first and second nodes.

[0046] In conjunction with the second aspect mentioned above, in one possible design, file preprocessing is used to reduce the file size.

[0047] In conjunction with the second aspect above, in one possible design, the file preprocessing information includes at least one of the following:

[0048] A task identifier used to indicate whether file preprocessing should be performed;

[0049] Processing rules used to instruct on the execution of file preprocessing;

[0050] The first information of the target preprocessing model and / or algorithm;

[0051] The input parameters required by the target preprocessing model and / or algorithm.

[0052] In conjunction with the second aspect above, in one possible design, the processing rules include: performing file preprocessing when the target file reaches the target size threshold.

[0053] In conjunction with the second aspect above, in one possible design, the first information includes at least one of the following:

[0054] Name information of the target preprocessing model and / or algorithm;

[0055] Accuracy information of the target preprocessing model and / or algorithm;

[0056] Version information of the target preprocessing model and / or algorithm;

[0057] Hardware information used for target preprocessing model and / or algorithm execution.

[0058] In conjunction with the second aspect above, in one possible design, the input parameters required by the target preprocessing model and / or algorithm include at least one of the following:

[0059] Target compression ratio;

[0060] Target compression quality;

[0061] Target service quality requirements.

[0062] In conjunction with the second aspect above, in one possible design, the target transmission strategy further includes: file inverse processing information; the header of the preprocessed target file carries at least one of the following:

[0063] File preprocessing information;

[0064] Partial information from file preprocessing information;

[0065] Reverse processing information of files;

[0066] Partial information from the file reverse processing information.

[0067] In conjunction with the second aspect above, in one possible design, the file reverse processing information includes at least one of the following:

[0068] The second information of the target inverse processing model and / or algorithm;

[0069] The input parameters required for the target inverse processing model and / or algorithm.

[0070] In conjunction with the second aspect above, in one possible design, the second information includes at least one of the following:

[0071] Name information of the target inverse processing model and / or algorithm;

[0072] Accuracy information of the target inverse processing model and / or algorithm;

[0073] Version information of the target inverse processing model and / or algorithm;

[0074] Hardware information used for the execution of the target inverse processing model and / or algorithm.

[0075] In conjunction with the second aspect above, in one possible design, the input parameters required by the target inverse processing model and / or algorithm include at least one of the following:

[0076] Target decompression quality;

[0077] Target hardware requirements.

[0078] In conjunction with the second aspect above, in one possible design, the first node is a user node, the second node is a service node, and the intermediate node is a base station; or, the first node is a service node, the second node is a user node, and the intermediate node is a base station.

[0079] In conjunction with the second aspect mentioned above, in one possible design, the service node is any user node other than the first node.

[0080] In conjunction with the second aspect above, in one possible design, the first node is a user node; the method further includes: sending first status information to the target node, the first status information including preprocessing capability information of the first node performing file preprocessing and / or transmission task information of the target file; and receiving the target transmission strategy sent by the target node.

[0081] In conjunction with the second aspect above, in one possible design, the preprocessing capability information includes at least one of the following:

[0082] The identifier of at least one preprocessing model and / or algorithm;

[0083] At least one adjustable parameter index for the preprocessing model and / or algorithm;

[0084] The correlation between parameter tuning and preprocessing time for at least one preprocessing model and / or algorithm;

[0085] At least one preprocessing model and / or algorithm, each preprocessing model and / or algorithm has a corresponding inverse processing model and / or algorithm;

[0086] Queuing status of preprocessing tasks;

[0087] Available computing resources for preprocessing;

[0088] Estimated preprocessing time for the target file.

[0089] In conjunction with the second aspect above, in one possible design, the transmission of task information includes at least one of the following:

[0090] File size;

[0091] Buffer size;

[0092] File format;

[0093] Color channels of media files;

[0094] File characteristics;

[0095] The time window for file transfer;

[0096] The first node prioritizes the transmission of the target file.

[0097] In conjunction with the second aspect above, in one possible design, the method further includes: receiving transmission request information sent by the target node;

[0098] The transmission request information includes at least one of the following:

[0099] An identifier used to determine the transmission strategy of the target file;

[0100] Service quality requirements information for the target file.

[0101] In conjunction with the second aspect above, in one possible design, the method further includes: sending first verification information to the target node according to the received target transmission strategy, wherein the first verification information is used to verify the transmission strategy received by the first node.

[0102] In conjunction with the second aspect above, in one possible design, the method further includes: receiving first confirmation information sent by the target node, the first confirmation information being used to indicate that the target transmission strategy received by the first node matches the target transmission strategy sent by the target node.

[0103] In conjunction with the second aspect above, in one possible design, the method further includes: sending updated first status information to the target node when there are changes in the preprocessing capability information and / or transmission task information, wherein the updated first status information includes: the changed preprocessing capability information and / or the changed transmission task information.

[0104] In conjunction with the second aspect above, in one possible design, the method further includes: receiving a first transmission strategy sent by the target node, wherein the first transmission strategy is different from the target transmission strategy.

[0105] In conjunction with the second aspect mentioned above, in one possible design, the target node is either a base station or a service node.

[0106] In conjunction with the second aspect mentioned above, in one possible design, the target node is the central unit in the base station.

[0107] Thirdly, a transmission management method is provided. This method can be executed by an intermediate node, or by a component of the intermediate node, such as its processor, chip, or chip system. It can also be implemented by a logic module or software capable of performing all or part of the intermediate node's functions. The following explanation uses the execution of this method by an intermediate node as an example. This transmission management method includes: obtaining a target transmission strategy, which includes target transmission resources; and allocating target transmission resources to a first node, where the target transmission resources are the transmission resources used by the first node to transmit a target file to a second node.

[0108] In conjunction with the third aspect above, in one possible design, the target transmission resource includes at least one of the following:

[0109] Time and frequency resources;

[0110] Channel resources.

[0111] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: receiving the preprocessed target file from the first node; and sending the preprocessed target file to the second node.

[0112] In conjunction with the third aspect mentioned above, in one possible design, the header of the preprocessed target file carries at least one of the following:

[0113] File preprocessing information;

[0114] Partial information from file preprocessing information;

[0115] Reverse processing information of files;

[0116] Partial information from the file reverse processing information.

[0117] In conjunction with the third aspect mentioned above, in one possible design, the file preprocessing information includes at least one of the following:

[0118] A task identifier used to indicate whether file preprocessing should be performed;

[0119] Processing rules used to instruct on the execution of file preprocessing;

[0120] The first information of the target preprocessing model and / or algorithm;

[0121] The input parameters required by the target preprocessing model and / or algorithm.

[0122] In conjunction with the third aspect mentioned above, in one possible design, the processing rules include: performing file preprocessing when the target file reaches the target size threshold.

[0123] In conjunction with the third aspect above, in one possible design, the first information includes at least one of the following:

[0124] Name information of the target preprocessing model and / or algorithm;

[0125] Accuracy information of the target preprocessing model and / or algorithm;

[0126] Version information of the target preprocessing model and / or algorithm;

[0127] Hardware information used for target preprocessing model and / or algorithm execution.

[0128] In conjunction with the third aspect above, in one possible design, the input parameters required by the target preprocessing model and / or algorithm include at least one of the following:

[0129] Target compression ratio;

[0130] Target compression quality;

[0131] Target service quality requirements.

[0132] In conjunction with the third aspect mentioned above, in one possible design, the file reverse processing information includes at least one of the following:

[0133] The second information of the target inverse processing model and / or algorithm;

[0134] The input parameters required for the target inverse processing model and / or algorithm.

[0135] In conjunction with the third aspect above, in one possible design, the second information includes at least one of the following:

[0136] Name information of the target inverse processing model and / or algorithm;

[0137] Accuracy information of the target inverse processing model and / or algorithm;

[0138] Version information of the target inverse processing model and / or algorithm;

[0139] Hardware information used for the execution of the target inverse processing model and / or algorithm.

[0140] In conjunction with the third aspect above, in one possible design, the input parameters required by the target inverse processing model and / or algorithm include at least one of the following:

[0141] Target decompression quality;

[0142] Target hardware requirements.

[0143] In conjunction with the third aspect mentioned above, in one possible design, the target transmission strategy further includes: file preprocessing information and file inverse processing information; the method further includes: determining the target transmission strategy based on the information carried in the header of the preprocessed target file; and allocating target transmission resources in the target transmission strategy to the first node.

[0144] In conjunction with the third aspect mentioned above, in one possible design, the intermediate node performs file inverse processing; the method further includes: performing file inverse processing on the preprocessed target file according to the file inverse processing information carried in the header of the preprocessed target file to obtain the inverse-processed target file; and sending the inverse-processed target file to the second node.

[0145] In conjunction with the third aspect mentioned above, in one possible design, the intermediate node performs file inverse processing; the method further includes: performing file inverse processing on the preprocessed target file according to the file inverse processing information in the target transmission strategy to obtain the inverse-processed target file; and sending the inverse-processed target file to the second node.

[0146] In conjunction with the third aspect mentioned above, in one possible design, file inverse processing is used to restore or partially restore the file to its state before file preprocessing, which is used to reduce the file size.

[0147] In conjunction with the third aspect mentioned above, in one possible design, the first node is a user node, the second node is a service node, and the intermediate node is a base station; or, the first node is a service node, the second node is a user node, and the intermediate node is a base station.

[0148] In conjunction with the third aspect mentioned above, in one possible design, the first node is a service node, the second node is a user node, the intermediate node performs file preprocessing, and the target transmission strategy further includes: file preprocessing information; the method further includes: receiving a target file from the first node; performing file preprocessing on the target file according to the file preprocessing information in the target transmission strategy to obtain a preprocessed target file; and sending the preprocessed target file to the second node.

[0149] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: sending third state information to the target node, the third state information including at least one of the following: air interface state information between the first node and the second node, preprocessing capability information of the intermediate node performing file preprocessing, and inverse processing capability information of the intermediate node performing file inverse processing; and receiving the target transmission strategy sent by the target node.

[0150] In conjunction with the third aspect mentioned above, in one possible design, the air interface status information includes at least one of the following:

[0151] Signal-to-noise ratio;

[0152] Signal reference point;

[0153] Spectral efficiency;

[0154] Channel quality metrics;

[0155] Transmission resources pre-allocated for different transmission tasks;

[0156] Rules for allocating transmission resources for different transmission tasks.

[0157] In conjunction with the third aspect mentioned above, in one possible design, the intermediate node performs file preprocessing, and the third state information includes: preprocessing capability information; the preprocessing capability information includes at least one of the following:

[0158] The identifier of at least one preprocessing model and / or algorithm;

[0159] At least one adjustable parameter index for the preprocessing model and / or algorithm;

[0160] The correlation between parameter tuning and preprocessing time for at least one preprocessing model and / or algorithm;

[0161] At least one preprocessing model and / or algorithm, each preprocessing model and / or algorithm has a corresponding inverse processing model and / or algorithm;

[0162] Queuing status of preprocessing tasks;

[0163] Available computing resources for preprocessing;

[0164] Estimated preprocessing time for the target file.

[0165] In conjunction with the third aspect mentioned above, in one possible design, the intermediate node performs file reverse processing, and the third state information includes: reverse processing capability information; the reverse processing capability information includes at least one of the following:

[0166] The identifier of at least one inverse processing model and / or algorithm;

[0167] At least one adjustable parameter index for the inverse processing model and / or algorithm;

[0168] The correlation between parameter tuning and inverse processing time for at least one inverse processing model and / or algorithm;

[0169] At least one inverse processing model and / or algorithm, each inverse processing model and / or algorithm corresponding to a preprocessing model and / or algorithm;

[0170] Reverse the queuing state of processing tasks;

[0171] Available computing resources for inverse processing;

[0172] The estimated time for reverse processing of the target file.

[0173] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: receiving transmission request information sent by the target node;

[0174] The transmission request information includes at least one of the following:

[0175] An identifier used to determine the transmission strategy of the target file;

[0176] Service quality requirements information for the target file.

[0177] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: sending third verification information to the target node according to the received target transmission strategy, wherein the third verification information is used to verify the transmission strategy received by the intermediate node.

[0178] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: receiving a third confirmation message sent by the target node, the third confirmation message being used to indicate that the target transmission strategy received by the intermediate node matches the target transmission strategy sent by the target node.

[0179] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: sending updated third status information to the target node when any of the air interface status information, preprocessing capability information, or inverse processing capability information changes. The updated third status information includes at least one of the following: the changed air interface status information, the changed preprocessing capability information, or the changed inverse processing capability information.

[0180] In conjunction with the third aspect mentioned above, in one possible design, the method further includes: receiving a first transmission strategy sent by the target node, wherein the first transmission strategy is different from the target transmission strategy.

[0181] In conjunction with the third aspect mentioned above, in one possible design, the target node is a service node.

[0182] In conjunction with the third aspect mentioned above, in one possible design, the intermediate node is the distribution unit in the base station, and the target node is the central unit in the base station.

[0183] Fourthly, a transmission management method is provided. This method can be executed by a second node, or by a component of the second node, such as its processor, chip, or chip system. It can also be implemented by a logic module or software capable of performing all or part of the functions of the second node. The following explanation uses the execution of this method by the second node as an example. In this transmission management method, the second node performs file inverse processing, including: obtaining a target transmission strategy, which includes file inverse processing information; receiving a preprocessed target file sent by an intermediate node between the second node and the first node; and performing file inverse processing on the preprocessed target file according to the file inverse processing information to obtain the inverse-processed target file.

[0184] In conjunction with the fourth aspect mentioned above, in one possible design, file inverse processing is used to restore or partially restore the file to its state before file preprocessing, while file preprocessing is used to reduce the file size.

[0185] In conjunction with the fourth aspect above, in one possible design, the file reverse processing information includes at least one of the following:

[0186] The second information of the target inverse processing model and / or algorithm;

[0187] The input parameters required for the target inverse processing model and / or algorithm.

[0188] In conjunction with the fourth aspect above, in one possible design, the second information includes at least one of the following:

[0189] Name information of the target inverse processing model and / or algorithm;

[0190] Accuracy information of the target inverse processing model and / or algorithm;

[0191] Version information of the target inverse processing model and / or algorithm;

[0192] Hardware information used for the execution of the target inverse processing model and / or algorithm.

[0193] In conjunction with the fourth aspect above, in one possible design, the input parameters required by the target inverse processing model and / or algorithm include at least one of the following:

[0194] Target decompression quality;

[0195] Target hardware requirements.

[0196] In conjunction with the fourth aspect above, in one possible design, the header of the preprocessed target file carries at least one of the following:

[0197] File preprocessing information;

[0198] Partial information from file preprocessing information;

[0199] Reverse processing information of files;

[0200] Partial information from the file reverse processing information.

[0201] In conjunction with the fourth aspect above, in one possible design, the file preprocessing information includes at least one of the following:

[0202] A task identifier used to indicate whether file preprocessing should be performed;

[0203] Processing rules used to instruct on the execution of file preprocessing;

[0204] The first information of the target preprocessing model and / or algorithm;

[0205] The input parameters required by the target preprocessing model and / or algorithm.

[0206] In conjunction with the fourth aspect mentioned above, in one possible design, the processing rules include: performing file preprocessing when the target file reaches the target size threshold.

[0207] In conjunction with the fourth aspect above, in one possible design, the first information includes at least one of the following:

[0208] Name information of the target preprocessing model and / or algorithm;

[0209] Accuracy information of the target preprocessing model and / or algorithm;

[0210] Version information of the target preprocessing model and / or algorithm;

[0211] Hardware information used for target preprocessing model and / or algorithm execution.

[0212] In conjunction with the fourth aspect above, in one possible design, the input parameters required by the target preprocessing model and / or algorithm include at least one of the following:

[0213] Target compression ratio;

[0214] Target compression quality;

[0215] Target service quality requirements.

[0216] In conjunction with the fourth aspect mentioned above, in one possible design, the method further includes: performing file inverse processing on the preprocessed target file based on the file inverse processing information carried in the header of the preprocessed target file to obtain the inverse-processed target file.

[0217] In conjunction with the fourth aspect mentioned above, in one possible design, the second node is a service node; or, the second node is a user node.

[0218] In conjunction with the fourth aspect above, in one possible design, the method further includes: sending second status information to the target node, the second status information including: service status information of the second node and / or reverse processing capability information of the second node to perform file reverse processing; and receiving the target transmission strategy sent by the target node.

[0219] In conjunction with the fourth aspect above, in one possible design, the inverse processing capability information includes at least one of the following:

[0220] The identifier of at least one inverse processing model and / or algorithm;

[0221] At least one adjustable parameter index for the inverse processing model and / or algorithm;

[0222] The correlation between parameter tuning and inverse processing time for at least one inverse processing model and / or algorithm;

[0223] At least one inverse processing model and / or algorithm, each inverse processing model and / or algorithm corresponding to a preprocessing model and / or algorithm;

[0224] Reverse the queuing state of processing tasks;

[0225] Available computing resources for inverse processing;

[0226] The estimated time for reverse processing of the target file.

[0227] In conjunction with the fourth aspect above, in one possible design, the service status information includes at least one of the following:

[0228] The queuing status of the service tasks in which the target file participates;

[0229] The priority of the service tasks in which the target file participates;

[0230] The impact of preprocessing / reverse processing on the quality of service in service tasks involving the target file;

[0231] Priority of the request to send the first node of the target file.

[0232] In conjunction with the fourth aspect mentioned above, in one possible design, the method further includes: receiving transmission request information sent by the target node;

[0233] The transmission request information includes at least one of the following:

[0234] An identifier used to determine the transmission strategy of the target file;

[0235] Service quality requirements information for the target file.

[0236] In conjunction with the fourth aspect above, in one possible design, the method further includes: sending second verification information to the target node according to the received target transmission strategy, wherein the second verification information is used to verify the transmission strategy received by the second node.

[0237] In conjunction with the fourth aspect above, in one possible design, the method further includes: receiving a second confirmation message sent by the target node, the second confirmation message being used to indicate that the target transmission strategy received by the second node matches the target transmission strategy sent by the target node.

[0238] In conjunction with the fourth aspect above, in one possible design, the method further includes: sending updated third status information to the target node when there are changes in service status information and / or reverse processing capability information, wherein the updated third status information includes: the changed service status information and / or the changed reverse processing capability information.

[0239] In conjunction with the fourth aspect mentioned above, in one possible design, the method further includes: receiving a first transmission strategy sent by the target node, wherein the first transmission strategy is different from the target transmission strategy.

[0240] In conjunction with the fourth aspect mentioned above, in one possible design, the target node is the base station between the first node and the second node that sent the target file.

[0241] In conjunction with the fourth aspect mentioned above, in one possible design, the target node is the central unit in the base station.

[0242] Fifthly, a communication apparatus is provided for implementing various methods. The communication apparatus includes modules, units, or means corresponding to the implementation of the methods, wherein the modules, units, or means can be implemented in hardware, software, or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions.

[0243] In some possible designs, the communication device may include a processing module and a transceiver module. The processing module can be used to implement the processing functions in any of the above aspects and any possible implementations thereof. The transceiver module may include a receiving module and a transmitting module, respectively used to implement the receiving function and the transmitting function in any of the above aspects and any possible implementations thereof.

[0244] In some possible designs, the transceiver module can consist of transceiver circuitry, a transceiver unit, a transceiver interface, or a communication interface.

[0245] A sixth aspect provides a communication device, comprising: a processor and a memory; the memory being used to store computer instructions that, when executed by the processor, cause the communication device to perform the method described in any of the above aspects and any possible design thereof.

[0246] A seventh aspect provides a communication device, comprising: a processor and a communication interface; the communication interface being used to communicate with a module outside the communication device; the processor being used to execute computer programs or instructions to cause the communication device to perform the methods described in any of the above aspects and any possible designs thereof.

[0247] Eighthly, a communication device is provided, comprising: at least one processor; said processor being configured to execute a computer program or instructions stored in a memory to cause the communication device to perform the methods described in any of the preceding aspects and any possible designs thereof. The memory may be coupled to the processor, or may be independent of the processor.

[0248] In a ninth aspect, a communication device (e.g., a chip or chip system) is provided, the communication device including a processor for implementing the functions involved in any of the above aspects and any possible designs thereof.

[0249] In some possible designs, the communication device includes a memory for storing necessary program instructions and data.

[0250] In some possible designs, when the device is a chip system, it can be composed of chips or contain chips and other discrete components.

[0251] The communication device described in the sixth to ninth aspects may be the target node in the first aspect, the first node in the second aspect, the intermediate node in the third aspect, the second node in the fourth aspect, or a device contained in the target node, the first node, the intermediate node, or the second node, such as a chip or chip system.

[0252] In a tenth aspect, a communication device is provided, which may be any one of a target node, a first node, an intermediate node, and a second node, or may be a module or unit (e.g., a chip, a chip system, or a circuit) that corresponds one-to-one with the target node, the first node, the intermediate node, and the second node in performing the methods / operations / steps / actions described in the first aspect, the second aspect, the third aspect, and the fourth aspect, or may be a module or unit that can be matched and used with the target node, the first node, the intermediate node, and the second node.

[0253] It is understandable that when the communication device provided in any of the sixth to tenth aspects is a chip, the sending action / function of the communication device can be understood as outputting information, and the receiving action / function of the communication device can be understood as inputting information.

[0254] Eleventhly, a computer-readable storage medium is provided that stores a computer program or instructions that, when executed on a communication device, enable the communication device to perform the methods described in any of the preceding aspects and any possible designs thereof.

[0255] In a twelfth aspect, a computer program product containing instructions is provided that, when run on a communication device, enables the communication device to perform the methods described in any of the foregoing aspects and any possible design thereof.

[0256] The technical effects of any of the design methods in aspects two through twelfth can be found in the technical effects of different design methods in aspect one, and will not be repeated here. Attached Figure Description

[0257] Figure 1 A schematic diagram illustrating an example of image transmission provided in this application;

[0258] Figure 2 A schematic diagram illustrating an example of hybrid AI communication provided in this application;

[0259] Figure 3 A schematic diagram of the structure of a communication system provided in this application;

[0260] Figure 4 A schematic diagram of the structure of another communication system provided in this application;

[0261] Figure 5 A schematic diagram of the structure of another communication system provided in this application;

[0262] Figure 6 This application provides a schematic diagram of the structure of an open access network system;

[0263] Figure 7 A schematic diagram of the CU-DU-RU segmentation structure in an O-RAN system provided in this application;

[0264] Figure 8 A schematic diagram illustrating the location distribution of strategy determination, compression execution, and decompression execution in an uplink / downlink transmission scenario provided in this application;

[0265] Figure 9 A flowchart illustrating a transmission management method provided in this application;

[0266] Figure 10 A flowchart illustrating another transmission management method provided in this application;

[0267] Figure 11 A flowchart illustrating another transmission management method provided in this application;

[0268] Figure 12 A flowchart illustrating another transmission management method provided in this application;

[0269] Figure 13 A flowchart illustrating another transmission management method provided in this application;

[0270] Figure 14 A flowchart illustrating another transmission management method provided in this application;

[0271] Figure 15 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0272] Figure 16 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0273] Figure 17 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0274] Figure 18 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0275] Figure 19 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0276] Figure 20 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0277] Figure 21 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0278] Figure 22 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0279] Figure 23 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0280] Figure 24 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0281] Figure 25 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0282] Figure 26A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0283] Figure 27 A schematic diagram illustrating another interactive example of transmission management provided in this application;

[0284] Figure 28 A schematic diagram of the structure of a communication device provided in this application;

[0285] Figure 29 A schematic diagram of the structure of a communication device provided in this application;

[0286] Figure 30 A schematic diagram of the structure of a communication device provided in this application;

[0287] Figure 31 A schematic diagram of the structure of a communication device provided in this application;

[0288] Figure 32 A schematic diagram of another communication device provided in this application;

[0289] Figure 33 A schematic diagram of another communication device provided in this application. Detailed Implementation

[0290] In the description of this application, unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can mean A or B. "And / or" in this application is merely a description of the relationship between the related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. A and B can be singular or plural.

[0291] In the description of this application, unless otherwise stated, "multiple" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of a single item or a plurality of items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0292] Furthermore, to facilitate a clear description of the technical solutions in the embodiments of this application, the terms "first" and "second" are used in the embodiments of this application to distinguish identical or similar items with substantially the same function and effect. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or execution order, and the terms "first" and "second" are not necessarily different.

[0293] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0294] It is understood that the term "embodiment" used throughout the specification means that a specific feature, structure, or characteristic related to an embodiment is included in at least one embodiment of this application. Therefore, various embodiments throughout the specification do not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments. It is understood that in the various embodiments of this application, the sequence number of each process does not imply the order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0295] It is understood that in this application, "...when" and "if" both refer to the corresponding processing that will be carried out under certain objective circumstances, and are not limited to a specific time, nor do they require a judgment action to be performed during implementation, nor do they imply any other limitations.

[0296] It is understood that some optional features in the embodiments of this application can be implemented independently in certain scenarios without relying on other features, such as the current solution on which they are based, to solve the corresponding technical problems and achieve the corresponding effects. Alternatively, they can be combined with other features as needed in certain scenarios. Correspondingly, the apparatus given in the embodiments of this application can also implement these features or functions, which will not be elaborated here.

[0297] In this application, unless otherwise specified, the same or similar parts between the various embodiments can be referred to each other. In the various embodiments of this application, unless otherwise specified or there is a logical conflict, the terminology and / or descriptions between different embodiments are consistent and can be mutually referenced. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships. The following descriptions of the embodiments of this application do not constitute a limitation on the scope of protection of this application.

[0298] To facilitate understanding of the technical solutions of the embodiments of this application, a brief introduction to the relevant technologies of this application is given below.

[0299] In recent years, with the development of communication technology, business interactions between different nodes in communication systems have become increasingly frequent, and users' demands for file transfer between nodes have also increased. For example, business files transferred between nodes can be media files.

[0300] Media file sizes can be compressed using different encoding methods, such as the Joint Photographic Experts Group (JPEG) encoding format. When image quality degradation is imperceptible to the human eye, JPEG typically achieves a compression ratio of 8-10 times compared to Portable Network Graphics (PNG) format. Based on current artificial intelligence (AI) technology, this compression ratio can be further increased to around 20-30 times. However, current large-scale media file compression models can generally only recognize and process common media formats such as JPEG, PNG, and Graphics Interchange Format (GIF). They cannot directly recognize AI-based compressed encoding formats and require a decoder to restore them to their common encoding formats before processing.

[0301] For example, when a user uploads media files to a cloud server via their mobile phone and uses a large cloud model for AI computing services, the file transfer latency depends on the channel conditions and the file size. In situations of communication congestion, AI media compression can reduce the file size and thus reduce transmission latency; however, uploading compressed media will increase the compression and decompression time.

[0302] For example, such as Figure 1 The diagram illustrates an example of image transmission optimized using a media compression-based transmission strategy. The mobile phone (sender) compresses the original image to obtain a compressed image, which is then transmitted via communication. The server (receiver) receives the image via this communication transmission and decompresses it to obtain the restored image.

[0303] In media compression-based transmission strategies, the overall latency consists of three parts: compression (or encoding), decompression (or decoding), and queuing time for transmission and service tasks (such as computational tasks). The overall transmission latency (E2E latency) can be expressed by the following formula:

[0304]

[0305] The media compression time (Enc) originates from the terminal and depends on the original size of the media file, the computing power of the compression terminal, and the selected compression model. The decompression time (Dec) originates from the server or remote edge-interlligent node (FEIN) and depends on the computing power of the decompression terminal, the number of users in the decompression queue, and the selected decompression model. Transmission latency... The queuing time Q originates from the terminal and / or base station, depending on channel conditions and the transmission resources allocated by the base station. The queuing time Q depends on the queuing status of computation tasks on the server or FEIN and the priority of the target task.

[0306] It should be noted that FEIN refers to a distributed intelligent computing node (or service node) deployed on or near the radio access network (RAN), and in this application, FEIN refers to a network computing unit (or network computing device, network service device), emphasizing the location of the target service and / or computing service. It can be a network element in the RAN / core network, or a computing unit or service unit that carries computing, such as an edge server or a central server.

[0307] Furthermore, in this application, the terms "compression-decompression" and "encoding-decoding" are used interchangeably, meaning that "media file compression" and "media file encoding" have the same meaning, as do "media file decompression" and "media file decoding." This is because media file compression is typically achieved through encoding, and media file encoding also includes compression functionality. This application does not preclude the existence of media file processing methods that "only compress without encoding" or "only encode without compression," and the scenario applied in this application still applies to these two special cases. In this application, compression and encoding can also be referred to as processing or preprocessing, and decompression and decoding can also be referred to as reverse processing.

[0308] Furthermore, the method referred to in Formula 1 above corresponds to the scenario where media files are uploaded from the user terminal (i.e., the user node) to the network computing device (i.e., the uplink scenario). Therefore, the terminal computing power and compression model size only contribute to the encoding step, while the server computing power, the number of queued users, and the decompression model only contribute to the decoding step. In addition to the aforementioned uplink scenario, this application can also be applied to at least one of the following scenarios:

[0309] Scenario 1: The encoder is on the network computing device, and the decoder is on the user terminal;

[0310] Scenario 2: The encoder is on one user terminal, and the decoder is on another user terminal;

[0311] Scenario 3: Encoders are on network computing devices, decoders are on other network computing devices, and so on.

[0312] In traditional communication processes, source coding is responsible for compressing data to save bandwidth, while channel coding resists noise and bit errors by adding redundant information. This "compress first, protect later" approach performs well when resources are plentiful or the channel is stable, but when channel conditions are complex and bandwidth is limited, the limitations of the separate design become apparent: the lack of coordinated optimization between the source and the channel leads to a decrease in overall efficiency.

[0313] Joint source and channel coding (JSCC) is a novel approach that breaks away from the traditional "separate" design of communication systems. JSCC no longer strictly distinguishes between the tasks of source and channel coding, but rather integrates them into a unified whole, directly generating signals adapted to channel characteristics from source data during transmission. This joint design allows the communication system to dynamically adjust its data transmission strategy based on source characteristics and channel conditions.

[0314] The significant advantages of JSCC lie in its flexibility and efficiency. JSCC is particularly suitable for applications in wireless environments with low signal-to-noise ratios or high bit error rates, such as IoT devices, drone communications, and satellite data transmission. Furthermore, JSCC enables progressive transmission, allowing the receiver (i.e., the receiving node) to recover partial content as it receives only a portion of the data, further improving real-time performance and reliability. In recent years, with the development of deep learning technology, end-to-end neural network architectures have been widely applied in JSCC design. This approach can directly learn complex mapping relationships from data, significantly simplifying system design and improving performance in multimedia transmission such as images and videos.

[0315] For example, the JSCC process includes the following 6 steps (steps 1-6):

[0316] Step 1: Input source data: The sending end (i.e., the sending node) obtains the source data to be transmitted, such as images, audio, or other multimedia data.

[0317] Step 2, Joint Coding: The transmitter directly maps the source data to channel symbols using the JSCC module. This process no longer distinguishes between source coding and channel coding; instead, compression and noise immunity optimization are achieved through a joint model.

[0318] Step 3, Signal Transmission: The transmitting end sends the encoded channel symbols to the receiving end through the communication channel. The channel may contain noise, interference, or other impairments.

[0319] Step 4, Channel Reception: The receiver obtains the damaged signal symbols from the channel.

[0320] Step 5, Joint Decoding: The receiver uses a JSCC decoder to directly recover the source data from the damaged signal. The decoding process comprehensively considers both source and channel characteristics to restore the original data as much as possible.

[0321] Step 6: Output source data: The receiving end outputs the decoded data for use by the user or application.

[0322] However, joint coding treats the source and channel as a whole for joint coding. After coding, the source and channel information cannot be decoupled. This places high demands on the coding model, which needs to fully grasp the complete information of the source and channel, making it difficult to implement.

[0323] Furthermore, the transmission management of the above scheme only improves the integrity and accuracy of the file to be transmitted during the transmission process by using the source channel coding of the sending node. The available computing resources in the receiving node may be insufficient to meet the source channel decoding requirements corresponding to the source channel coding of the sending node, resulting in a mismatch in resource consumption between the sending and receiving ends of file processing and reducing the service quality between nodes.

[0324] Furthermore, if the file uploaded by the sending end is a file within a service task (such as a computation task), then the receiving end essentially represents the computation location of that task. During the file upload process, the sending end can use hybrid AI technology to determine the receiving end.

[0325] For example, such as Figure 2 As shown, the terminal (sender) can comprehensively evaluate the computing task through the application (APP), determine the computing location of the computing task, and upload the computing task (including files in the computing task) to the computing location through forwarding routing. The evaluation content includes computing power, computing volume, latency, privacy requirements, security, etc. The computing location options generally include the terminal (i.e., terminal computing) and cloud server (i.e., cloud computing).

[0326] While hybrid AI technology can select computation locations based on the computational load and power requirements of a task, ensuring that the chosen location meets the task's needs, its routing and forwarding do not consider network-related parameters, thus failing to guarantee optimal end-to-end performance based on network conditions.

[0327] Based on this, the target node in this application can adjust the transmission resources occupied by the file to be transmitted during transmission and the resource parameters of the sending and receiving nodes in processing the file to be transmitted, according to at least one of the status information of the sending and receiving nodes and the status information of the intermediate nodes between the sending and receiving nodes. This ensures that the available processing resources in the sending node meet the processing requirements of the file to be transmitted, the available processing resources in the receiving node meet the requirements of the processed file to be transmitted, and the available transmission resources of the intermediate nodes between the sending and receiving nodes meet the transmission requirements of the file to be transmitted, thereby improving the quality of service between nodes. Furthermore, by comprehensively considering the available processing resources in the sending node, the available processing resources in the receiving node, and the available transmission resources of the intermediate nodes between the sending and receiving nodes, the resource occupancy of the file to be transmitted in the sending node, receiving node, and intermediate nodes can be balanced, improving resource utilization.

[0328] In other words, this application mainly introduces an algorithm or protocol in the network, which receives information from the terminal / network / server side, integrates and calculates it, and outputs the corresponding target file compression-transmission strategy (or decision). In this way, by integrating the information from the three parties of encoding, calculation and communication, an end-to-end latency optimization strategy is achieved.

[0329] In summary, this application can utilize existing source coding compression tools, draw on the technical principles of source-channel joint coding, determine the capabilities and parameters of source coding based on communication conditions, achieve joint optimization of source and channel under weak coupling, and ensure end-to-end QoS and service quality based on information from multiple parties such as coding, calculation, and communication.

[0330] The technical solutions of this application embodiment can be used in various communication systems, including 3GPP communication systems such as 4th generation (4G) systems (e.g., Long Term Evolution (LTE) systems), 5th generation (5G) systems (e.g., New Radio (NR) systems), LTE and 5G hybrid networking systems, integrated communication and sensing systems, non-terrestrial networks (NTN), device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, machine-type communication (MTC) systems, Internet of Things (IoT) systems, or other future communication systems. The communication system can also be a non-3GPP communication system; there is no limitation on this.

[0331] The communication systems described above are merely illustrative examples, and are not limited to those described herein. The communication systems provided in this application do not impose any limitations on the solutions described herein. This will be explained uniformly here and will not be repeated below.

[0332] Figure 3 This is a schematic diagram illustrating one possible, non-limiting system. For example... Figure 3 As shown, the communication system 300 includes a radio access network (RAN) 301 and a core network (CN) 302. RAN 301 includes at least one RAN node (e.g., Figure 3 310a and 310b (collectively referred to as 310) and at least one terminal (such as Figure 3 RAN301, denoted as RAN320a-320j, is collectively referred to as RAN320. RAN301 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 3 (Not shown in the image). Terminal 320 is connected to RAN node 310 wirelessly. RAN node 310 is connected to core network 302 wirelessly or via wired connection. The core network node in core network 302 and RAN node 310 in RAN 301 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0333] In one possible implementation, a core network node can refer to a device in the core network 302 that provides service support to the terminal 320. The core network node in the core network 302 may include at least one of the following: access and mobility management function (AMF) network elements, session management function (SMF) network elements, user plane function (UPF) network elements, policy control function (PCF) network elements, unified data management (UDM) network elements, application function (AF) network elements, network exposure function (NEF) network elements, network slice selection function (NSSF) network elements, or location management function (LMF) network elements, etc. Of course, the core network 302 may also include other core network nodes, without limitation.

[0334] The AMF (Agency Flow Management) network element is deployed in the core network 302, providing mobility management and connectivity management for the network, such as user location updates, user registration with the network, and user handover. The AMF network element can act as an intermediate route between the LMF, SMF, and RAN 301. The SMF network element is mainly responsible for session management in the mobile network, such as session establishment, modification, and release. The UPF (User Plane Function) network element is responsible for connecting to external networks and processing user packets, such as forwarding and accounting. The PCF (Programmable Flow Management) network element is mainly responsible for providing policies to the AMF and SMF, such as Quality of Service (QoS) policies and slice selection policies. The UDM (User DM) network element is used to store user data, such as subscription information and authentication / authorization information. The AF (Agency Flow Management) network element is responsible for providing services to the 3GPP network. The NEF (Network Flow Environment) network element is mainly used to open the capabilities of various network functions and is responsible for converting internal and external information. The LMF network element is deployed in the core network 302, providing positioning functions for the terminal 320; for example, the LMF network element can initiate a positioning process to locate a specific terminal.

[0335] In this application, network elements may also be referred to as entities or functional entities. For example, an AMF network element may also be referred to as an AMF entity or an AMF functional entity. In addition, the aforementioned SMF network elements, UPF network elements, PCF network elements, UDM network elements, AF network elements, NEF network elements, and LMF network elements may have other names in future communication systems, and this application does not impose specific limitations on them.

[0336] In one possible implementation, RAN 301 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as a 4G, 5G mobile communication system, or a future-oriented evolution system. RAN 301 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), an NTN network (such as an NTN supporting pass-through mode and / or regenerative mode, or an NTN supporting eye-viewing mode (earth fixed cell) and / or non-eye-viewing mode (earth moving cell), or a wireless fidelity (WiFi) system. RAN 301 can also be a communication system that integrates two or more of the above systems.

[0337] RAN node 310, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and assists terminals in achieving wireless access. Multiple RAN nodes 310 in RAN 301 can be of the same type or different types. In some scenarios, the roles of RAN node 310 and terminal 320 are relative, for example... Figure 3 Network element 320i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminals 320j that access RAN 301 through network element 320i, network element 320i is a base station; however, for base station 310a, network element 320i is a terminal. RAN node 310 and terminal 320 are sometimes referred to as communication devices, for example... Figure 3 Network elements 310a and 310b can be understood as communication devices with base station functions, while network elements 320a-320j can be understood as communication devices with terminal functions.

[0338] For RAN node 310, in one possible scenario, RAN node 310 can be a base station, an evolved NodeB (eNodeB, also known as eNB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a future base station in a future mobile communication system, or an access node in a WiFi system, etc. RAN node 310 can also be a macro base station (such as...) Figure 3 310a), micro base stations or indoor stations (such as Figure 3 The network equipment can be 310b), a relay node or donor node, or a wireless controller in a CRAN scenario. Examples include: satellite base stations, radio network controllers (RNCs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved NodeBs, or home NodeBs, HNBs), relay stations, balloon stations, drone stations, wireless backhaul nodes, or grant nodes (G nodes) in satellite telemetry. It is understood that network equipment can be ground-based or non-ground-based (e.g., satellites, drones, high-altitude communication equipment). Furthermore, the names of network equipment with base station functions may differ in communication systems employing different wireless access technologies; this application does not limit this. Optionally, RAN node 310 can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). RAN node 310 is also known as the nextgeneration-RAN (NG-RAN) node.

[0339] In another possible scenario, multiple RAN nodes 310 collaborate to assist the terminal in achieving wireless access, with each RAN node 310 implementing a portion of the base station's functions. For example, a RAN node 310 can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0340] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0341] In one possible scenario, terminal 320 can be a device used to implement wireless communication functions, such as a terminal, a chip system or circuit that can be used in the terminal, or an entity associated with the terminal. Specifically, terminal 320 can be user equipment (UE), access terminal, terminal unit, terminal station, mobile station (MS), mobile station, remote station, remote terminal, mobile device, wireless communication equipment, terminal agent or terminal device, subscriber unit, smartphone, wireless data card, tablet computer, wireless modem, laptop computer, machine type communication (MTC) terminal, tag, etc., in a 5G network or a future evolved public land mobile network (PLMN). Access terminals can be cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handsets with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, in-vehicle devices or wearable devices, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, self-driving, remote medical, smart grid, transportation safety, smart city, smart home, or terminal nodes (T-nodes) in a constellation, etc. In one possible implementation, terminal 320 can be mobile or fixed. It is understood that the terminal and the mobile user can be completely independent. All user-related information can be stored in a subscriber identity module (SIM) card, which can be used on the terminal. The terminal can then interact with network-side devices by sending and / or receiving signals over the air interface.

[0342] The chip system or circuit in the terminal includes components inside the terminal, such as chips and other discrete devices (e.g., central processing unit (CPU), network processing unit (NPU), terminal radio frequency module).

[0343] For example, such as Figure 4 As shown, Figure 3 The illustrated system is an exemplary implementation. The communication system may include a first node 401, a second node 402, an intermediate node 403 between the first node 401 and the second node 402, and a target node 404. The first node 401 contains a service file to be transmitted to the second node 402.

[0344] The target node 404 can be a single server or a server cluster consisting of multiple servers. In some embodiments, the server cluster can also be a distributed cluster. The server can provide services to the chip, and therefore can also be called a chip server. Alternatively, the target node 404 can be the first network element in the core network. For example, the target node 404 can determine the transmission strategy (including file preprocessing information, file inverse processing information, and transmission resources) of the service file to be transmitted in the first node 401 based on at least one of the status information of the first node 401, the status information of the second node 402, and the status information of the intermediate node 403, and send the determined transmission strategy to the first node 401, the second node 402, and the intermediate node 403.

[0345] The first node 401 can be a user node (such as terminal 320 mentioned above), which can respond to user input operations and send service files to other nodes (such as the second node 402). Furthermore, during the process of sending the service file, the first node 401 can preprocess the service file according to the file preprocessing information in the service file transmission strategy, and then send the preprocessed service file to the second node 402.

[0346] Intermediate node 403 can be a base station (such as RAN node 310 mentioned above), which can forward the preprocessed service file sent by the first node 401 to the second node 402. Furthermore, during the file forwarding process, intermediate node 403 can forward the preprocessed service file according to the transmission resources in the service file transmission policy.

[0347] The second node 402 can be a service node (such as FEIN mentioned above), which has the function of executing service tasks. It is used to provide computing power to the first node 401 and respond to the service tasks initiated by the first node 401 (such as performing calculations on the business files uploaded by the first node 401). Furthermore, during the calculation and processing of the business files from the first node 401, the second node 402 can perform the reverse processing of the preprocessed business files forwarded by the intermediate node 403 according to the file reverse processing information in the transmission strategy of the business files, to obtain the business files from the first node 401, and then perform calculation and processing on the business files through the computing power function.

[0348] Among them, service nodes can be deployed in Figure 3 The specific form of the service node is specified at RAN301 and / or CN302. This application does not limit the specific form of the aforementioned service node. A service node can also be referred to as a computing network element or computing module.

[0349] It is understood that service nodes can be independent devices, or they can be integrated into the same device to implement different functions. They can be network components in hardware devices, software functions running on dedicated hardware, or virtualization functions instantiated on a platform (e.g., cloud platform). For example, a service node can be a server (or cloud server) dedicated to service tasks, a computing board inside the BBU, or mobile edge computing (MEC).

[0350] For example, such as Figure 5 The diagram illustrates an example of uplink scheduling for media access control (MAC) in a 5G system, including multiple intermediate nodes (such as gNB1 and gNB2) and multiple service nodes (such as computing board 1, computing board 2, and computing board 3). Computing board 1 and computing board 2 are computing boards for gNB1, while computing board 3 is a shared computing board for gNB1 and gNB2.

[0351] The MAC uplink scheduling process in a 5G system can include the following six steps (steps one through six):

[0352] Step 1: The UE reports its uplink data transmission needs to gNB1 by sending a scheduling request (SR).

[0353] Step 2: gNB1 transmits MAC layer control information to the UE through downlink control information (DCI) to specify time and frequency resources.

[0354] Step 3: The UE transmits the MAC control element (CE) to gNB1, including the buffer status report (BSR) and power headroom report (PHR).

[0355] Step 4: The scheduler in gNB1 allocates physical resource blocks (PRBs) to the UE based on the scheduling algorithm.

[0356] Step 5: gNB1 sends a DCI to the UE, informing it of the allocated resource block and related transmission parameters.

[0357] Step 6: The UE transmits data with the computing board 1 via gNB1.

[0358] In this application, the target node 404 can be any one of the first node 401, the second node 402, and the intermediate node 403. For example, the target node 404 can be the intermediate node 403.

[0359] Understandably, the above Figure 4 This is merely an illustrative diagram and does not constitute a limitation on the applicable scenarios of the technical solutions provided in this application. Those skilled in the art should understand that, in specific implementation processes, Figure 4 The communication system shown may also include more than Figure 4 Showing fewer devices, or, Figure 4 The communication system shown may also include other equipment, which can be determined according to specific needs. Figure 4 The number of devices in the communication system shown is not limited.

[0360] Optional, Figure 4 The devices in the process, such as the first node 401, the second node 402, the intermediate node 403, and the target node 404, can also be referred to as communication devices. They can be general-purpose devices or special-purpose devices. This application does not specifically limit them in this regard.

[0361] In one possible implementation, the functions of the first node, second node, intermediate node, or target node in the embodiments of this application can be implemented by one device, multiple devices working together, or one or more functional modules within a single device. The embodiments of this application do not specifically limit this. It is understood that the aforementioned functions can be network elements in hardware devices, software functions running on dedicated hardware, a combination of hardware and software, or virtualization functions instantiated on a platform (e.g., a cloud platform).

[0362] Intermediate nodes can be devices or components within devices in the NG-RAN, such as ng-eNB nodes, gNB nodes, or transmission points (TPs) and transmission and reception points (TRPs) within ng-eNB nodes and gNB nodes, or central units (CUs) integrated into the NG-RAN. Intermediate nodes can also be network elements with transmission capabilities, such as transmission measurement function (TMF) network elements. In some embodiments, intermediate nodes can also be access nodes in an O-RAN system. A RAN typically consists of a series of modules, such as antennas, RRUs, and BBUs. Traditional RAN architectures define the overall reception and output of the RAN, without restricting the transmission and communication between internal modules. O-RAN architectures define the architectural connections and standardized interfaces between various modules within the RAN, allowing the RAN to be decoupled into multiple standard modules, thereby enabling the combination and replacement of modules.

[0363] For example, such as Figure 6 The diagram illustrates a possible, non-limiting O-RAN system architecture. The communication system may include a RAN intelligent controller (RIC). RICs include near-real-time (near-RT) RICs and non-real-time (non-RT) RICs. Near-real-time RICs are used for model training and inference. For example, they are used to train AI models and then use those models for inference. Near-real-time RICs can obtain network-side and / or terminal-side information from RAN nodes (e.g., CUs, CU-CPs, CU-UPs, DUs, and / or RUs) and / or terminals. This information can be used as training data or inference data. Optionally, the near-real-time RIC can deliver inference results to RAN nodes and / or terminals. Optionally, inference results can be exchanged between CUs and DUs, and / or between DUs and RUs. For example, the near-real-time RIC delivers the inference result to the DU, and the DU sends it to the RU. This enables near-real-time intelligent management of the RAN. Through data collection and related operations on the E2 interface, near-real-time control and optimization of O-RAN modules and resources are achieved.

[0364] The E2 interface is an open interface between two endpoints used to connect the Near-RT RIC and the RAN node. The RAN node includes the CU and DU in 5G, the O-RAN compatible eNB in ​​4G, and the O-CU (O-CU-CP and / or O-CU-UP) and / or O-DU in O-RAN. The Near-RT RIC can obtain data collection and feedback from the RAN node through the E2 node, and the RAN node can obtain control feedback from the Near-RT RIC through the E2 node.

[0365] Non-real-time RICs are used for model training and inference. For example, they are used to train AI models and then use those models for inference. Non-real-time RICs can obtain network-side and / or terminal-side information from RAN nodes (e.g., CUs, CU-CPs, CU-UPs, DUs, and / or RUs) and / or terminals. This information can be used as training data or inference data, and the inference results can be delivered to RAN nodes and / or terminals. Optionally, inference results can be exchanged between CUs and DUs, and / or between DUs and RUs; for example, a non-real-time RIC delivers inference results to a DU, which then forwards them to an RU.

[0366] Near real-time RICs and non-real-time RICs can also be configured as separate network elements. Optionally, near real-time RICs and non-real-time RICs can also be part of other devices. For example, non-real-time RICs can be set in OAM, cloud servers, core network devices, or other network devices, while near real-time RICs can be set in RAN nodes (e.g., CU, DU). Near real-time RICs, CUs, DUs, and RUs form access network nodes.

[0367] For example, such as Figure 7 As shown, it illustrates a schematic diagram of the CU-DU-RU splitting structure under an O-RAN system.

[0368] O-RAN central unit (O-CU): Used to implement the radio resource control (RRC) layer, packet data convergence protocol (PDCP) layer, service data adaptation protocol (SDAP) layer, and other control functions in the relevant 3GPP technical specifications.

[0369] O-RAN Central Unit Control Plane (O-CU-CP): Similar to the CU-CP in the NR system, it is used to implement the functions of the RRC layer and the control plane functions of the PDCP layer. It is part of the O-CU.

[0370] O-RAN Central Unit User Plane (O-CU-UP): Similar to the CU-UP in the NR system, it is used to implement the functions of the SDAP layer and the user plane functions of the PDCP layer. It is part of the O-CU.

[0371] O-RAN Distributed Unit (O-DU): Based on low-layer function segmentation, it is used to implement the radio link control (RLC) layer, media access control (MAC) layer, and higher physical layer (Higher PHY) layer in the relevant 3GPP technical specifications. The higher physical layer functions include one or more of the following: forward error correction (FEC) encoding / decoding, scrambling / descrambling, or modulation / demodulation.

[0372] The O-RAN radio unit (O-RU) is based on low-layer function partitioning and is used to implement the lower physical layer (PHY) functions and antenna-based radio frequency (RF) functions specified in the relevant 3GPP technical specifications. The PHY functions include one or more of the following: Fast Fourier Transform (FFT) / Inverse Fast Fourier Transform (iFFT) transformation, digital beamforming, or extraction and filtering of the physical random access channel (PRACH). It is similar to the transmission reception point (TRP) or remote radio head (RRH) in a 3GPP communication system, but includes PHY functions such as FFT / iFFT or PRACH extraction.

[0373] It should be understood that the above scenario is the scenario where media files are uploaded from the user node to the service node (i.e., the uplink scenario), and this application applies to the scenario where the processed media files are sent from the service node to the user node (i.e., the downlink scenario).

[0374] Furthermore, the above scenarios are uplink scenarios where file preprocessing (such as encoding and compression) is performed on the user node and file reverse processing (such as decoding and decompression) is performed on the service node. This application is also applicable to uplink scenarios where file preprocessing is performed on the user node and file reverse processing is performed on the intermediate node; downlink scenarios where file preprocessing is performed on the service node and file reverse processing is performed on the user node; and downlink scenarios where file preprocessing is performed on the intermediate node and file reverse processing is performed on the user node.

[0375] Furthermore, considering the determination of the transmission strategy for the file to be transmitted in this application (i.e., strategy determination), taking preprocessing as compression and inverse processing as decompression, with user nodes being user-side terminal devices, intermediate nodes being RAN-side network devices, and service nodes being core network-side (or RAN-side) computing devices (or service devices) as examples, such as... Figure 8 As shown, it illustrates the location distribution of strategy determination, compression execution, and decompression execution in uplink and downlink transmission scenarios.

[0376] In uplink scenario 1, the target node is a network device. The network device can determine the compression parameters for the file to the terminal device through a policy, enabling the terminal device to send the compressed file to the network device via compression execution (i.e., the encoder is on the terminal device). Then, the network device can decompress the compressed file according to the decompression parameters determined by the policy (i.e., the decoder is on the network device), and send the decompressed file to the computing device according to the transmission resources determined by the policy. Afterwards, the computing device can perform computational processing on the decompressed file.

[0377] In uplink scenario 2, the target node is a network device. The network device can determine the compression parameters for the file to the terminal device and the decompression parameters for the compressed file to the computing device through a policy. This allows the terminal device to send the compressed file forwarded by the network device to the computing device through compression execution (i.e., the encoder is on the terminal device). Then, the computing device can decompress the compressed file through decompression execution (i.e., the decoder is on the computing device) and perform calculations on the decompressed file.

[0378] In uplink scenario 3, the target node is a computing device. The computing device can determine the compression parameters for the file to the terminal device and the transmission resources for the file to the network device through the strategy. This allows the terminal device to send the compressed file, which has been forwarded by the network device, to the computing device through compression execution (i.e., the encoder is on the terminal device). Then, the computing device can decompress the compressed file through decompression execution (i.e., the decoder is on the computing device) and perform calculations on the decompressed file.

[0379] In downlink scenario 1, the target node is a network device. The network device can determine the decompression parameters for the compressed file to the terminal device through a policy. This allows the network device to send the compressed file to the terminal device through compression execution (i.e., the encoder is on the network device) based on the original file uploaded by the computing device. Then, the terminal device can decompress the compressed file (i.e., the decoder is on the terminal device) to obtain the decompressed file.

[0380] In downlink scenario 2, the target node is a network device. The network device can determine the compression parameters for the file to the computing device and the decompression parameters for the compressed file to the terminal device through a policy. This allows the computing device to send the compressed file forwarded by the network device to the terminal device through compression execution (i.e., the encoder is on the computing device). Then, the terminal device can decompress the compressed file through decompression execution (i.e., the decoder is on the terminal device) to obtain the decompressed file.

[0381] In downlink scenario 3, the target node is a computing device. The computing device can determine the decompression parameters for the file to the terminal device and the file transmission resources to the network device through a strategy. Then, the computing device can compress the file according to the compression parameters determined by the strategy (i.e., the encoder is on the computing device) and send the compressed file to the terminal device through the network device. The terminal device can then decompress the compressed file through decompression (i.e., the decoder is on the terminal device) to obtain the decompressed file.

[0382] In other words, in uplink scenarios, compression is performed on the terminal device, and policy determination can be performed on both the network device and the decompression device, or both on the computing device, or the policy determination can be performed on the network device and the decompression device can be performed on the computing device.

[0383] Optionally, the decompression and execution part can be directly merged into the target service provided by FEIN, and does not need to be executed separately.

[0384] It is understood that the system described in the embodiments of this application is for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and does not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0385] The following description uses a target node as an example to illustrate the transmission management method provided in this application. This transmission management method is applicable to the aforementioned communication systems, and also to other communication systems not mentioned. In the following embodiments of this application, the message names, parameter names, or information names between the target node and other nodes are merely examples; other names may exist in other embodiments, and the method provided in this application does not specifically limit these names.

[0386] It is understood that in the embodiments of this application, each communication device (including intermediate nodes, second nodes, or other nodes) may execute some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also execute other operations or variations thereof. Furthermore, the steps may be executed in different orders as presented in the embodiments of this application, and it is not necessary to execute all the operations in the embodiments of this application.

[0387] It is understood that this application uses a first node, a second node, an intermediate node, and a target node as examples to illustrate the execution entities in the interaction illustration, but this application does not limit the execution entities in the interaction illustration. For example, the method executed by the target node in this application can also be executed by a module applied to the target node (e.g., a chip, a chip system, or a processor), or by a logical node, logical module, or software capable of implementing all or part of the target node's functions. Or, for example, the method executed by the first node in this application can also be executed by an application to the first node (e.g., a chip, a chip system, or a processor), or by a logical node, logical module, or software capable of implementing all or part of the first node.

[0388] The transmission management method provided in the embodiments of this application will be described below. For example... Figure 9 As shown, the transmission management method may include:

[0389] Step 901: The target node obtains the first state information of the first node, the second state information of the second node, and the third state information of the intermediate node between the first node and the second node.

[0390] In this application, the first node contains a target file to be transmitted (or sent) to the second node; that is, the first node is the source node for the transmission task corresponding to the target file, and the second node is the destination node for the transmission task corresponding to the target file. Furthermore, this application does not limit the type of the target file. For example, the target file can be a media file (such as an image, video, etc.).

[0391] It should be noted that the node types of the first and second nodes can change synchronously as the uplink and downlink scenarios change. For example, in an uplink scenario, the first node can be a user node that initiates a transmission task, and the second node can be a service node that provides computing services to the first node. As another example, in a downlink scenario, the first node can be a service node that feeds back the processing results of the computing service to the second node, and the second node can be a user node that requests the processing results of the computing service.

[0392] Intermediate nodes can be routing nodes (such as base stations) used for file forwarding between the first and second nodes, while target nodes can be management nodes (such as servers) that manage file transfers between the first, intermediate, and second nodes.

[0393] In some embodiments, the first node is a user node, the second node is a service node, the intermediate node is a base station, and the target node is a server; or, the first node is a service node, the second node is a user node, the intermediate node is a base station, and the target node is a server.

[0394] The service node can be any user node other than the first node, meaning the first node and the second node can be two different user nodes.

[0395] It should be understood that the descriptions of the first node, second node, intermediate nodes, and target node can be found above. Figure 4 The communication devices in the communication system shown may be chips or circuits that can be used in the communication devices, or entities associated with the communication devices, etc., which will not be listed one by one here.

[0396] In some embodiments, the first node, the second node, and the intermediate node may perform different processing operations on the target file during its transmission. For example, the first node, the second node, and the intermediate node may satisfy at least one of the following:

[0397] 1. The first node performs file preprocessing, and the second node performs file reverse processing;

[0398] 2. The first node performs file preprocessing, and the intermediate nodes perform file reverse processing;

[0399] 3. The intermediate node performs file preprocessing, and the second node performs file reverse processing.

[0400] In other words, by performing different processing operations at different node locations, the computing resources in each node can be fully utilized, thereby improving resource utilization during file transfer.

[0401] It should be noted that, in the embodiments of this application, the file preprocessing operation is used to reduce the file size, and can be an encoding operation (such as source coding, source-channel joint coding) or compression operation. The file inverse processing operation is used to restore or partially restore the file to its state before file preprocessing, and can be a decoding operation (such as source decoding, source-channel joint decoding) or decompression operation.

[0402] In other words, file reverse processing is the operation of restoring or partially restoring a preprocessed file to its original state. For example, if file preprocessing involves compression, then file reverse processing involves decompression.

[0403] In some embodiments of this disclosure, as the processing operations of the first node, the second node, and the intermediate node on the target file change during the transmission of the target file, the information content in the first state information of the first node, the second state information of the second node, and the third state information of the intermediate node also changes accordingly.

[0404] For example, in the case where file preprocessing is performed in the first node and file inverse processing is performed in the second node:

[0405] The first status information may include preprocessing capability information of the first node performing file preprocessing and / or target file transmission task information;

[0406] The second status information may include the reverse processing capability information of the second node performing file reverse processing and / or the service status information of the second node;

[0407] The third state information may include the air interface state information between the first node and the second node.

[0408] For example, in the case where file preprocessing is performed at the first node and file inverse processing is performed at the intermediate nodes:

[0409] The first status information may include preprocessing capability information of the first node performing file preprocessing and transmission task information of the target file;

[0410] The second status information may include the service status information of the second node;

[0411] The third state information may include the air interface state information between the first node and the second node and / or the reverse processing capability information of the intermediate node to perform file reverse processing.

[0412] For example, consider the scenario where file preprocessing is performed at an intermediate node, and file inverse processing is performed at the second node:

[0413] The first status information may include the target file's transmission task information;

[0414] The second status information may include the reverse processing capability information of the second node performing file reverse processing and / or the service status information of the second node;

[0415] The third status information may include the air interface status information between the first node and the second node and / or the preprocessing capability information of the intermediate node for performing file preprocessing.

[0416] It should be noted that the preprocessing capability information, reverse processing capability information, air interface status information, transmission task information, and service status information can be introduced through the following content 1-5.

[0417] 1. Preprocessing capability information may include at least one of the following 1.1-1.7:

[0418] 1.1 Identification of at least one preprocessing model and / or algorithm;

[0419] 1.2 At least one adjustable parameter index for a preprocessing model and / or algorithm;

[0420] 1.3 The correlation between parameter tuning and preprocessing time for each preprocessing model and / or algorithm in at least one preprocessing model and / or algorithm;

[0421] 1.4. At least one preprocessing model and / or algorithm, and the inverse processing model and / or algorithm corresponding to each preprocessing model and / or algorithm;

[0422] 1.5 Queuing status of preprocessing tasks;

[0423] 1.6 Available computing resources for preprocessing;

[0424] 1.7. Estimated preprocessing time for the target file.

[0425] For example, the identifier of the preprocessing model and / or algorithm may include information such as the name of the model and / or algorithm, the accuracy of the model and / or algorithm, and the version of the model and / or algorithm.

[0426] Adjustable parameters for preprocessing models and / or algorithms may include compression ratio, output file size, and whether to force the use of certain hardware (such as specifying the model of the graphics processing unit (GPU)).

[0427] The relationship between parameter tuning of the preprocessing model and / or algorithm and preprocessing time can be represented as the relationship between output file size and preprocessing time (as shown in Table 1).

[0428] Table 1 shows an example of the relationship between output file size and preprocessing time.

[0429] Output file size (unit: gigabytes (GB)) Preprocessing time (in seconds) 0.5 8 1.0 15 1.5 25

[0430] The inverse processing model and / or algorithm corresponding to the preprocessing model and / or algorithm can be exemplified by compression and decompression models, as shown in Table 2. Specifically, the decompression models that can be adapted to compression model 1 for output format A (e.g., decompression model 2 supporting format A decompression, decompression model 3 supporting both format A and format B decompression), and the most recommended decompression model for compression model 1 for output format A (e.g., decompression model 2 supporting format A decompression); the decompression models that can be adapted to compression model 2 for output format B (e.g., decompression model 4 supporting format B decompression, decompression model 3 supporting both format A and format B decompression), and the most recommended decompression model for compression model 2 for output format A (e.g., decompression model 3 supporting both format A and format B decompression).

[0431] Table 2. Examples of the correspondence between compression and decompression models.

[0432] Compression Model Adaptable decompression model Most recommended decompression model Compression Model 1 Decompression Model 2, Decompression Model 3 Decompression Model 2 Compression Model 2 Decompression Model 4, Decompression Model 3 Decompression Model 3

[0433] The queuing status of preprocessing tasks can be the queuing status of multiple compression tasks. For example, there are two compression tasks (such as compression task B and compression task C) waiting to be compressed before compression task A.

[0434] Available computing resources for preprocessing can include idle CPU cores and threads, idle GPU memory, and idle storage space on storage devices.

[0435] The estimated preprocessing time for the target file can be expressed in any of the following ways: 1.7.1-1.7.3

[0436] 1.7.1 Used to indicate whether the QoS requirements of the target file are met;

[0437] 1.7.2. Based on the algorithm, the expected preprocessing time of the target file is estimated;

[0438] 1.7.3 Terminal computing power (preprocessing time information can be derived by combining model information, file size, model parameter selection, etc.).

[0439] For example, taking file preprocessing as compression, the terminal (i.e., the first node) can estimate the time required to compress the media file (i.e., the target file) (i.e., the preprocessing time) as an estimated time period (e.g., 30 milliseconds (ms)).

[0440] Alternatively, the terminal can estimate the time required to compress a media file using a media compression identifier (ID) and a corresponding list of compression times (as shown in Table 3). The media compression ID indicates the compression task identifier for the target file, such as identifier A for a video compression task and identifier B for an image compression task.

[0441] Table 3 Example of Compression Time List

[0442] Media Compression ID Compression time (unit: ms) Identifier A 30 Identifier B 50

[0443] In other words, the target node can adjust the preprocessing model (or algorithm) and resource requirements of the target file during transmission by referring to the relevant information of each preprocessing model and / or algorithm in the node performing file compression, as well as the available computing resources for preprocessing. This ensures that the available computing resources and available preprocessing models and / or algorithms in the node performing file preprocessing meet the preprocessing requirements of the target file. Furthermore, by referring to the parameters of each preprocessing model and / or algorithm and adjusting the correlation with preprocessing time, the queuing status of preprocessing tasks, and the estimated preprocessing time for the target file, the target node can adjust the time spent on preprocessing the target file, reducing the overall latency during transmission and improving the quality of service between nodes. In addition, by referring to the inverse processing model adapted to each preprocessing model and / or algorithm, the target node can select the preprocessing model and / or algorithm, adapting preprocessing and inverse processing to ensure that the node performing file inverse processing has the corresponding inverse processing model and / or algorithm to complete the file inverse processing operation.

[0444] 2. Reverse processing capability information may include at least one of the following:

[0445] 2.1 An identifier for at least one inverse processing model and / or algorithm;

[0446] 2.2 At least one adjustable parameter specification for an inverse processing model and / or algorithm;

[0447] 2.3 The correlation between parameter tuning and inverse processing time for each inverse processing model and / or algorithm in at least one inverse processing model and / or algorithm;

[0448] 2.4. At least one inverse processing model and / or algorithm, and a preprocessing model and / or algorithm corresponding to each inverse processing model and / or algorithm;

[0449] 2.5. Reverse the queuing status of processing tasks;

[0450] 2.6 Available computing resources for reverse processing;

[0451] 2.7. Estimated reverse processing time for the target file.

[0452] It should be noted that the descriptions of sections 2.1-2.7 in the reverse processing capability information can be found in the descriptions of sections 1.1-1.7 in the preprocessing capability information above, and will not be repeated here.

[0453] The available computing power resources used for inverse processing and the queuing status of inverse processing tasks are both computing power information of the node, and the computing power information of the node may also include the computing power card model.

[0454] In other words, the target node can adjust the model (or algorithm) and resource requirements for inverse processing of the target file during transmission by referring to the relevant information of each inverse processing model and / or algorithm in the node performing file inverse processing, as well as the available computing power resources for inverse processing. This ensures that the available computing power resources and available inverse processing models and / or algorithms in the node performing file inverse processing meet the inverse processing requirements of the target file. Furthermore, by referring to the parameters of each inverse processing model and / or algorithm and adjusting the correlation with inverse processing time, the queuing status of inverse processing tasks, and the estimated inverse processing time for the target file, the target node can adjust the time consumed during the inverse processing of the target file, reduce the overall latency of the target file during transmission, and improve the quality of service between nodes. In addition, by referring to the preprocessing models and / or algorithms adapted to each inverse processing model and / or algorithm, the target node can select inverse processing models and / or algorithms to adapt preprocessing and inverse processing, ensuring that the node performing file preprocessing has the corresponding preprocessing models and / or algorithms to complete the file preprocessing operation.

[0455] 3. Air interface status information may include at least one of the following:

[0456] 3.1 Signal-to-noise ratio (SNR);

[0457] 3.2 Signal reference point (SRP);

[0458] 3.3 Spectrum efficiency (SE);

[0459] 3.4 Channel Quality Indicator (CQI);

[0460] 3.5. Transmission resources pre-allocated for different transmission tasks;

[0461] 3.6 Rules for allocating transmission resources for different transmission tasks.

[0462] For example, taking transmission task A as an example, the transmission resources pre-allocated for transmission task A may include at least one of the following 3.5.1-3.5.3:

[0463] 3.5.1. The resources (such as communication bandwidth) expected to be allocated for transmission task A;

[0464] 3.5.2. All remaining resources in the current scenario and the number of tasks with resources to be allocated;

[0465] 3.5.3 The maximum resources that can be allocated to transmission task A in the current scenario.

[0466] The number of tasks with pending resource allocation indicates the number of tasks that need to call up remaining resources in the current scenario.

[0467] Furthermore, taking transmission task A as an example, the rules for allocating transmission resources to transmission task A may include at least one of the following 3.6.1-3.6.3:

[0468] 3.6.1 A table showing the task priority and available resources for transmission task A in the current scenario;

[0469] 3.6.2. The allocatable resources of transmission task A in the current scenario compared to standard tasks.

[0470] One standard task corresponds to one standard resource. For example, a standard task with a data volume of 1 megabyte (MB) has a standard bandwidth of 10 bits / second. If the data volume of transmission task A is 2MB, then the allocatable bandwidth of transmission task A compared to the standard task is 20 bits / second.

[0471] In other words, the target node can adjust the resource requirements of the target file during transmission by referring to the communication environment and available transmission resources between the sending and receiving nodes, so that the communication environment and available transmission resources between the sending and receiving nodes meet the transmission requirements of the target file, thereby improving the service quality between the nodes.

[0472] 4. The transmitted task information may include at least one of the following:

[0473] 4.1 File size;

[0474] 4.2 Buffer size;

[0475] 4.3 File format;

[0476] 4.4 Color channels of media files;

[0477] 4.5. Document Characteristics;

[0478] 4.6. Time window for file transfer;

[0479] 4.7 Priority of the first node in transmitting the target file.

[0480] The file size refers to the size of the uncompressed file to be transmitted (i.e., the target file), which may include file dimensions, number of pixels in the media file, number of frames, etc.; the buffer size is used to indicate the size of the file to be sent in the buffer; the file transmission time window is used to indicate that target files are expected to be uploaded continuously within the future time window; and the priority of the first node in transmitting target files is used to indicate the queuing order of the target files among the multiple files to be transmitted when the first node transmits multiple files to be transmitted in sequence.

[0481] In other words, the target node can adjust the transmission resources occupied by the target file during transmission and the resource parameters of the sending and receiving nodes in processing the target file by referring to the relevant requirements of the transmission task. While meeting the file transmission latency, it can balance the resource usage of the target file in the sending node, receiving node and intermediate nodes, avoid occupying too many resources for the sake of lower latency and improve resource utilization.

[0482] 5. Service status information may include at least one of the following:

[0483] 5.1 The queuing status of the service tasks in which the target document participates;

[0484] 5.2 Priority of service tasks in which the target file participates;

[0485] 5.3 Impact of preprocessing / reverse processing on the quality of service in service tasks involving the target file;

[0486] 5.4 Priority of responding to the first node's request.

[0487] The service task can be a computational service. For example, a service task could be the recognition and processing of image files. Another example is frame rate compensation for video files.

[0488] Regarding the impact of preprocessing / reverse processing on the quality of service (QoS) of the target file in service tasks, taking image compression / decompression as an example, the compression / decompression process is usually not lossless and may affect the compression / decompression quality of the target file, such as the peak signal-to-noise ratio (PSNR). Therefore, if the target file is involved in a large model image recognition service, the compression / decompression quality of the image may affect the accuracy of the large model image recognition (i.e., QoS).

[0489] For further explanation of the service status information, for example, if there are multiple service tasks to be processed in the second node (such as service task A, service task B and service task C), then the queuing status of all service tasks in the second node can be that there are three service tasks waiting to be processed.

[0490] Among them, the priority of service task A is 1, the priority of service task B is 2, and the priority of service task C is 3. If the priority of service task D in which the target file participates is 1, then the second node can execute service task D first after service task A is completed, and then execute service task B and service task C in sequence. That is, the queuing status of service task D in which the target file participates can be "located in the second waiting position in the task queue".

[0491] If the second node receives target files from both the first node A and the first node B, and the priority of responding to the request from the first node A is greater than the priority of the request from the first node B, then the second node can first execute the service task involving the target file sent by the first node A, and then execute the service task involving the target file sent by the first node B.

[0492] In other words, the target node can adjust the transmission resources occupied by the target file during transmission and the resource parameters of the sending and receiving nodes in processing the target file by referring to the relevant status of the computing services provided by the service nodes. This ensures that the computing services can be executed normally, avoids long queuing times caused by lower transmission latency, and avoids consuming too many resources for the sake of lower latency, thereby improving resource utilization.

[0493] In some embodiments, before the target node obtains the first state information, the second state information, and the third state information, the target node may send transmission request information to at least one of the first node, the second node, and the intermediate node.

[0494] In other words, the target node can notify any of the first, second, and intermediate nodes in advance that it needs to manage the transmission of the target file, so as to ensure that any of the first, second, and intermediate nodes can prepare for the transmission of the target file.

[0495] It should be noted that the format and signaling name of the transmission request information sent by the target node to the first node, the transmission request information sent by the target node to the second node, and the transmission request information sent by the target node to the intermediate node can all be different.

[0496] For example, the target node can send a transmission request message in format A to the first node, a transmission request message in format B to the second node, and a transmission request message in format C to the intermediate node.

[0497] In some embodiments of this disclosure, the transmission request information may include at least one of the following: an identifier for determining the transmission strategy of the target file, and quality of service requirement information of the target file.

[0498] The identifier used to determine the transmission strategy of the target file can be a single character X, which declares the request as a file transmission strategy and is used to indicate that the first node, the second node, and the intermediate nodes need to provide their own status information for the determination of the subsequent transmission strategy.

[0499] The quality of service (QoS) requirement information for the target file is used to indicate the transmission requirements for file transfer to the first node, second node, and intermediate nodes, ensuring the QoS of file transfer between nodes.

[0500] For example, taking compression and decompression as preprocessing and inverse processing, the quality of service requirements information of the target file can include the upper bound of the time allowed for compression / decompression processing.

[0501] In this application, during the process of the target node acquiring the first state information, the second state information, and the third state information, the target node may receive state information sent by at least one of the first node, the second node, and the intermediate node.

[0502] For example, the target node can receive the first status information sent by the first node. As another example, the target node can receive the second status information sent by the second node. And yet another example, the target node can receive the third status information sent by the third node.

[0503] Optionally, the target node can use the historical state information of the node with the smaller state change amplitude as the current state information of the node, based on the state change amplitude of any one of the first node, the second node, and the intermediate node.

[0504] For example, if the state change amplitude of the first node is less than a first preset amplitude threshold, then the historical state information of the first node is used as the first state information. Similarly, if the state change amplitude of the second node is less than the first preset amplitude threshold, then the historical state information of the second node is used as the second state information. And so on, if the state change amplitude of the third node is less than the first preset amplitude threshold, then the historical state information of the third node is used as the third state information.

[0505] It should be noted that, taking the first node as an example, the magnitude of the state change of the first node can be the magnitude obtained by processing (such as statistical analysis, algorithm calculation, model processing, etc.) multiple historical state information of the first node.

[0506] In some other embodiments of this disclosure, taking the first node as an example, during the process of the target node using the historical state information of the first node as the first state information, the target node can predict the first state information of the first node based on the historical state information of the first node.

[0507] For example, the target node can predict the first state information of the first node at the target time based on the state change trend of the first node's historical state information.

[0508] It should be noted that this application does not limit the algorithm formula for predicting the node state information of the target node. For example, the target node can predict its state information using a moving average algorithm. Another example is that the target node can predict its state information using an exponential smoothing algorithm. Yet another example is that the target node can predict its state information using a recurrent neural network algorithm.

[0509] Combining the two methods of obtaining state information mentioned above, when the state change amplitude of the third node is less than the first preset amplitude threshold, the target node can receive only the first state information sent by the first node and the second state information sent by the second node, and use the historical state information of the third node as the third state information to obtain the first state information, the second state information and the third state information.

[0510] In other words, the target node can determine the current state information of the node based on the node's historical state information, without having to receive the current state information sent by the node, thus reducing the request and interaction steps between nodes and improving the efficiency of obtaining state information.

[0511] Step 902: The target node determines the target transmission strategy for the target file sent by the first node to the second node based on at least one of the first state information, the second state information, and the third state information.

[0512] In this application, the target node can process at least one of the first state information, the second state information, and the third state information through a preset processing method to determine the target transmission strategy.

[0513] There are no limitations on the preset processing method. For example, the preset processing method can be an algorithm-based processing method. Another example is that the preset processing method can be an AI model-based processing method. Yet another example is that the preset processing method can be a table lookup-based processing method.

[0514] In some embodiments, the target transfer strategy may include: file preprocessing information, file inverse processing information, and target transfer resources.

[0515] It should be noted that file preprocessing information, file reverse processing information, and target transmission resources can be introduced through the following sections 6-8.

[0516] 6. File preprocessing information may include at least one of the following:

[0517] 6.1 A task identifier used to indicate whether file preprocessing should be performed;

[0518] 6.2. Processing rules used to indicate the preprocessing rules for the files to be processed;

[0519] 6.3. Initial information about the target preprocessing model and / or algorithm;

[0520] 6.4 Input parameters required for the target preprocessing model and / or algorithm (i.e., preprocessing parameters for the target file).

[0521] The processing rules used to instruct the execution of file preprocessing may include: performing file preprocessing when the target file reaches the target size threshold.

[0522] In other words, when the media file (i.e. the target file) sent by the first node (such as the UE) reaches a certain size, it is compressed (i.e., preprocessed).

[0523] The first information of the target preprocessing model and / or algorithm is used to provide reference information for the first node or intermediate node in determining the preprocessing model and / or algorithm to be applied for file preprocessing based on the preprocessing query list.

[0524] For example, taking the file preprocessing operation performed in the first node as an example, the preprocessing query list in the first node can be as shown in Table 4. If the first information of the target preprocessing model and / or algorithm can be α, then the target preprocessing model and / or algorithm is model A.

[0525] Table 4 Preprocessing Query List

[0526] First Information Preprocessing models and / or algorithms α Model A β Algorithm B

[0527] As part of some embodiments of this disclosure, the first information of the target preprocessing model and / or algorithm may include at least one of the following 6.3.1-6.3.4:

[0528] 6.3.1 Name information of the target preprocessing model and / or algorithm;

[0529] 6.3.2 Accuracy information of the target preprocessing model and / or algorithm;

[0530] 6.3.3 Version information of the target preprocessing model and / or algorithm;

[0531] 6.3.4 Hardware information used for the execution of the target preprocessing model and / or algorithm (such as the name of the storage device and the version of the CPU).

[0532] As some embodiments of this disclosure, the input parameters required by the target preprocessing model and / or algorithm may include at least one of the following 6.4.1-6.4.3:

[0533] 6.4.1 Target compression ratio;

[0534] 6.4.2 Target compression quality;

[0535] 6.4.3 Target service quality requirements.

[0536] The target compression ratio is a specified compression ratio, such as the ratio of the file size after compression to the file size before compression; the target compression quality is a measure of the ability to maintain or be as close as possible to the original data quality and integrity while reducing file size, such as specifying that the bounded dynamic signal-to-noise ratio (B-DSNR) after compression is not lower than a certain value; the target service quality requirement can indicate that the compression time does not exceed a preset time threshold (such as 15ms).

[0537] 7. File reverse processing information may include at least one of the following:

[0538] 7.1 Second information of the target inverse processing model and / or algorithm;

[0539] 7.2 Input parameters required for the target inverse processing model and / or algorithm (i.e., inverse processing parameters for the preprocessed target file).

[0540] The second information of the target inverse processing model and / or algorithm is used to provide reference information for the second node or intermediate node in determining the inverse processing model and / or algorithm applied to the target file execution file inverse processing based on the inverse processing query list.

[0541] For example, taking the file inverse processing operation performed in the second node as an example, the inverse processing query list in the second node can be as shown in Table 5. If the second information of the target inverse processing model and / or algorithm can be m, then the target preprocessing model and / or algorithm is model a.

[0542] Table 5 Reverse Processing Query List

[0543] Second Information Inverse processing models and / or algorithms m Model a n Algorithm b

[0544] As part of some embodiments of this disclosure, the second information of the target inverse processing model and / or algorithm may include at least one of the following 7.1.1-7.1.4:

[0545] 7.1.1 Name information of the target inverse processing model and / or algorithm;

[0546] 7.1.2 Accuracy information of the target inverse processing model and / or algorithm;

[0547] 7.1.3 Version information of the target inverse processing model and / or algorithm;

[0548] 7.1.4 Hardware information used for the execution of the target inverse processing model and / or algorithm (such as the name of the storage device and the version of the CPU).

[0549] As some embodiments of this disclosure, the input parameters required for the target inverse processing model and / or algorithm may include at least one of the following 7.2.1-7.2.2:

[0550] 7.2.1 Target decompression quality;

[0551] 7.2.2 Target hardware requirements.

[0552] Among them, the target decompression quality is used to indicate the accuracy and integrity of the original data recovery after the compressed file is decompressed, for example, specifying that the B-DSNR after decompression is not lower than a certain value; the target hardware requirements can indicate the hardware requirements (such as voltage, free storage space, etc.) of the target inverse processing model and / or algorithm during the execution of the hardware.

[0553] As some embodiments of this disclosure, the header of the preprocessed target file may carry at least one of the following:

[0554] File preprocessing information;

[0555] Partial information from file preprocessing information;

[0556] Reverse processing information of files;

[0557] Partial information from the file reverse processing information.

[0558] In other words, during the subsequent preprocessing (e.g., compression) of the target file based on the target transmission strategy's file preprocessing information, the first node can add file preprocessing information and / or file inverse processing information to the file's header. This ensures that the header of the preprocessed target file carries both the preprocessing and inverse processing information. Since there is typically a time difference between the preprocessing and inverse processing steps, they may not execute the same decision. Therefore, the interaction between file preprocessing and inverse processing information through the header ensures the consistency and timeliness of processing parameters and content information, fully guaranteeing optimal QoS.

[0559] 8. The target transmission resource may include at least one of the following:

[0560] 8.1 Time and frequency resources, such as the number of time and frequency resource blocks and spectrum bandwidth;

[0561] 8.2 Channel resources, such as the priority of transmission channels;

[0562] 8.3 Priority of target file transfer tasks.

[0563] For example, taking the target file transfer task A as an example, the target transfer resource can be expressed in one or more of the following ways (1) and (2):

[0564] (1) The specific number of RBs / BWs / priority, etc., allocated to transmission task A;

[0565] (2) The mapping table corresponding to the target file.

[0566] The target file mapping table is used to determine the target transmission resources for file preprocessing information and / or file inverse processing information within the same target transmission strategy.

[0567] In other words, intermediate nodes can obtain the specific allocated target transmission resources by querying the mapping table corresponding to the target file, based on the file preprocessing information and / or file inverse processing information in the data transmission packet header of the target file.

[0568] It is understood that, in this application, the target node can adjust the transmission resources occupied by the file to be transmitted during transmission, as well as the resource parameters of the sending and receiving nodes in processing the file to be transmitted, based on at least one of the status information of the sending and receiving nodes and the status information of the intermediate nodes between the sending and receiving nodes. This ensures that the available processing resources in the sending node meet the processing requirements of the file to be transmitted, the available processing resources in the receiving node meet the inverse processing requirements of the processed file to be transmitted, and the available transmission resources of the intermediate nodes between the sending and receiving nodes meet the transmission requirements of the file to be transmitted, thereby improving the quality of service between nodes. Furthermore, by comprehensively considering the available processing resources in the sending node, the available processing resources in the receiving node, and the available transmission resources of the intermediate nodes between the sending and receiving nodes, the resource occupancy of the file to be transmitted among the sending node, receiving node, and intermediate nodes can be balanced, improving resource utilization.

[0569] Step 903: The target node sends the target transmission strategy to the first node, the second node, and the intermediate node.

[0570] In other words, after the target node determines the transmission strategy for the target file, it can adjust the resource parameters of the sending and receiving nodes in processing the target file by issuing the strategy, and adjust the transmission resources allocated by the intermediate nodes for the target file during transmission.

[0571] In this embodiment of the disclosure, the target node can periodically and repeatedly send the target transmission strategy to the first node, the second node, and the intermediate node.

[0572] In this system, the first node corresponds to the first transmission cycle, the second node corresponds to the second transmission cycle, and the intermediate node corresponds to the third transmission cycle. The first, second, and third transmission cycles can be the same or different.

[0573] In other words, after the target node initially sends the target transmission policy to the first node, the second node, and the intermediate node, it can periodically repeat the target transmission policy to the first node, the second node, and the intermediate node. This redundant transmission ensures that the first node, the second node, and the intermediate node can receive and use the accurate target transmission policy.

[0574] In some embodiments, the target node may send the target transmission strategy to at least one of the first node, the second node, and the intermediate node.

[0575] For example, if the file preprocessing information in the target transmission strategy is the default preprocessing information of the first node, the target node does not need to send the target transmission strategy to the first node.

[0576] For example, if the target transmission resource in the target transmission strategy is the pre-allocated transmission resource for the transmission task of the target file, the target node does not need to send the target transmission strategy to the intermediate node.

[0577] For example, if the file inverse processing information in the target transmission strategy is the default inverse processing information of the second node, the target node does not need to send the target transmission strategy to the second node.

[0578] In some embodiments, after sending the target transmission policy to the first node, the second node, and the intermediate node, the target node can verify the transmission policy received by the node by receiving verification information sent by at least one of the first node, the second node, and the intermediate node.

[0579] For example, the target node can receive the first verification information sent by the first node, which is used to verify the transmission strategy received by the first node.

[0580] For example, the target node can receive second verification information sent by the second node, which is used to verify the transmission strategy received by the second node.

[0581] For example, the target node can receive third verification information sent by the intermediate node, which is used to verify the transmission strategy received by the third node.

[0582] In other words, the target node verifies whether the transmission strategy received by the node is the same as the transmission strategy sent by the target node by receiving verification information from any of the first node, the second node, and the intermediate node.

[0583] It should be noted that the first verification information may include file preprocessing information and / or file inverse processing information in the transmission policy received by the first node, as well as a first identifier used to indicate policy verification.

[0584] For example, the first verification information may include at least one of the following:

[0585] The first identifier used to indicate policy verification;

[0586] The first information of the target preprocessing model and / or algorithm;

[0587] The second information of the target inverse processing model and / or algorithm;

[0588] The input parameters required by the target preprocessing model and / or algorithm.

[0589] Similarly, the second verification information may include file preprocessing information and / or file inverse processing information in the transmission policy received by the second node, and a first identifier for indicating policy verification. The third verification information may include file preprocessing information and / or file inverse processing information in the transmission policy received by the intermediate node, and a first identifier for indicating policy verification.

[0590] In some embodiments of this disclosure, the target node may send confirmation information to the node based on the verification result of at least one of the first verification information, the second verification information, and the third verification information.

[0591] For example, if the transmission strategy in the first verification information matches the target transmission strategy, the target node can send the first confirmation information to the first node.

[0592] For example, if the transmission strategy in the second verification information matches the target transmission strategy, the target node can send a second confirmation message to the second node.

[0593] For example, the target node can send a third confirmation message to the intermediate node if the transmission strategy in the third verification message matches the target transmission strategy.

[0594] In other words, the target node verifies the transmission policy received by any of the first, second, and intermediate nodes through a handshake confirmation process to ensure that the node can receive the accurate transmission policy.

[0595] It should be noted that the first confirmation information may include file preprocessing information and / or file inverse processing information in the transmission policy sent by the target node, as well as a second identifier used to indicate successful policy verification.

[0596] For example, the first confirmation information may include at least one of the following:

[0597] A second identifier used to indicate successful policy verification;

[0598] The first information of the target preprocessing model and / or algorithm;

[0599] The second information of the target inverse processing model and / or algorithm;

[0600] The input parameters required by the target preprocessing model and / or algorithm.

[0601] Similarly, the second confirmation information may include file preprocessing information and / or file inverse processing information in the transmission policy sent by the target node, as well as a second identifier indicating successful policy verification. The third confirmation information may include file preprocessing information and / or file inverse processing information in the transmission policy sent by the target node, as well as a second identifier indicating successful policy verification.

[0602] In some other embodiments of this disclosure, if the transmission strategy of any of the first verification information, the second verification information, or the third verification information does not match the target transmission strategy sent by the target node, the target node may resend the target transmission strategy to the node corresponding to the verification information.

[0603] For example, if the transmission policy in the first verification information does not match the target transmission policy, the target node can resend the target transmission policy to the first node until the first node receives the accurate and complete target transmission policy.

[0604] For example, if the transmission policy in the second verification information does not match the target transmission policy, the target node can resend the target transmission policy to the second node until the second node receives the accurate and complete target transmission policy.

[0605] For example, if the transmission policy in the third verification information does not match the target transmission policy, the target node can resend the target transmission policy to the intermediate node until the intermediate node receives the accurate and complete target transmission policy.

[0606] In some embodiments, after sending the target transmission policy to the first node, the second node, and the intermediate node, the target node can update the target transmission policy by monitoring the state changes of the first node, the second node, and the intermediate node.

[0607] In some embodiments of this disclosure, the target node may receive updated status information sent by at least one of the first node, the second node, and the intermediate node, and, in conjunction with the updated status information, redetermine the transmission strategy of the target file (as in step 902 above).

[0608] For example, the target node can receive the updated first status information sent by the first node, and if the updated first status information and the first status information before the update meet the first condition, the target node can redetermine the transmission strategy of the target file based on the updated first status information, the second status information and the third status information, and obtain the redetermined first transmission strategy.

[0609] Alternatively, if the updated first state information does not satisfy the first condition compared to the original first state information, the target node does not need to redetermine the transmission strategy of the target file based on the updated first state information.

[0610] The first condition may include at least one of the following:

[0611] The information difference between the updated first state information and the original first state information is greater than the first information difference threshold.

[0612] The time interval between the updated first status information and the original first status information is greater than the first time difference threshold.

[0613] The first parameter information is greater than the first parameter threshold. The first parameter information consists of the information difference between the updated first state information and the first state information before the update, and the transmission time interval.

[0614] It should be noted that the embodiments of this disclosure do not limit the way in which the information difference and the transmission time interval constitute the first parameter information. For example, the first parameter information can be equal to the sum of the information difference and the transmission time interval. Another example is that the first parameter information can be equal to the product of the information difference and the transmission time interval. Yet another example is that the first parameter information can be equal to the ratio between the information difference and the transmission time interval.

[0615] For example, the target node can receive the updated second status information sent by the second node, and if the updated second status information and the previous second status information satisfy the second condition, it can redetermine the transmission strategy of the target file based on the first status information, the updated second status information and the third status information to obtain the redetermined first transmission strategy.

[0616] Alternatively, if the updated second state information does not satisfy the second condition compared to the previous second state information, the target node does not need to redetermine the transmission strategy of the target file based on the updated second state information.

[0617] The second condition may include at least one of the following:

[0618] The information difference between the updated second state information and the unupdated second state information is greater than the second information difference threshold;

[0619] The transmission time interval between the updated second status information and the original second status information is greater than the second time difference threshold;

[0620] The second parameter information is greater than the second parameter threshold. The second parameter information consists of the information difference between the updated second state information and the previous second state information, and the transmission time interval.

[0621] For example, the target node can receive the updated third status information sent by the intermediate node, and if the updated third status information and the previous third status information satisfy the second condition, the target node can redetermine the transmission strategy of the target file based on the first status information, the second status information and the updated third status information, and obtain the redetermined first transmission strategy.

[0622] Alternatively, if the updated third state information does not satisfy the second condition compared to the previous third state information, the target node does not need to redetermine the transmission strategy of the target file based on the updated third state information.

[0623] The third condition may include at least one of the following:

[0624] The information difference between the updated third state information and the original third state information is greater than the third information difference threshold;

[0625] The transmission time interval between the updated third status information and the original third status information is greater than the third time difference threshold;

[0626] The third parameter information is greater than the third parameter threshold. The third parameter information consists of the information difference between the updated third state information and the original third state information, and the transmission time interval.

[0627] It should be noted that the first information difference threshold, the second information difference threshold, and the third information difference threshold can be the same information difference threshold. Alternatively, the first information difference threshold, the second information difference threshold, and the third information difference threshold can be different information difference thresholds.

[0628] In other words, the target node can update and manage the transmission strategy of the target file based on the status changes actively reported by the first node, second node, and intermediate nodes to ensure that the transmission strategy matches the node status. Furthermore, the target node can selectively update its strategy by judging the degree of status change of different nodes, avoiding frequent updates to the transmission strategy.

[0629] In some other embodiments of this disclosure, the target node can obtain the first state information of the first node at the preset time, the second state information of the second node at the preset time, and the third state information of the intermediate node at the preset time at a preset time within a preset period. Based on the first state information, the second state information, and the third state information at the preset time, the target node can redetermine the transmission strategy of the target file to obtain the redetermined first transmission strategy.

[0630] In other words, the target node can periodically and proactively query the status information of the first node, the second node, and the intermediate node to update the transmission strategy for managing the target file, so as to avoid a situation where the transmission strategy is mismatched due to any of the first node, the second node, and the intermediate node failing to detect the status change in time.

[0631] Furthermore, the target node can flexibly combine the above-mentioned strategy update methods.

[0632] For example, the target node can simultaneously receive the updated first status information sent by the first node, the updated second status information sent by the second node, and the updated third status information sent by the intermediate node, and redetermine the transmission strategy of the target file based on the updated first status information, the updated second status information, and the updated third status information.

[0633] For example, the target node can receive the updated first status information sent by the first node, and the target node receives the first status information at the same time as the preset time in the preset period. Then the target node can obtain the second status information of the second node at the preset time and the third status information of the intermediate node at the preset time, and redetermine the transmission strategy of the target file based on the updated first status information (i.e., the first status information at the preset time), the second status information at the preset time, and the third status information at the preset time.

[0634] It should be understood that for other combinations of strategy update methods, please refer to the two examples above, which will not be elaborated on here.

[0635] In some embodiments, if the first transmission strategy after the target node is redefined is different from the target transmission strategy, the first transmission strategy is sent to at least one of the first node, the second node, and the intermediate node.

[0636] In other words, although the state of the referenced node may change, the re-determined transmission strategy may be the same as the previously determined transmission strategy. Therefore, the target node can configure a new transmission strategy for each node only when the previously determined transmission strategies are different, thus avoiding the repeated transmission of the same strategy.

[0637] In some embodiments, the target node can be an intermediate node (such as a network node on the RAN side) or a service node.

[0638] In some embodiments of this disclosure, taking the intermediate node as a base station as an example, the target node can be a base station, or the target node can be the central unit in the base station.

[0639] In some embodiments, taking the target node as an intermediate node as an example, such as... Figure 10 As shown, the transmission management method provided in this application embodiment may include:

[0640] Step 1001: The intermediate node obtains the first state information of the first node, the second state information of the second node, and the third state information of the intermediate node.

[0641] The descriptions of the first state information, the second state information, and the third state information can be found in the above embodiments and will not be repeated here.

[0642] In some embodiments of this disclosure, taking the intermediate node as a base station as an example, if the target node is a base station, then during the process of the intermediate node acquiring the first status information, the second status information and the third status information, the intermediate node can receive the status information sent by the first node and / or the second node, and acquire the third status information stored locally.

[0643] In some other embodiments of this disclosure, taking the intermediate node as a base station as an example, if the target node is the central unit in the base station, then during the process of the intermediate node acquiring the first state information, the second state information and the third state information, the intermediate node can receive the state information sent by the first node and / or the second node, and acquire the third state information collected by the DU in the intermediate node.

[0644] Step 1002: The intermediate node determines the target transmission strategy for the target file sent by the first node to the second node based on at least one of the first state information, the second state information, and the third state information.

[0645] The process of determining the target transmission strategy based on the first state information, the second state information, and the third state information, as well as the introduction of the target transmission strategy, can be referred to the description in the above embodiments, and will not be repeated here.

[0646] Step 1003: The intermediate node sends the target transmission strategy to the first node and / or the second node.

[0647] In some embodiments of this disclosure, if the first node does not perform file preprocessing, but the intermediate node performs file preprocessing, then the intermediate node may not need to send the target transmission policy to the first node, but only to the second node.

[0648] In some other embodiments of this disclosure, if the second node is unaware of the file inverse processing and the inverse processing is performed by the intermediate node, the intermediate node may not need to send the target transmission strategy to the second node, but only to the first node.

[0649] In other embodiments, taking the first node as a user node, the second node as a service node, and the target node as a service node as an example, such as... Figure 11 As shown, the transmission management method provided in this application embodiment may include:

[0650] Step 1101: The service node obtains the first status information of the user node, the second status information of the service node, and the third status information of the intermediate node.

[0651] The descriptions of the first state information, the second state information, and the third state information can be found in the above embodiments and will not be repeated here.

[0652] In this application, during the process of the service node obtaining the first state information, the second state information and the third state information, the service node can receive the state information sent by the user node and / or the intermediate node, and obtain the second state information stored locally.

[0653] Step 1102: The service node determines the target transmission strategy for the target file sent by the first node to the second node based on at least one of the first state information, the second state information, and the third state information.

[0654] The process of determining the target transmission strategy based on the first state information, the second state information, and the third state information, as well as the introduction of the target transmission strategy, can be referred to the description in the above embodiments, and will not be repeated here.

[0655] Step 1103: The service node sends the target transmission strategy to the user node and the intermediate node.

[0656] In summary, this describes an embodiment of the transmission strategy for determining the target file by the target node during the transmission management process. The following section uses the first node performing file preprocessing as an example to describe the transmission management method provided in this application. Figure 12 As shown, the transmission management method includes:

[0657] Step 1201: The first node obtains the target transmission strategy.

[0658] In some embodiments, the first node can receive the target transmission strategy sent by the target node by sending first status information to the target node, thereby obtaining the target transmission strategy.

[0659] The target transmission strategy may include: file preprocessing information, file inverse processing information, and target transmission resources.

[0660] It should be noted that the descriptions of file preprocessing information, file inverse processing information, and target transmission resources can be found in the file preprocessing information described in 6.1-6.4, the file inverse processing information described in 7.1-7.2, and the target transmission resources described in 8.1-8.3 in the above embodiments, and will not be repeated here.

[0661] In addition, the first status information includes: the preprocessing capability information of the first node performing file preprocessing and / or the transmission task information of the target file.

[0662] It should be noted that for the description of preprocessing capability information and transmission task information, please refer to the preprocessing capability information described in 1.1-1.7 and the transmission task information described in 4.1-4.7 in the above embodiments, which will not be repeated here.

[0663] In some embodiments of this disclosure, the target node may be an intermediate node or a second node.

[0664] In this system, the intermediate node can be a base station, and the second node can be a serving node. Therefore, the target node can be a base station; or, the target node can be a central node within a base station; or, the target node can be a serving node.

[0665] In some embodiments of this disclosure, during the process of the first node sending the first status information to the target node, the first node may receive the transmission request information sent by the target node and, in response to the transmission request information, send the first status information to the target node.

[0666] The transmission request information may include at least one of the following (1)-(2):

[0667] (1) An identifier used to determine the transmission strategy of the target file;

[0668] (2) Service quality requirements information of the target document.

[0669] In some embodiments, after the first node receives the target transmission policy sent by the target node, the first node may send first verification information to the target node according to the received target transmission policy. The first verification information is used to verify the transmission policy received by the first node.

[0670] In other words, the first node verifies whether the transmission strategy received by the first node is the same as the transmission strategy sent by the target node by sending verification information to the target node.

[0671] In some embodiments of this disclosure, the first node may receive first confirmation information sent by the target node. The first confirmation information is used to indicate that the target transmission policy received by the first node matches the target transmission policy sent by the target node.

[0672] In other words, the first node verifies the received transmission policy by handshaking with the target node, ensuring the accuracy of the transmission policy received by the first node.

[0673] Step 1202: The first node performs file preprocessing on the target file sent to the second node based on the file preprocessing information, and obtains the preprocessed target file.

[0674] In some embodiments of this disclosure, during the process of preprocessing the target file based on the file preprocessing information of the target transmission strategy, the first node may add file preprocessing information and / or file inverse processing information to the header of the file, so that the header of the preprocessed target file carries file preprocessing information and / or file inverse processing information.

[0675] It should be noted that file preprocessing operations are used to reduce file size and can include encoding (such as source coding, channel coding) or compression. File inverse processing operations are used to restore or partially restore the file to its state before file preprocessing and can include decoding (such as source decoding, channel decoding) or decompression.

[0676] The header of the preprocessed target file may carry at least one of the following:

[0677] File preprocessing information;

[0678] Partial information from file preprocessing information;

[0679] Reverse processing information of files;

[0680] Partial information from the file reverse processing information.

[0681] In other words, since there is usually a time difference between the preprocessing and reverse processing, the file preprocessing information and the file reverse processing information are exchanged through the header, which can ensure the consistency and timeliness of processing parameters and content information, and fully guarantee the optimal QoS.

[0682] Step 1203: The first node sends the preprocessed target file to the intermediate node between the first node and the second node.

[0683] In some embodiments of this disclosure, the first node may send the preprocessed target file to the intermediate node based on the target transmission resources allocated to the first node by the intermediate node.

[0684] In some other embodiments of this disclosure, the first node may send the preprocessed header of the target file to the intermediate node based on preset transmission resources. Then, the first node may send the information following the header in the preprocessed target file to the intermediate node based on the target transmission resources allocated to it by the intermediate node according to the information carried in the header.

[0685] The preset transmission resources can be the default common transmission resources of the first node and intermediate nodes, or the preset transmission resources can be the transmission resources allocated in the previous transmission stage.

[0686] In some embodiments, the first node can detect changes in its own state and send updated first state information to the target node if there are changes in the first node's preprocessing capability information and / or transmission task information.

[0687] The updated first status information includes: the changed preprocessing capability information and / or the changed transmission task information.

[0688] In some embodiments of this disclosure, after the first node sends the updated first status information to the target node, if the target node determines that the updated first status information and the first status information before the update satisfy a first condition, then the first node can receive the first transmission strategy sent by the target node.

[0689] The first transmission strategy is the transmission strategy for the target file that the target node re-determines based on the updated first state information, and the first transmission strategy is different from the target transmission strategy.

[0690] In some other embodiments of this disclosure, after the first node sends the updated first status information to the target node, if the target node determines that the updated first status information does not meet the first condition compared with the first status information before the update, the first node may continue to receive the target transmission strategy of repeated transmission based on the first transmission period.

[0691] In some embodiments, the first node may periodically send its own first state information to the target node.

[0692] In some embodiments of this disclosure, the first node may send the first status information at the reporting time in the first status reporting period to the target node.

[0693] In this context, after the first node sends the first status information to the target node for the first time, the first status information sent by the first node at the reporting time in the first status reporting period is all the updated first status information.

[0694] In summary, this describes an embodiment of the first node's response to the transmission strategy during the transmission management process. The following section uses an intermediate node between the first and second nodes as an example to describe the transmission management method provided in this application. Figure 13 As shown, the transmission management method includes:

[0695] Step 1301: The intermediate node obtains the target transmission strategy.

[0696] In some embodiments, an intermediate node can receive a target transmission strategy from a target node by sending third-state information to the target node, thereby obtaining the target transmission strategy.

[0697] The target transmission strategy may include: file preprocessing information, file inverse processing information, and target transmission resources.

[0698] It should be noted that the descriptions of file preprocessing information, file inverse processing information, and target transmission resources can be found in the file preprocessing information described in 6.1-6.4, the file inverse processing information described in 7.1-7.2, and the target transmission resources described in 8.1-8.3 in the above embodiments, and will not be repeated here.

[0699] In addition, the third state information includes at least one of the following: air interface state information between the first node and the second node, preprocessing capability information of intermediate nodes performing file preprocessing, and reverse processing capability information of intermediate nodes performing file reverse processing.

[0700] It should be noted that for the description of preprocessing capability information, reverse processing capability information and air interface status information, please refer to the preprocessing capability information described in 1.1-1.7, the reverse processing capability information described in 2.1-2.7, and the air interface status information described in 3.1-3.6 in the above embodiments, and will not be repeated here.

[0701] In some embodiments of this disclosure, the target node may be a service node among the first node and the second node. Alternatively, the intermediate node may be a distribution unit in the base station, and the target node may be a central unit in the base station.

[0702] In some embodiments of this disclosure, during the process of an intermediate node sending third status information to a target node, the intermediate node may receive transmission request information sent by the target node and, in response to the transmission request information, send third status information to the target node.

[0703] The transmission request information may include at least one of the following (1)-(2):

[0704] (1) An identifier used to determine the transmission strategy of the target file;

[0705] (2) Service quality requirements information of the target document.

[0706] In some embodiments, after the intermediate node receives the target transmission policy sent by the target node, the intermediate node can send third verification information to the target node according to the received target transmission policy. The third verification information is used to verify the transmission policy received by the intermediate node.

[0707] In other words, the intermediate node verifies whether the transmission strategy received by the intermediate node is the same as the transmission strategy sent by the target node by sending verification information to the target node.

[0708] In some embodiments of this disclosure, the intermediate node may receive a third confirmation message sent by the target node. The third confirmation message is used to indicate that the target transmission strategy received by the intermediate node matches the target transmission strategy sent by the target node.

[0709] In other words, the intermediate node verifies the received transmission policy through a handshake confirmation with the target node, ensuring the accuracy of the transmission policy received by the intermediate node.

[0710] Step 1302: The intermediate node allocates target transmission resources to the first node.

[0711] As some embodiments of this disclosure, the intermediate node may allocate target transmission resources to the first node according to the target transmission resources in the target transmission strategy.

[0712] In some embodiments, the first node performs file preprocessing. The intermediate node can receive the header of the preprocessed target file sent by the first node based on preset transmission resources, and determine the target transmission strategy based on the information carried in the header. Then, it allocates target transmission resources in the target transmission strategy to the first node and receives the information following the header in the preprocessed target file sent by the first node based on the target transmission resources.

[0713] The header of the preprocessed target file may carry at least one of the following:

[0714] File preprocessing information;

[0715] Partial information from file preprocessing information;

[0716] Reverse processing information of files;

[0717] Partial information from the file reverse processing information.

[0718] In some embodiments of this disclosure, the intermediate node can determine whether the information carried in the header of the preprocessed target file matches the mapping table corresponding to the target file in the target transmission strategy. If the target transmission resource corresponding to the information carried in the header exists in the mapping table corresponding to the target file, the intermediate node determines that the target transmission strategy has been verified and allocates the target transmission resource in the target transmission strategy to the first node.

[0719] In other embodiments of this disclosure, the intermediate node can determine whether the information carried in the header of the preprocessed target file matches the file preprocessing information and / or file inverse processing information in the target transmission strategy, and if the information carried in the header matches the file preprocessing information and / or file inverse processing information, it determines that the target transmission strategy has been verified and allocates the target transmission resources in the target transmission strategy to the first node.

[0720] In some embodiments, an intermediate node may receive a preprocessed target file from a first node and send the preprocessed target file to a second node.

[0721] In some embodiments of this disclosure, intermediate nodes can perform file inverse processing. An intermediate node can perform file inverse processing on a preprocessed target file based on the file inverse processing information carried in the header of the preprocessed target file, obtain the inverse-processed target file, and send the inverse-processed target file to a second node.

[0722] In some other embodiments of this disclosure, the intermediate node can perform file inverse processing. The intermediate node can perform file inverse processing on the preprocessed target file according to the file inverse processing information in the target transmission strategy, obtain the inverse-processed target file, and send the inverse-processed target file to the second node.

[0723] It should be noted that the reverse-processed target file can be the same as the target file, or the reverse-processed target file can be different from the target file.

[0724] In some embodiments, the first node can be a service node, the second node can be a user node, and the intermediate node can perform file preprocessing. The intermediate node can receive the target file from the first node, and perform file preprocessing on the target file according to the file preprocessing information in the target transmission policy to obtain the preprocessed target file, and then send the preprocessed target file to the second node.

[0725] In some embodiments of this disclosure, during the process of preprocessing the target file based on the file preprocessing information of the target transmission strategy, the intermediate node may add file preprocessing information and / or file inverse processing information to the header of the file, so that the header of the preprocessed target file carries file preprocessing information and / or file inverse processing information.

[0726] In some embodiments, the intermediate node can detect changes in its own state and send updated third state information to the target node if any of the intermediate node's air interface state information, preprocessing capability information, or inverse processing capability information changes.

[0727] The updated third state information includes at least one of the following: the changed air interface state information, the changed preprocessing capability information, and the changed inverse processing capability information.

[0728] In some embodiments of this disclosure, after the intermediate node sends the updated third state information to the target node, if the target node determines that the updated third state information and the previous third state information satisfy the third condition, the intermediate node can receive the first transmission strategy sent by the target node.

[0729] The first transmission strategy is the transmission strategy for the target file that the target node re-determines based on the updated third state information, and the first transmission strategy is different from the target transmission strategy.

[0730] In some other embodiments of this disclosure, after the intermediate node sends the updated third status information to the target node, if the target node determines that the updated third status information does not meet the third condition compared with the previous third status information, the intermediate node can continue to receive the target transmission strategy of repeated transmission based on the third transmission period from the target node.

[0731] In some embodiments, intermediate nodes may periodically send their own third state information to the target node.

[0732] In some embodiments of this disclosure, the intermediate node may send the third state information at the reporting time in the third state reporting cycle to the target node.

[0733] In this process, after the intermediate node sends the third state information to the target node for the first time, the third state information sent by the intermediate node at the reporting time in the third state reporting cycle is all the updated third state information.

[0734] In summary, this describes an embodiment of how intermediate nodes respond to transmission strategies during transmission management. The following section uses the second node performing file reverse processing as an example to illustrate the transmission management method provided in this application. Figure 14As shown, the transmission management method includes:

[0735] Step 1401: The second node obtains the target transmission strategy.

[0736] The second node can be a service node, or it can be any user node other than the first node.

[0737] In some embodiments, the second node can receive the target transmission strategy sent by the target node by sending second status information to the target node, thereby obtaining the target transmission strategy.

[0738] The target transmission strategy may include: file preprocessing information, file inverse processing information, and target transmission resources.

[0739] It should be noted that the descriptions of file preprocessing information, file inverse processing information, and target transmission resources can be found in the file preprocessing information described in 6.1-6.4, the file inverse processing information described in 7.1-7.2, and the target transmission resources described in 8.1-8.3 in the above embodiments, and will not be repeated here.

[0740] In addition, the second status information includes: the service status information of the second node and / or the reverse processing capability information of the second node to perform file reverse processing.

[0741] It should be noted that for the description of reverse processing capability information and service status information, please refer to the reverse processing capability information described in 2.1-2.7 and the service status information described in 5.1-5.4 in the above embodiments, which will not be repeated here.

[0742] In some embodiments of this disclosure, the target node may be an intermediate node between the first node and the second node.

[0743] In this context, if the intermediate node can be a base station, then the target node can be a base station, or the target node can be the central node within a base station.

[0744] In some embodiments of this disclosure, during the process of the second node sending the second status information to the target node, the second node may receive the transmission request information sent by the target node and, in response to the transmission request information, send the second status information to the target node.

[0745] The transmission request information may include at least one of the following (1)-(2):

[0746] (1) An identifier used to determine the transmission strategy of the target file;

[0747] (2) Service quality requirements information of the target document.

[0748] In some embodiments, after the second node receives the target transmission policy sent by the target node, the second node can send second verification information to the target node according to the received target transmission policy. The second verification information is used to verify the transmission policy received by the second node.

[0749] In other words, the second node verifies whether the transmission strategy received by the second node is the same as the transmission strategy sent by the target node by sending verification information to the target node.

[0750] In some embodiments of this disclosure, the second node may receive a second confirmation message sent by the target node. The second confirmation message is used to indicate that the target transmission policy received by the second node matches the target transmission policy sent by the target node.

[0751] In other words, the second node verifies the received transmission policy through a handshake confirmation with the target node, ensuring the accuracy of the transmission policy received by the second node.

[0752] Step 1402: The second node receives the preprocessed target file sent by the intermediate node between the second node and the first node.

[0753] Step 1403: The second node performs file inverse processing on the preprocessed target file based on the file inverse processing information to obtain the inverse processed target file.

[0754] In some embodiments of this disclosure, the second node can perform file inverse processing on the preprocessed target file based on the file inverse processing information carried in the header of the preprocessed target file to obtain the inverse-processed target file.

[0755] In some other embodiments of this disclosure, the second node can perform file inverse processing on the preprocessed target file according to the file inverse processing information in the target transmission strategy to obtain the inverse processed target file.

[0756] In some embodiments, the second node can detect changes in its own state and send updated second state information to the target node if there are changes in the second node's service state information and / or reverse processing capability information.

[0757] The updated second status information includes: the changed service status information and / or the changed reverse processing capability information.

[0758] In some embodiments of this disclosure, after the second node sends the updated second status information to the target node, if the target node determines that the updated second status information and the previous second status information satisfy the second condition, then the second node can receive the first transmission strategy sent by the target node.

[0759] The first transmission strategy is the transmission strategy for the target file that the target node re-determines based on the updated second state information, and the first transmission strategy is different from the target transmission strategy.

[0760] In some other embodiments of this disclosure, after the second node sends the updated second status information to the target node, if the target node determines that the updated second status information does not meet the second condition compared with the previous second status information, the second node can continue to receive the target transmission strategy of repeated transmission based on the second transmission period from the target node.

[0761] In some embodiments, the second node may periodically send its own second state information to the target node.

[0762] In some embodiments of this disclosure, the second node may send the second status information at the reporting time in the second status reporting cycle to the target node.

[0763] In this context, after the second node sends the second status information to the target node for the first time, the second status information sent by the second node at the reporting time in the second status reporting cycle is all the updated second status information.

[0764] In summary, this is an introduction to an embodiment of the transmission strategy response of different nodes during the transmission management process. The following section, in conjunction with the above... Figure 8 The uplink and downlink scenarios shown illustrate the transmission management method provided in the embodiments of this application, including Examples 1-6.

[0765] Example 1: Using the first node as the user node, the second node as the service node, and intermediate nodes as network nodes (such as base stations on the RAN side), with the target node (such as the control node) located on the network node (e.g., the target node is a BS), file preprocessing is performed on the user node, and file inverse processing is performed on the network node (i.e., the above). Figure 8 The uplink scenario 1 shown describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 15 As shown, the process includes an input data stage (steps 1503-1506), a decision transmission stage (steps 1508-1510), and a processing execution stage (steps 1511-1514), comprising the following steps:

[0766] Step 1501: The user node establishes a session with the service node.

[0767] In some embodiments of this disclosure, during the process of establishing a session with the service node, the user node and the service node can determine the transmission task ID (such as the real-time media task ID) of the media file to be transmitted.

[0768] In the transmission task between the user node and the service node, the media file to be transmitted can be the target file.

[0769] Step 1502: The network node performs task identification, and the algorithm is started.

[0770] In this context, network nodes can identify the transmission task or task type between user nodes and service nodes through the task ID in the header sent by user nodes.

[0771] In some embodiments, network nodes store a task mapping table, which includes multiple task IDs, multiple transmission tasks, and multiple task types, with each task ID corresponding to one transmission task and one task type. Network nodes can identify the transmission task or task type between a user node and a service node based on the task ID carried in the header of the session message sent by the user node to the service node.

[0772] In some embodiments of this disclosure, the network node also stores algorithm startup rules, which include: determining a transmission strategy for the files to be transmitted in the task (i.e., algorithm startup) when a preset transmission task and / or preset task type is identified. The network node can start the algorithm, determine a transmission strategy for the files to be transmitted in the task, and execute steps 1503-1508 if the result of task identification matches the preset transmission task and / or preset task type in the algorithm startup rules.

[0773] Step 1503: The network node sends a transmission request message to the user node.

[0774] Step 1504: The network node sends a transmission request message to the service node.

[0775] In other words, network nodes can send transmission request information to user nodes and / or service nodes to verify their capabilities and / or request data in order to obtain the node status information referenced in determining the subsequent transmission strategy.

[0776] It should be noted that the order of steps 1503 and 1504 is not limited in this embodiment. For example, the network node may execute step 1503 first, and then execute step 1504. Alternatively, the network node may execute step 1504 first, and then execute step 1503. Or, the network node may execute steps 1503 and 1504 simultaneously.

[0777] In some embodiments of this disclosure, if a network node can determine the first state information of a user node in the current situation based on the user node's historical state information, then the network node does not need to send transmission request information to the user node for capability confirmation and / or data request, but can determine the first state information of the user node in the current situation based on the user node's historical state information.

[0778] Similarly, if a network node can determine the second state information of a service node in the current situation based on the service node's historical state information, then the network node does not need to send transmission request information to the service node for capability confirmation and / or data request, but can determine the second state information of the service node in the current situation based on the service node's historical state information.

[0779] It should be noted that the process by which a network node determines the first state information of a user node in the current situation based on the historical state information of the user node, and the process by which a network node determines the second state information of a service node in the current situation based on the historical state information of the service node, can be referred to the description of obtaining the first state information and the second state information in step 901 of the above embodiments, and will not be repeated here.

[0780] In other words, steps 1503 and 1504 are optional steps in the input data stage. That is, steps 1503 and 1504 can be omitted in the input data stage, and network nodes can skip steps 1503 and 1504 after executing step 1502.

[0781] In some embodiments, since the file inverse processing is performed on the network node, the inverse processing capability information referenced by the transmission strategy is provided by the network node itself, rather than by the service node. Therefore, if the network node can avoid receiving service status information from the service node, it does not need to send transmission request information to the service node.

[0782] Step 1505: The user node sends the first status information to the network node.

[0783] The first status information sent by the user node is used to indicate capability confirmation feedback and / or data request feedback.

[0784] Step 1506: The service node sends the second status information to the network node.

[0785] The signaling name between the second status information sent by the service node and the first status information sent by the user node can be different.

[0786] It should be noted that there is no dependency between steps 1505 and 1506, and their order can be changed.

[0787] Step 1507: The network node determines the transmission strategy for the target file.

[0788] In some embodiments, network nodes can determine the transmission strategy for the target file based on first state information, second state information, and the network node's own third state information. In actual implementation, various decision-making methods such as algorithms, AI models, and table lookups can be used.

[0789] The inputs to the decision may include one or more of the following:

[0790] a) All or part of the information in the first state information;

[0791] b) All or part of the information in the second state information;

[0792] c) All or part of the information in the third state information.

[0793] Based on the above inputs, the output of the decision can be the target transmission strategy, which includes one or more of the following:

[0794] a) All or part of the information in the file preprocessing information;

[0795] b) All or part of the information in the file's reverse processing information;

[0796] c) All or part of the resource information in the target transmission resource.

[0797] In other words, the transmission strategy is determined by jointly making decisions based on information from the terminal, communication, and computing resources. This approach identifies the resource status of these three parties and determines whether and how to perform preprocessing, thereby ensuring optimal end-to-end latency and overall service experience for the user.

[0798] Step 1508: The network node sends the target transmission policy to the user node.

[0799] Step 1509: The user node sends the first verification information to the network node.

[0800] Step 1510: The network node sends the first confirmation message to the user node.

[0801] In some embodiments of this disclosure, steps 1509 and 1510 are the process of handshaking and confirming between the network node and the user node. The network node may or may not use handshaking confirmation with the user node.

[0802] In other words, steps 1509 and 1510 are optional steps in the decision transmission phase.

[0803] Step 1511: User nodes perform file preprocessing.

[0804] In this process, user nodes can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[0805] Step 1512: The network node allocates transmission resources to the user node.

[0806] The transmission resources allocated by the network node to the user node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[0807] It should be noted that there is no dependency between steps 1511 and 1512, and their order can be changed.

[0808] Step 1513: The user node and the network node transfer files.

[0809] In some embodiments of this disclosure, a user node may upload a preprocessed target file to a network node, and the header of the preprocessed target file carries file preprocessing information and / or file inverse processing information.

[0810] Step 1514: The network node performs reverse file processing on the received preprocessed target file.

[0811] The network node can select a decompression tool based on the file preprocessing information and / or file reverse processing information carried in the header of the preprocessed target file to perform file reverse processing on the preprocessed target file, and remove the file preprocessing information and / or file reverse processing information from the header after decompression.

[0812] In other words, file preprocessing information and / or file inverse processing information are transmitted through the header, which can ensure the time alignment of policy information and file information and guarantee the effectiveness of policy execution.

[0813] Alternatively, network nodes can select a decompression tool based on the file preprocessing information and / or file inverse processing information in the target transmission strategy to perform file inverse processing on the preprocessed target file.

[0814] In some embodiments of this disclosure, if there is a corresponding decompression decoder tool at the destination of the target file transmission (i.e., the service node), or if the service function in the service node (such as a large model) can handle the encoding format of the preprocessed target file, then the network node can send the preprocessed target file directly to the service node without performing step 1514.

[0815] In some other embodiments of this disclosure, after the network node performs reverse processing on the preprocessed target file, the network node can send the reverse-processed target file to the service node.

[0816] Example 2: Taking the first node as the user node, the second node as the service node, and the intermediate node as the network node (such as the base station on the RAN side), and the target node (such as the control node) as being on the network node (such as the BS as the target node), file preprocessing is performed on the user node, and file inverse processing is performed on the service node (i.e., the above). Figure 8 The uplink scenario 2 shown describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 16 As shown, it includes an input data stage (steps 1603-1606), a decision transmission stage (steps 1608-1613), and a processing execution stage (steps 1614-1617), including the following steps:

[0817] Step 1601: The user node establishes a session with the service node.

[0818] It should be noted that the process of establishing a session between a user node and a service node can be referred to the description of step 1501 above, and will not be repeated here.

[0819] Step 1602: The network node performs task identification, and the algorithm is started.

[0820] It should be noted that the process of task identification and algorithm startup for network nodes can be referred to the description of step 1502 above, and will not be repeated here.

[0821] Step 1603: The network node sends a transmission request message to the user node.

[0822] Step 1604: The network node sends a transmission request message to the service node.

[0823] It should be noted that the process of a network node sending transmission request information to a user node / service node can be referred to the descriptions of steps 1503 and 1504 above, and will not be repeated here.

[0824] Step 1605: The user node sends the first status information to the network node.

[0825] Step 1606: The service node sends the second status information to the network node.

[0826] The signaling name between the second status information sent by the service node and the first status information sent by the user node can be different.

[0827] It should be noted that there is no dependency between steps 1605 and 1606, and their order can be changed.

[0828] Step 1607: The network node determines the transmission strategy for the target file.

[0829] It should be noted that the process of network nodes determining the transmission strategy of target files can be referred to the description of step 1507 above, and will not be repeated here.

[0830] Step 1608: The network node sends the target transmission policy to the user node.

[0831] Step 1609: The network node sends the target transmission strategy to the service node.

[0832] The target transmission policy sent by the network node to the user node and the target transmission policy sent by the network node to the service node can have different formats and signaling names.

[0833] It should be noted that the order of steps 1608 and 1609 is not limited in this embodiment. For example, the network node may execute step 1608 first, and then execute step 1609. Alternatively, the network node may execute step 1609 first, and then execute step 1608. Or, the network node may execute steps 1608 and 1609 simultaneously.

[0834] In some embodiments, if the user node adds the file inverse processing information of the transmission policy to the file header during the file preprocessing operation based on the transmission policy, the network node does not need to send the target transmission policy to the service node. Subsequently, the service node can obtain the file inverse processing information from the file header sent by the user node and then perform the file inverse processing operation.

[0835] In other words, step 1609 is an optional step in the decision transmission phase. That is, step 1609 can be omitted in the decision transmission phase, and network nodes can skip step 1609 after executing step 1608.

[0836] The following describes the transmission management method provided in this application embodiment, taking the decision transmission stage, including step 1609, as an example, where the network node sends the target transmission strategy to the service node.

[0837] Step 1610: The user node sends the first verification information to the network node.

[0838] Step 1611: The service node sends the second verification information to the network node.

[0839] The format and signaling name of the first authentication information sent by the user node to the network node and the second authentication information sent by the service node to the network node can be different.

[0840] It should be noted that there is no dependency between steps 1610 and 1611, and their order can be changed.

[0841] Step 1612: The network node sends the first confirmation message to the user node.

[0842] Step 1613: The network node sends a second confirmation message to the service node.

[0843] The format and signaling name of the first confirmation message sent by the network node to the user node and the second confirmation message sent by the network node to the service node can be different.

[0844] It should be noted that the order of steps 1612 and 1613 is not limited in this embodiment. For example, the network node may execute step 1612 first, and then execute step 1613. Alternatively, the network node may execute step 1613 first, and then execute step 1612. Yet another example is that the network node may execute steps 1612 and 1613 simultaneously.

[0845] In some embodiments of this disclosure, steps 1610 and 1612 are the process of handshaking confirmation between the network node and the user node, and steps 1611 and 1613 are the process of handshaking confirmation between the network node and the service node. The network node may use handshaking confirmation on both the user node and the service node or not, or only on one of the user node or the service node.

[0846] In other words, steps 1610 and 1612, and steps 1611 and 1613 are optional steps in the decision transmission phase.

[0847] It should be noted that if step 1609 is not included in the decision transmission stage in this embodiment, then steps 1611 and 1613 are also not included in the decision transmission stage.

[0848] Step 1614: User nodes perform file preprocessing.

[0849] In this process, user nodes can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[0850] Step 1615: The network node allocates transmission resources to the user node.

[0851] The transmission resources allocated by the network node to the user node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[0852] It should be noted that there is no dependency between steps 1614 and 1615, and their order can be changed.

[0853] Step 1616: User nodes transfer files with service nodes through network nodes.

[0854] In some embodiments of this disclosure, user nodes can upload preprocessed target files to service nodes through the forwarding function of network nodes, and the header of the preprocessed target files carries file preprocessing information and / or file reverse processing information.

[0855] Step 1617: The service node performs reverse file processing on the received preprocessed target file.

[0856] It should be noted that the process of the service node performing reverse processing on the received preprocessed target file can be referred to the description of step 1514 above, and will not be repeated here.

[0857] In some embodiments of this disclosure, the service function (such as a large model) in the destination of the target file transmission (i.e., the service node) can handle the encoding format of the preprocessed target file. In this case, the service node does not need to execute step 1617 and can directly perform calculation processing on the preprocessed target file based on the service function (such as inputting media files into the AI ​​model).

[0858] Example 3: Taking the first node as the user node, the second node as the service node, and the intermediate nodes as network nodes (such as base stations on the RAN side), with the target node (such as the control node) on the service node, file preprocessing performed on the user node, and file inverse processing performed on the service node as an example (i.e., the above). Figure 8 The uplink scenario 3 shown describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 17 As shown, it includes an input data stage (steps 1703-1706), a decision transmission stage (steps 1708-1713), and a processing execution stage (steps 1714-1717), including the following steps:

[0859] Step 1701: The user node establishes a session with the service node.

[0860] It should be noted that the process of establishing a session between a user node and a service node can be referred to the description of step 1501 above, and will not be repeated here.

[0861] Step 1702: The service node performs task identification and the algorithm starts.

[0862] It should be noted that the process of task identification and algorithm startup for service nodes can be referred to the description of step 1502 above, and will not be repeated here.

[0863] Step 1703: The service node sends a transmission request message to the user node.

[0864] Step 1704: The service node sends a transmission request message to the network node.

[0865] In other words, service nodes can send transmission request information to user nodes and / or network nodes to verify capabilities and / or request data in order to obtain node status information referenced in determining subsequent transmission strategies.

[0866] It should be noted that the order of steps 1703 and 1704 is not limited in this embodiment. For example, the service node may execute step 1703 first, and then execute step 1704. Alternatively, the service node may execute step 1704 first, and then execute step 1703. Or, the service node may execute steps 1703 and 1704 simultaneously.

[0867] In some embodiments of this disclosure, if the service node can determine the first state information of the user node in the current situation based on the user node's historical state information, then the service node does not need to send transmission request information to the user node for capability confirmation and / or data request, but can determine the first state information of the user node in the current situation based on the user node's historical state information.

[0868] Similarly, if a service node can determine the third state information of a network node in the current situation based on the network node's historical state information, then the service node does not need to send transmission request information to the network node for capability confirmation and / or data request, but can determine the third state information of the network node in the current situation based on the network node's historical state information.

[0869] It should be noted that the process by which the service node determines the first state information of the user node in the current situation based on the historical state information of the user node, and the process by which the service node determines the third state information of the network node in the current situation based on the historical state information of the network node, can be referred to the description of obtaining the first state information and the third state information in step 901 of the above embodiment, and will not be repeated here.

[0870] In other words, steps 1703 and 1704 are optional steps in the input data stage. That is, steps 1703 and 1704 can be omitted in the input data stage, and the service node can skip steps 1703 and 1704 after executing step 1702.

[0871] Step 1705: The user node sends the first status information to the service node.

[0872] Step 1706: The network node sends third status information to the service node.

[0873] The signaling name between the third status information sent by the network node and the first status information sent by the user node can be different.

[0874] It should be noted that there is no dependency between steps 1705 and 1706, and their order can be changed.

[0875] Step 1707: The service node determines the transmission strategy for the target file.

[0876] In some embodiments, the service node can determine the transmission strategy for the target file based on the first state information, the third state information, and the second state information of the service node itself. In actual implementation, various decision-making methods such as algorithms, AI models, and table lookups can be used.

[0877] It should be noted that the inputs and outputs of the service node in determining the transmission strategy of the target file can be referred to the description of step 1507 above, and will not be repeated here.

[0878] Step 1708: The service node sends the target transmission policy to the user node.

[0879] Step 1709: The service node sends the target transmission policy to the network node.

[0880] The target transmission policy sent by the service node to the user node and the target transmission policy sent by the service node to the network node can have different formats and signaling names.

[0881] It should be noted that the order of steps 1708 and 1709 is not limited in this embodiment. For example, the service node may execute step 1708 first, and then execute step 1709. Alternatively, the service node may execute step 1709 first, and then execute step 1708. Or, the service node may execute steps 1708 and 1709 simultaneously.

[0882] Step 1710: The user node sends the first verification information to the service node.

[0883] Step 1711: The network node sends a third verification message to the service node.

[0884] The format and signaling name of the first authentication information sent by the user node to the service node and the third authentication information sent by the network node to the service node can be different.

[0885] It should be noted that there is no dependency between steps 1710 and 1711, and their order can be changed.

[0886] Step 1712: The service node sends the first confirmation message to the user node.

[0887] Step 1713: The service node sends a third confirmation message to the network node.

[0888] The format and signaling name of the first confirmation message sent by the service node to the user node and the third confirmation message sent by the service node to the network node can be different.

[0889] It should be noted that the order of steps 1712 and 1713 is not limited in this embodiment. For example, the service node may execute step 1712 first, and then execute step 1713. Alternatively, the service node may execute step 1713 first, and then execute step 1712. Or, the service node may execute steps 1712 and 1713 simultaneously.

[0890] In some embodiments of this disclosure, steps 1710 and 1712 are the process of handshaking confirmation between the service node and the user node, and steps 1711 and 1713 are the process of handshaking confirmation between the service node and the network node. The service node may use handshaking confirmation on both the user node and the network node, or not use it, or only use it on one of the user node or the network node.

[0891] In other words, steps 1710 and 1712, and steps 1711 and 1713 are optional steps in the decision transmission phase.

[0892] Step 1714: User nodes perform file preprocessing.

[0893] In this process, user nodes can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[0894] Step 1715: The network node allocates transmission resources to the user node.

[0895] The transmission resources allocated by the network node to the user node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[0896] It should be noted that there is no dependency between steps 1714 and 1715, and their order can be changed.

[0897] Step 1716: User nodes transfer files with service nodes through network nodes.

[0898] In some embodiments of this disclosure, user nodes can upload preprocessed target files to service nodes through the forwarding function of network nodes, and the header of the preprocessed target files carries file preprocessing information and / or file reverse processing information.

[0899] Step 1717: The service node performs reverse file processing on the received preprocessed target file.

[0900] It should be noted that the process of the service node performing reverse processing on the received preprocessed target file can be referred to the description of step 1514 above, and will not be repeated here.

[0901] In some embodiments of this disclosure, the service function (such as a large model) in the destination of the target file transmission (i.e., the service node) can handle the encoding format of the preprocessed target file. In this case, the service node does not need to execute step 1717 and can directly perform calculation processing on the preprocessed target file based on the service function (such as inputting media files into the AI ​​model).

[0902] Example 4: Using a scenario where the first node is the service node, the second node is the user node, the intermediate node is the network node (e.g., a base station on the RAN side), and the target node (e.g., a control node) is on the network node (e.g., the target node is a BS), file preprocessing is performed on the network node, and file inverse processing is performed on the user node (i.e., the above). Figure 8 The downlink scenario 1 shown describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 18 As shown, it includes an input data stage (steps 1803-1806), a decision transmission stage (steps 1808-1810), and a processing execution stage (steps 1811-1815), including the following steps:

[0903] Step 1801: The user node establishes a session with the service node.

[0904] It should be noted that the process of establishing a session between a user node and a service node can be referred to the description of step 1501 above, and will not be repeated here.

[0905] Step 1802: The network node performs task identification, and the algorithm is started.

[0906] It should be noted that the process of task identification and algorithm startup for network nodes can be referred to the description of step 1502 above, and will not be repeated here.

[0907] Step 1803: The network node sends a transmission request message to the user node.

[0908] Step 1804: The network node sends a transmission request message to the service node.

[0909] It should be noted that the process of a network node sending transmission request information to a user node / service node can be referred to the descriptions of steps 1503 and 1504 above, and will not be repeated here.

[0910] In some embodiments, since file preprocessing is performed on the network node, the preprocessing capability information referenced for the transmission strategy is provided by the network node itself, rather than by the service node. Therefore, if the network node can avoid receiving transmission task information from the service node, it does not need to send transmission request information to the service node.

[0911] Step 1805: The user node sends the first status information to the network node.

[0912] Step 1806: The service node sends the second status information to the network node.

[0913] The signaling name between the second status information sent by the service node and the first status information sent by the user node can be different.

[0914] It should be noted that there is no dependency between steps 1805 and 1806, and their order can be changed.

[0915] Step 1807: The network node determines the transmission strategy for the target file.

[0916] It should be noted that the process of network nodes determining the transmission strategy of target files can be referred to the description of step 1507 above, and will not be repeated here.

[0917] Step 1808: The network node sends the target transmission strategy to the user node.

[0918] Step 1809: The user node sends the first verification information to the network node.

[0919] Step 1810: The network node sends the first confirmation message to the user node.

[0920] In some embodiments of this disclosure, steps 1809 and 1810 are the process of handshaking and confirming between the network node and the user node. The network node may or may not use handshaking confirmation with the user node.

[0921] In other words, steps 1809 and 1810 are optional steps in the decision transmission phase.

[0922] Step 1811: The network node allocates transmission resources to the service node.

[0923] Among them, the transmission resources allocated by the network node to the service node can be the target transmission resources in the target transmission strategy.

[0924] Step 1812: The service node and the network node transfer files.

[0925] As some embodiments of this disclosure, the service node may send unprocessed target files to the network node.

[0926] Step 1813: Network nodes perform file preprocessing.

[0927] In this process, network nodes can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[0928] Step 1814: The network node and the user node transfer files.

[0929] In some embodiments of this disclosure, a network node may send a preprocessed target file to a user node, and the header of the preprocessed target file carries file preprocessing information and / or file inverse processing information.

[0930] Step 1815: The user node performs reverse file processing on the received preprocessed target file.

[0931] It should be noted that the process of user nodes performing reverse processing on the received preprocessed target file can be referred to the description of step 1514 above, and will not be repeated here.

[0932] In some embodiments of this disclosure, the service function (such as a large model) at the destination of the target file transmission (i.e., the user node) can handle the encoding format of the preprocessed target file. In this case, the user node does not need to execute step 1815 and can directly perform calculation processing on the preprocessed target file based on the service function (such as inputting media files into the AI ​​model).

[0933] Example 5: Using a scenario where the first node is the service node, the second node is the user node, the intermediate node is the network node (e.g., a base station on the RAN side), and the target node (e.g., a control node) is on the network node (e.g., the target node is a BS), file preprocessing is performed on the service node, and file inverse processing is performed on the user node (i.e., the above). Figure 8 The downlink scenario 2 shown below describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 19 As shown, it includes an input data stage (steps 1903-1906), a decision transmission stage (steps 1908-1913), and a processing execution stage (steps 1914-1917), including the following steps:

[0934] Step 1901: The user node establishes a session with the service node.

[0935] It should be noted that the process of establishing a session between a user node and a service node can be referred to the description of step 1501 above, and will not be repeated here.

[0936] Step 1902: The network node performs task identification, and the algorithm is started.

[0937] It should be noted that the process of task identification and algorithm startup for network nodes can be referred to the description of step 1502 above, and will not be repeated here.

[0938] Step 1903: The network node sends a transmission request message to the user node.

[0939] Step 1904: The network node sends a transmission request message to the service node.

[0940] It should be noted that the process of a network node sending transmission request information to a user node / service node can be referred to the descriptions of steps 1503 and 1504 above, and will not be repeated here.

[0941] Step 1905: The user node sends the first status information to the network node.

[0942] Step 1906: The service node sends the second status information to the network node.

[0943] The signaling name between the second status information sent by the service node and the first status information sent by the user node can be different.

[0944] It should be noted that there is no dependency between steps 1905 and 1906, and their order can be changed.

[0945] Step 1907: The network node determines the transmission strategy for the target file.

[0946] It should be noted that the process of network nodes determining the transmission strategy of target files can be referred to the description of step 1507 above, and will not be repeated here.

[0947] Step 1908: The network node sends the target transmission policy to the user node.

[0948] Step 1909: The network node sends the target transmission strategy to the service node.

[0949] The target transmission policy sent by the network node to the user node and the target transmission policy sent by the network node to the service node can have different formats and signaling names.

[0950] It should be noted that the order of steps 1908 and 1909 is not limited in this embodiment. For example, the network node may execute step 1908 first, and then execute step 1909. Alternatively, the network node may execute step 1909 first, and then execute step 1908. Yet another example is that the network node may execute steps 1908 and 1909 simultaneously.

[0951] In some embodiments, if the user node adds the file inverse processing information of the transmission policy to the file header during the file preprocessing operation based on the transmission policy, the network node does not need to send the target transmission policy to the service node. Subsequently, the service node can obtain the file inverse processing information from the file header sent by the user node and then perform the file inverse processing operation.

[0952] In other words, step 1909 is an optional step in the decision transmission phase, meaning that step 1909 can be omitted in the decision transmission phase, and network nodes can skip step 1909 after executing step 1908.

[0953] The following describes the transmission management method provided in this application embodiment, taking the decision transmission stage, including step 1909, as an example, where the network node sends the target transmission strategy to the service node.

[0954] Step 1910: The user node sends the first verification information to the network node.

[0955] Step 1911: The service node sends the second verification information to the network node.

[0956] The format and signaling name of the first authentication information sent by the user node to the network node and the second authentication information sent by the service node to the network node can be different.

[0957] It should be noted that there is no dependency between steps 1910 and 1911, and their order can be changed.

[0958] Step 1912: The network node sends the first confirmation message to the user node.

[0959] Step 1913: The network node sends a second confirmation message to the service node.

[0960] It should be noted that the process of a network node sending the first confirmation message to a user node and a network node sending the second confirmation message to a service node can be referred to the descriptions of steps 1612 and 1613 above, and will not be repeated here.

[0961] Step 1914: Service node performs file preprocessing.

[0962] In this process, the service node can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[0963] Step 1915: The network node allocates transmission resources to the service node.

[0964] The transmission resources allocated by the network node to the service node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[0965] It should be noted that there is no dependency between steps 1914 and 1915, and their order can be changed.

[0966] Step 1916: The service node transfers files with the user node through the network node.

[0967] In some embodiments of this disclosure, the service node can send the preprocessed target file to the user node through the forwarding function of the network node, and the header of the preprocessed target file carries file preprocessing information and / or file reverse processing information.

[0968] Step 1917: The user node performs reverse file processing on the received preprocessed target file.

[0969] It should be noted that the process of user nodes performing reverse processing on the received preprocessed target file can be referred to the description of step 1815 above, and will not be repeated here.

[0970] Example 6: Using a scenario where the first node is the service node, the second node is the user node, the intermediate node is the network node (e.g., a base station on the RAN side), and the target node (e.g., the control node) is on the service node, file preprocessing is performed on the service node, and file inverse processing is performed on the user node (i.e., the above). Figure 8The downlink scenario 3 shown describes the initialization scenario when a user node and a service node establish a task connection for the first time. For example... Figure 20 As shown, the process includes an input data stage (steps 2003-2006), a decision transmission stage (steps 2008-2013), and a processing execution stage (steps 2014-2017), and includes the following steps:

[0971] Step 2001: The user node and the service node establish a session.

[0972] It should be noted that the process of establishing a session between a user node and a service node can be referred to the description of step 1501 above, and will not be repeated here.

[0973] Step 2002: The service node identifies the task and the algorithm starts.

[0974] It should be noted that the process of task identification and algorithm startup for service nodes can be referred to the description of step 1502 above, and will not be repeated here.

[0975] Step 2003: The service node sends a transmission request message to the user node.

[0976] Step 2004: The service node sends a transmission request message to the network node.

[0977] It should be noted that the process of the service node sending transmission request information to the user node / network node can be referred to the description of steps 1703 and 1704 above, and will not be repeated here.

[0978] Step 2005: The user node sends the second status information to the service node.

[0979] Step 2006: The network node sends third status information to the service node.

[0980] The signaling names between the third status information sent by the network node and the second status information sent by the user node can be different.

[0981] It should be noted that there is no dependency between steps 2005 and 2006, and their order can be changed.

[0982] Step 2007: The service node determines the transmission strategy for the target file.

[0983] In some embodiments, the service node can determine the transmission strategy for the target file based on the second state information, the third state information, and the service node's own first state information. In actual implementation, various decision-making methods such as algorithms, AI models, and table lookups can be used.

[0984] It should be noted that the inputs and outputs of the service node in determining the transmission strategy of the target file can be referred to the description of step 1507 above, and will not be repeated here.

[0985] Step 2008: The service node sends the target transmission policy to the user node.

[0986] Step 2009: The service node sends the target transmission policy to the network node.

[0987] The target transmission policy sent by the service node to the user node and the target transmission policy sent by the service node to the network node can have different formats and signaling names.

[0988] It should be noted that the order of steps 2008 and 2009 is not limited in this embodiment. For example, the service node may execute step 2008 first, and then execute step 2009. Alternatively, the service node may execute step 2009 first, and then execute step 2008. Or, the service node may execute steps 2008 and 2009 simultaneously.

[0989] Step 2010: The user node sends the second verification information to the service node.

[0990] Step 2011: The network node sends the third verification information to the service node.

[0991] The format and signaling name of the second authentication information sent by the user node to the service node and the third authentication information sent by the network node to the service node can be different.

[0992] It should be noted that there is no dependency between steps 2010 and 2011, and their order can be changed.

[0993] Step 2012: The service node sends a second confirmation message to the user node.

[0994] Step 2013: The service node sends a third confirmation message to the network node.

[0995] The format and signaling name of the second confirmation message sent by the service node to the user node and the third confirmation message sent by the service node to the network node can be different.

[0996] It should be noted that the order of steps 2012 and 2013 is not limited in this embodiment. For example, the service node may execute step 2012 first, and then execute step 2013. Alternatively, the service node may execute step 2013 first, and then execute step 2012. Or, the service node may execute steps 2012 and 2013 simultaneously.

[0997] In some embodiments of this disclosure, steps 2010 and 2012 are the process of handshaking confirmation between the service node and the user node, and steps 2011 and 2013 are the process of handshaking confirmation between the service node and the network node. The service node may use handshaking confirmation on both the user node and the network node, or not use it, or only use it on one of the user node or the network node.

[0998] In other words, steps 2010 and 2012, and steps 2011 and 2013 are optional steps in the decision transmission phase.

[0999] Step 2014: Service node performs file preprocessing.

[1000] In this process, user nodes can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing of the target file.

[1001] Step 2015: The network node allocates transmission resources to the service node.

[1002] The transmission resources allocated by the network node to the service node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[1003] It should be noted that there is no dependency between steps 2014 and 2015, and their order can be changed.

[1004] Step 2016: The service node transfers files with the user node through the network node.

[1005] In some embodiments of this disclosure, the service node can send the preprocessed target file to the user node through the forwarding function of the network node, and the header of the preprocessed target file carries file preprocessing information and / or file reverse processing information.

[1006] Step 2017: The user node performs reverse file processing on the received preprocessed target file.

[1007] It should be noted that the process of user nodes performing reverse processing on the received preprocessed target file can be referred to the description of step 1815 above, and will not be repeated here.

[1008] In some embodiments, the target node can perform signaling interactions for determining the transmission policy within an ORAN architecture or in a CU-DU separated architecture. In the case where the intermediate node is a base station in a RAN architecture, the target node can be a CU within the intermediate node.

[1009] It should be noted that this application does not limit the deployment mode or architectural level of the service nodes on the RAN side. For example, the service nodes are at the same level as the CU / DU, and the computing resources are maintained in real time by the CU.

[1010] Furthermore, this application does not limit the mapping relationship between CUs and service nodes. For example, the relationship between CUs and service nodes can be one-to-one. Another example is a one-to-many relationship between CUs and service nodes. Yet another example is a many-to-many relationship between CUs and service nodes.

[1011] For example, taking a base station with an ORAN architecture as the intermediate node, and the target node (such as a control node) on the base station's CU, with the base station's DU responsible for transmission resource allocation, this paper introduces the initialization scenario when the first node and the second node establish a task connection for the first time. Figure 21 As shown, it includes an input data stage (steps 2103-2106), a decision transmission stage (steps 2108-2113), and a processing execution stage (steps 2114-2117), including the following steps:

[1012] Step 2101: The first node establishes a session with the second node.

[1013] It should be noted that the process of establishing a session between the first node and the second node can be referred to the description of step 1501 above, and will not be repeated here.

[1014] Step 2102: CU performs task identification and the algorithm is started.

[1015] It should be noted that the process of starting the algorithm for task recognition by CU can be referred to the description of step 1502 above, and will not be repeated here.

[1016] Step 2103: The CU sends a transmission request message to the first node.

[1017] Step 2104: The CU sends a transmission request message to the second node.

[1018] It should be noted that the process of the CU sending transmission request information to the user node / service node can be referred to the description of steps 1503 and 1504 above, and will not be repeated here.

[1019] Step 2105: The first node sends the first status information to the CU.

[1020] Step 2106: The second node sends the second status information to the CU.

[1021] The signaling name between the second status information sent by the second node and the first status information sent by the first node can be different.

[1022] It should be noted that there is no dependency between steps 2105 and 2106, and their order can be changed.

[1023] Step 2107: CU determines the transfer strategy for the target file.

[1024] It should be noted that the process of CU determining the transmission strategy of the target file can be referred to the description of step 1507 above, and will not be repeated here.

[1025] Step 2108: The CU sends the target transmission strategy to the first node.

[1026] Step 2109: The CU sends the target transmission strategy to the second node.

[1027] The target transmission policy sent by the CU to the first node and the target transmission policy sent by the CU to the second node can have different formats and signaling names.

[1028] It should be noted that the order of steps 2108 and 2109 is not limited in this embodiment. For example, the CU may execute step 2108 first, and then execute step 2109. Alternatively, the CU may execute step 2109 first, and then execute step 2108. Or, the CU may execute steps 2108 and 2109 simultaneously.

[1029] In some embodiments, if the first node adds the file inverse processing information of the transmission policy to the file header during the file preprocessing operation based on the transmission policy, the CU does not need to send the target transmission policy to the second node. Subsequently, the second node can obtain the file inverse processing information from the file header sent by the first node and then perform the file inverse processing operation.

[1030] In other words, step 2109 is an optional step in the decision transmission stage. That is, step 2109 can be omitted in the decision transmission stage, and the CU can skip step 2109 after executing step 2108.

[1031] The following describes the transmission management method provided in this application embodiment, taking the decision transmission stage, including step 2109, as an example, where the CU sends the target transmission strategy to the second node.

[1032] Step 2110: The first node sends the first verification information to the CU.

[1033] Step 2111: The second node sends the second verification information to the CU.

[1034] The format and signaling name of the first authentication information sent by the first node to the CU and the second authentication information sent by the second node to the CU can be different.

[1035] It should be noted that there is no dependency between steps 2110 and 2111, and their order can be changed.

[1036] Step 2112: The CU sends the first confirmation message to the first node.

[1037] Step 2113: CU sends a second confirmation message to the second node.

[1038] It should be noted that the process of the CU sending the first confirmation information to the first node and the CU sending the second confirmation information to the second node can be referred to the description of steps 1612 and 1613 above, and will not be repeated here.

[1039] Step 2114: The first node performs file preprocessing.

[1040] The first node can add file preprocessing information and / or file inverse processing information from the target transmission strategy to the header during the file preprocessing process of the target file.

[1041] Step 2115: DU allocates transmission resources to the first node.

[1042] Among them, the transmission resources allocated by DU to the first node can be the target transmission resources in the target transmission strategy, or the target transmission resources obtained by querying the mapping table corresponding to the target file through the file preprocessing information and / or file inverse processing information carried in the data transmission packet header.

[1043] It should be noted that there is no dependency between steps 2114 and 2115, and their order can be changed.

[1044] Step 2116: The first node transfers files with the second node through the network node.

[1045] In some embodiments of this disclosure, the first node can upload the preprocessed target file to the second node through the forwarding function of the network node, and the header of the preprocessed target file carries file preprocessing information and / or file reverse processing information.

[1046] Step 2117: The second node performs reverse file processing on the received preprocessed target file.

[1047] It should be noted that the process of the service node performing reverse processing on the received preprocessed target file can be referred to the description of step 1514 above, and will not be repeated here.

[1048] In summary, this is an introduction to an embodiment of determining the transmission strategy during the transmission management process. The following section, in conjunction with the above... Figure 8 The uplink and downlink scenarios shown in this application describe the scenarios in which file transfer or task connection has been established and the transfer strategy is updated during the transfer process, including Examples 7-12.

[1049] Example 7: Taking a policy update initiated by an intermediate node when the target node (e.g., the control node) is on an intermediate node as an example, such as... Figure 22 As shown, it includes the following steps:

[1050] Step 2201: The first node and the second node are connected, and the target file between the first node and the second node has started to be transferred.

[1051] Step 2202: The first node periodically sends the first status information to the intermediate node.

[1052] The first node can send first status information or part of the first status information to the intermediate node based on the first transmission cycle.

[1053] Step 2203: The second node periodically sends the second status information to the intermediate node.

[1054] The second node can send second status information or part of the second status information to the intermediate node based on the second sending cycle.

[1055] Step 2204: Start the strategy update for intermediate nodes.

[1056] In some embodiments of this disclosure, the intermediate node can detect changes in its own third state information in real time, and when the information difference before and after the change in the third state information meets the third condition, it can initiate a strategy update, redetermine the transmission strategy of the target file, and obtain the first transmission strategy.

[1057] It should be noted that if the intermediate node uses its own third state information as the incentive reference for policy update, then steps 2202 and 2203 are optional steps. That is, the first node and / or the second node do not need to periodically send their own state information to the intermediate node, and the intermediate node can execute step 2204 based on its own third state information.

[1058] In some other embodiments of this disclosure, the intermediate node can initiate a policy update at each preset time in a preset period, and redetermine the transmission policy of the target file based on the first state information of the first node at the preset time, the second state information of the second node at the preset time, and the third state information of the intermediate node at the preset time, to obtain the first transmission policy.

[1059] It should be noted that the preset period for intermediate nodes to initiate policy updates may be the same as or different from the first and second sending periods in steps 2202 and 2203.

[1060] In cases where the preset period for the intermediate node to initiate policy updates is different from the first sending period, the intermediate node can obtain the first node's first state information (i.e., the updated first state information) at the preset time by sending a transmission request message to the first node at the preset time.

[1061] Similarly, if the preset period for the intermediate node to initiate policy updates is different from the second sending period, the intermediate node can obtain the second state information (i.e., the updated second state information) of the second node at the preset time by sending a transmission request information to the second node at the preset time.

[1062] In some embodiments, after re-determining the first transmission strategy, the intermediate node may determine whether the first transmission strategy has changed compared to the target transmission strategy.

[1063] If an intermediate node determines that the first transmission strategy has not changed compared to the target transmission strategy, then the intermediate node does not need to send the first transmission strategy to the first node and / or the second node.

[1064] If an intermediate node determines that the first transmission strategy has changed compared to the target transmission strategy, the intermediate node needs to send the first transmission strategy to the first node and / or the second node.

[1065] It should be noted that, in conjunction with the above... Figure 8 In the uplink and downlink scenarios shown, in uplink scenario 1, uplink scenario 2 and downlink scenario 2, if the intermediate node determines that the first transmission strategy has changed compared to the target transmission strategy, the intermediate node needs to send the first transmission strategy to the first node and the second node.

[1066] In downlink scenario 1, if an intermediate node determines that the first transmission strategy has changed compared to the target transmission strategy, the intermediate node needs to send the first transmission strategy to the target node.

[1067] Example 8: Taking a policy update initiated by the first node when the target node (e.g., the control node) is on an intermediate node as an example, such as... Figure 23 As shown, it includes the following steps:

[1068] Step 2301: The first node and the second node are connected, and the target file between the first node and the second node has started to be transferred.

[1069] Step 2302: The first node periodically sends the first status information to the intermediate node.

[1070] The first node can send first status information or part of the first status information to the intermediate node based on the first transmission cycle.

[1071] Step 2303: The second node periodically sends the second status information to the intermediate node.

[1072] The second node can send second status information or part of the second status information to the intermediate node based on the second sending cycle.

[1073] Step 2304: The first node sends the updated first status information to the intermediate node.

[1074] In some embodiments of this disclosure, the first node can detect changes in its own first state information in real time, and when the first state information changes, it sends the updated first state information (i.e. the changed first state information) to the intermediate node to instruct the intermediate node to start a policy update.

[1075] It should be noted that if the first state information of the first node changes at the transmission time in the first transmission cycle, the first node can send the updated first state information to the intermediate node based on the first transmission cycle.

[1076] If the first state information of the first node changes at a time other than the transmission time in the first transmission period, the first node may send the updated first state information to the intermediate node based on the time when the state changes, instead of based on the first transmission period.

[1077] In other words, step 2302 is an optional step, meaning that the first node can send the first state information to the intermediate node when the state changes.

[1078] Step 2305: The intermediate node sends the fourth verification message to the first node.

[1079] The fourth verification information is used to verify the status information received by the intermediate node. The fourth verification information may include all or part of the information in the updated first status information received by the intermediate node.

[1080] In some embodiments, if the status information in the fourth verification information does not match the updated first status information, the first node may resend the updated first status information to the intermediate node until the intermediate node receives the accurate and complete updated first status information.

[1081] In some embodiments, the first node may perform the following step 2306 if the status information in the fourth verification information matches the updated first status information.

[1082] Step 2306: The first node sends the fourth confirmation message to the intermediate node.

[1083] The fourth confirmation information is used to indicate that the updated first status information received by the intermediate node has been verified, and the fourth confirmation information may include all or part of the information in the updated first status information.

[1084] It should be noted that steps 2305 and 2306 are the process of handshaking and confirming between the intermediate node and the first node. The intermediate node may or may not use handshaking confirmation with the first node.

[1085] Step 2307: Start policy update at intermediate nodes.

[1086] In some embodiments of this disclosure, intermediate nodes may redetermine the transmission strategy of the target file based on the updated first state information to obtain a first transmission strategy.

[1087] It should be noted that the process of the intermediate node distributing and managing the first transmission policy after obtaining it can be referred to the description in step 2204 above, and will not be repeated here.

[1088] Example 9: Taking a policy update initiated by a second node when the target node (e.g., the control node) is on an intermediate node as an example, such as... Figure 24 As shown, it includes the following steps:

[1089] Step 2401: The first node and the second node are connected, and the target file between the first node and the second node has started to be transferred.

[1090] Step 2402: The first node periodically sends the first status information to the intermediate node.

[1091] The first node can send first status information or part of the first status information to the intermediate node based on the first transmission cycle.

[1092] Step 2403: The second node periodically sends the second status information to the intermediate node.

[1093] The second node can send second status information or part of the second status information to the intermediate node based on the second sending cycle.

[1094] Step 2404: The second node sends the updated second status information to the intermediate node.

[1095] It should be noted that the process of the second node sending the updated second state information to the intermediate node can be referred to the description of step 2304 above, and will not be repeated here.

[1096] Step 2405: The intermediate node sends the fifth verification message to the second node.

[1097] The fifth verification information is used to verify the status information received by the intermediate node. The fifth verification information may include all or part of the information in the updated second status information received by the intermediate node.

[1098] Step 2406: The second node sends the fifth confirmation message to the intermediate node.

[1099] The fifth confirmation information is used to indicate that the updated second status information received by the intermediate node has been verified, and the fifth confirmation information may include all or part of the information in the updated second status information.

[1100] It should be noted that the process of the intermediate node sending the fifth verification information to the second node, and the process of the second node sending the fifth confirmation information to the intermediate node, can be referred to the descriptions of steps 2305 and 2306 above, and will not be repeated here.

[1101] Step 2407: Start the strategy update for intermediate nodes.

[1102] It should be noted that the process of enabling policy updates at intermediate nodes can be referred to in step 2307 above, and will not be repeated here.

[1103] Example 10: Taking a policy update initiated by a service node with the first node as the user node and the second node as the service node (or vice versa), and the target node (e.g., the control node) on the service node, as an example. Figure 25 As shown, it includes the following steps:

[1104] Step 2501: The user node and the service node are connected, and the target file between the user node and the service node has started to be transferred.

[1105] Step 2502: The user node periodically sends the first status information to the service node.

[1106] In this context, the user node can send the first status information or part of the first status information to the service node based on the first sending cycle.

[1107] Step 2503: The intermediate node periodically sends third status information to the service node.

[1108] The intermediate node can send third status information or part of the third status information to the service node based on the third sending cycle.

[1109] Step 2504: Service node enable policy update.

[1110] It should be noted that the process of enabling policy updates for service nodes can be referred to the description in step 2204 above, and will not be repeated here.

[1111] Example 11: Taking a policy update initiated by a user node as an example, with the first node being a user node and the second node being a service node (or the first node being a service node and the second node being a user node), and the target node (such as the control node) being on the service node. Figure 26 As shown, it includes the following steps:

[1112] Step 2601: The user node and the service node are connected, and the target file between the user node and the service node has started to be transferred.

[1113] Step 2602: User nodes periodically send first status information to service nodes.

[1114] In this context, the user node can send the first status information or part of the first status information to the service node based on the first sending cycle.

[1115] Step 2603: The intermediate node periodically sends third status information to the service node.

[1116] The intermediate node can send third status information or part of the third status information to the service node based on the third sending cycle.

[1117] Step 2604: The user node sends the updated first status information to the service node.

[1118] It should be noted that the process of the user node sending the updated first status information to the service node can be referred to the description of step 2304 above, and will not be repeated here.

[1119] Step 2605: The service node sends the sixth verification message to the user node.

[1120] The sixth verification information is used to verify the status information received by the service node. The sixth verification information may include all or part of the information in the updated first status information received by the service node.

[1121] Step 2606: The user node sends the sixth confirmation message to the service node.

[1122] The sixth confirmation message is used to indicate that the updated first status information received by the service node has been verified successfully, and the sixth confirmation message may include all or part of the information in the updated first status information. It should be noted that the process of the service node sending the sixth verification message to the user node, and the process of the user node sending the sixth confirmation message to the service node, can be referred to the descriptions of steps 2305 and 2306 above, and will not be repeated here.

[1123] Step 2607: Service node enable policy update.

[1124] It should be noted that the process of enabling policy updates for service nodes can be referred to the description in step 2307 above, and will not be repeated here.

[1125] Example 12: Taking a policy update initiated by an intermediate node as an example, where the first node is a user node, the second node is a service node (or the first node is a service node and the second node is a user node), the target node (such as the control node) is on the service node, and the intermediate node is the user node. Figure 27 As shown, it includes the following steps:

[1126] Step 2701: The user node and the service node are connected, and the target file between the user node and the service node has started to be transferred.

[1127] Step 2702: User nodes periodically send first status information to service nodes.

[1128] In this context, the user node can send the first status information or part of the first status information to the service node based on the first sending cycle.

[1129] Step 2703: The intermediate node periodically sends third status information to the service node.

[1130] The intermediate node can send third status information or part of the third status information to the service node based on the third sending cycle.

[1131] Step 2704: The intermediate node sends the updated third status information to the service node.

[1132] It should be noted that the process of the intermediate node sending the updated third state information to the service node can be referred to the description of step 2304 above, and will not be repeated here.

[1133] Step 2705: The service node sends the seventh verification message to the intermediate node.

[1134] The seventh verification information is used to verify the status information received by the service node. The seventh verification information may include all or part of the information in the updated third status information received by the service node.

[1135] Step 2706: The intermediate node sends the seventh confirmation message to the service node.

[1136] The seventh confirmation information is used to indicate that the updated third status information received by the service node has been verified, and the seventh confirmation information may include all or part of the information in the updated third status information.

[1137] It should be noted that the process of the service node sending the seventh verification information to the intermediate node, and the process of the intermediate node sending the seventh confirmation information to the service node, can be referred to the descriptions of steps 2305 and 2306 above, and will not be repeated here.

[1138] Step 2707: Service node starts policy update.

[1139] It should be noted that the process of enabling policy updates for service nodes can be referred to the description in step 2307 above, and will not be repeated here.

[1140] The method provided in this application has been described above. In addition, this application also provides a communication device for implementing the functions described in the above method embodiments.

[1141] It is understood that the target node, first node, second node, and intermediate node in the above embodiments, in order to achieve the above functions, include hardware structures and / or software modules corresponding to the execution of each function, such as communication devices. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[1142] This application embodiment can divide the communication device into functional modules according to the above method embodiment. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[1143] Figure 28A schematic diagram of a communication device 2800 is shown. The communication device 2800 includes a transceiver module 2801 and a processing module 2802. This communication device 2800 can be used to implement the functions of the aforementioned target node.

[1144] In some embodiments, the communication device 2800 may further include a storage module. Figure 28 (Not shown in the image) is used to store program instructions and data.

[1145] In some embodiments, the transceiver module 2801, also referred to as a transceiver unit, is used to implement sending and / or receiving functions. The transceiver module 2801 may consist of a transceiver circuit, a transceiver, a transceiver unit, or a communication interface.

[1146] In some embodiments, the transceiver module 2801 may include a receiving module and a sending module, respectively configured to perform the receiving and sending steps in the above method embodiments, and / or other processes to support the technology described herein; the processing module 2802 may be configured to perform the processing steps in the above method embodiments, and / or other processes to support the technology described herein.

[1147] The transceiver module 2801 is used to acquire the first status information of the first node, the second status information of the second node, and the third status information of the intermediate node between the first node and the second node; the processing module 2802 is used to determine the target transmission strategy of the target file sent by the first node to the second node based on at least one of the first status information, the second status information, and the third status information. The target transmission strategy includes: file preprocessing information, file inverse processing information, and target transmission resources.

[1148] In one possible design, the first node, the second node, and the intermediate node satisfy at least one of the following:

[1149] The first node performs file preprocessing, and the second node performs file reverse processing.

[1150] The first node performs file preprocessing, and the intermediate nodes perform file reverse processing.

[1151] The intermediate node performs file preprocessing, and the second node performs file reverse processing.

[1152] In one possible design, the first node performs file preprocessing, and the second node performs file inverse processing; the first status information includes the preprocessing capability information of the first node performing file preprocessing and / or the transmission task information of the target file;

[1153] The second status information includes the reverse processing capability information of the second node to perform file reverse processing and / or the service status information of the second node;

[1154] The third state information includes the air interface state information between the first node and the second node.

[1155] In one possible design, the first node performs file preprocessing, and the intermediate nodes perform file inverse processing; the first state information includes the preprocessing capability information of the first node performing file preprocessing and the transmission task information of the target file;

[1156] The second status information includes the service status information of the second node;

[1157] The third state information includes the air interface state information between the first node and the second node and / or the reverse processing capability information of the intermediate node to perform file reverse processing.

[1158] In one possible design, the intermediate node performs file preprocessing, and the second node performs file inverse processing; the first state information includes the target file's transmission task information.

[1159] The second status information includes the reverse processing capability information of the second node to perform file reverse processing and / or the service status information of the second node;

[1160] The third state information includes the air interface state information between the first node and the second node and / or the preprocessing capability information of the intermediate node for performing file preprocessing.

[1161] In one possible design, file preprocessing is used to reduce the file size, and file inverse processing is used to restore or partially restore the file to its state before file preprocessing.

[1162] In one possible design, the preprocessing capability information includes at least one of the following:

[1163] The identifier of at least one preprocessing model and / or algorithm;

[1164] At least one adjustable parameter index for the preprocessing model and / or algorithm;

[1165] The correlation between parameter tuning and preprocessing time for at least one preprocessing model and / or algorithm;

[1166] At least one preprocessing model and / or algorithm, each preprocessing model and / or algorithm has a corresponding inverse processing model and / or algorithm;

[1167] Queuing status of preprocessing tasks;

[1168] Available computing resources for preprocessing;

[1169] Estimated preprocessing time for the target file.

[1170] In one possible design, the inverse processing capability information includes at least one of the following:

[1171] The identifier of at least one inverse processing model and / or algorithm;

[1172] At least one adjustable parameter index for the inverse processing model and / or algorithm;

[1173] The correlation between parameter tuning and inverse processing time for at least one inverse processing model and / or algorithm;

[1174] At least one inverse processing model and / or algorithm, each inverse processing model and / or algorithm corresponding to a preprocessing model and / or algorithm;

[1175] Reverse the queuing state of processing tasks;

[1176] Available computing resources for inverse processing;

[1177] The estimated time for reverse processing of the target file.

[1178] In one possible design, the air interface status information includes at least one of the following:

[1179] Signal-to-noise ratio;

[1180] Signal reference point;

[1181] Spectral efficiency;

[1182] Channel quality metrics;

[1183] Transmission resources pre-allocated for different transmission tasks;

[1184] Rules for allocating transmission resources for different transmission tasks.

[1185] In one possible design, the transmitted task information includes at least one of the following:

[1186] File size;

[1187] Buffer size;

[1188] File format;

[1189] Color channels of media files;

[1190] File characteristics;

[1191] The time window for file transfer;

[1192] The first node prioritizes the transmission of the target file.

[1193] In one possible design, the service status information includes at least one of the following:

[1194] The queuing status of the service tasks in which the target file participates;

[1195] The priority of the service tasks in which the target file participates;

[1196] The impact of preprocessing / reverse processing on the quality of service in service tasks involving the target file;

[1197] Priority for responding to requests from the first node.

[1198] In one possible design, the target transport resource includes at least one of the following:

[1199] Time and frequency resources;

[1200] Channel resources.

[1201] In one possible design, the file preprocessing information includes at least one of the following:

[1202] A task identifier used to indicate whether the file preprocessing should be performed;

[1203] Processing rules used to instruct the execution of the file preprocessing;

[1204] The first information of the target preprocessing model and / or algorithm;

[1205] The input parameters required by the target preprocessing model and / or algorithm.

[1206] In one possible design, the processing rules include performing file preprocessing when the target file reaches a target size threshold. In another possible design, the first information includes at least one of the following:

[1207] Name information of the target preprocessing model and / or algorithm;

[1208] Accuracy information of the target preprocessing model and / or algorithm;

[1209] Version information of the target preprocessing model and / or algorithm;

[1210] Hardware information used for target preprocessing model and / or algorithm execution.

[1211] In one possible design, the input parameters required by the target preprocessing model and / or algorithm include at least one of the following:

[1212] Target compression ratio;

[1213] Target compression quality;

[1214] Target service quality requirements.

[1215] In one possible design, the file inverse processing information includes at least one of the following:

[1216] The second information of the target inverse processing model and / or algorithm;

[1217] The input parameters required for the target inverse processing model and / or algorithm.

[1218] In one possible design, the second information includes at least one of the following:

[1219] Name information of the target inverse processing model and / or algorithm;

[1220] Accuracy information of the target inverse processing model and / or algorithm;

[1221] Version information of the target inverse processing model and / or algorithm;

[1222] Hardware information used for the execution of the target inverse processing model and / or algorithm.

[1223] In one possible design, the input parameters required by the target inverse processing model and / or algorithm include at least one of the following:

[1224] Target decompression quality;

[1225] Target hardware requirements.

[1226] In one possible design, the header of the preprocessed target file carries at least one of the following:

[1227] File preprocessing information;

[1228] Partial information from file preprocessing information;

[1229] Reverse processing information of files;

[1230] Partial information from the file reverse processing information.

[1231] In one possible design, the transceiver module 2801 is also used for at least one of the following:

[1232] Send a transmission request message to the first node;

[1233] Send a transmission request message to the second node;

[1234] Send a transmission request message to the intermediate node.

[1235] In one possible design, the transmission request information includes at least one of the following:

[1236] An identifier used to determine the transmission strategy of the target file;

[1237] Service quality requirements information for the target file.

[1238] In one possible design, the transceiver module 2801 is also used for at least one of the following:

[1239] Receive the first status information sent by the first node;

[1240] Receive the second status information sent by the second node;

[1241] Receive the third status information sent by the intermediate node.

[1242] In one possible design, the transceiver module 2801 is also used for at least one of the following:

[1243] Send the target transmission strategy to the first node;

[1244] Send the target transmission strategy to the second node;

[1245] Send the target transmission strategy to the intermediate node.

[1246] In one possible design, the transceiver module 2801 is also used for at least one of the following:

[1247] Receive the first verification information sent by the first node. The first verification information is used to verify the transmission strategy received by the first node.

[1248] Receive the second verification information sent by the second node. The second verification information is used to verify the transmission strategy received by the second node.

[1249] Receive the third verification information sent by the intermediate node. The third verification information is used to verify the transmission strategy received by the intermediate node.

[1250] In one possible design, the transceiver module 2801 is also used for at least one of the following:

[1251] If the transmission strategy in the first verification information matches the target transmission strategy, a first confirmation message is sent to the first node.

[1252] If the transmission strategy in the second verification information matches the target transmission strategy, a second confirmation message is sent to the second node.

[1253] If the transmission strategy in the third verification message matches the target transmission strategy, a third confirmation message is sent to the intermediate node.

[1254] In one possible design, the transceiver module 2801 is further configured to receive the updated first status information sent by the first node; the processing module 2802 is further configured to redetermine the transmission strategy of the target file when the updated first status information and the first status information satisfy the first condition.

[1255] In one possible design, the first condition includes at least one of the following:

[1256] The information difference between the updated first state information and the first state information is greater than the first information difference threshold;

[1257] The transmission time interval between the updated first status information and the first status information is greater than the first time difference threshold;

[1258] The first parameter information is greater than the first parameter threshold. The first parameter information consists of the information difference between the updated first state information and the first state information, and the transmission time interval.

[1259] In one possible design, the transceiver module 2801 is further configured to receive the updated second status information sent by the second node; the processing module 2802 is further configured to redetermine the transmission strategy of the target file when the updated second status information and the second status information satisfy the second condition.

[1260] In one possible design, the second condition includes at least one of the following:

[1261] The information difference between the updated second state information and the second state information is greater than the second information difference threshold;

[1262] The transmission time interval between the updated second status information and the second status information is greater than the second time difference threshold;

[1263] The second parameter information is greater than the second parameter threshold. The second parameter information consists of the information difference between the updated second state information and the second state information, and the transmission time interval.

[1264] In one possible design, the transceiver module 2801 is also used to receive the updated third status information sent by the intermediate node; the processing module 2802 is also used to redetermine the transmission strategy of the target file when the updated third status information and the third status information satisfy the third condition.

[1265] In one possible design, the third condition includes at least one of the following:

[1266] The information difference between the updated third state information and the third state information is greater than the third information difference threshold;

[1267] The transmission time interval between the updated third status information and the third status information is greater than the third time difference threshold;

[1268] The third parameter information is greater than the third parameter threshold. The third parameter information consists of the information difference between the updated third state information and the third state information, and the transmission time interval.

[1269] In one possible design, the transceiver module 2801 is further configured to acquire, at a preset time within a preset period, the first state information of the first node at the preset time, the second state information of the second node at the preset time, and the third state information of the intermediate node at the preset time; the processing module 2802 is further configured to redetermine the transmission strategy of the target file based on the first state information, the second state information, and the third state information at the preset time.

[1270] In one possible design, the transceiver module 2801 is also used to send the first transmission strategy to at least one of the first node, the second node, and the intermediate node when the redefined first transmission strategy is different from the target transmission strategy.

[1271] In one possible design, the first node is a user node, the second node is a service node, and the intermediate node is a base station; or, the first node is a service node, the second node is a user node, and the intermediate node is a base station.

[1272] In one possible design, the target node is either a base station or a service node.

[1273] In one possible design, the target node is the central unit in the base station.

[1274] In one possibl...

Claims

1. A transmission management method, characterized in that, Applied to the target node, the method includes: Obtain the first state information of the first node, the second state information of the second node, and the third state information of the intermediate node between the first node and the second node; Based on at least one of the first status information, the second status information, and the third status information, a target transmission strategy for the target file sent by the first node to the second node is determined. The target transmission strategy includes: file preprocessing information, file inverse processing information, and target transmission resources.

2. The method according to claim 1, characterized in that, The first node, the second node, and the intermediate node satisfy at least one of the following: The first node performs file preprocessing, and the second node performs file inverse processing; The first node performs file preprocessing, and the intermediate node performs file inverse processing; The intermediate node performs file preprocessing, and the second node performs file reverse processing.

3. The method according to claim 2, characterized in that, The first node performs file preprocessing, and the second node performs file inverse processing; the first status information includes preprocessing capability information of the first node performing file preprocessing and / or transmission task information of the target file; The second status information includes the reverse processing capability information of the second node in performing file reverse processing and / or the service status information of the second node; The third state information includes the air interface state information between the first node and the second node.

4. The method according to claim 2, characterized in that, The first node performs file preprocessing, and the intermediate node performs file inverse processing; the first status information includes preprocessing capability information of the first node performing file preprocessing and transmission task information of the target file. The second status information includes the service status information of the second node; The third state information includes the air interface state information between the first node and the second node and / or the reverse processing capability information of the intermediate node for performing file reverse processing.

5. The method according to claim 2, characterized in that, The intermediate node performs file preprocessing, and the second node performs file inverse processing; the first status information includes the transmission task information of the target file. The second status information includes the reverse processing capability information of the second node in performing file reverse processing and / or the service status information of the second node; The third status information includes the air interface status information between the first node and the second node and / or the preprocessing capability information of the intermediate node for performing file preprocessing.

6. The method according to any one of claims 3-5, characterized in that, The preprocessing capability information includes at least one of the following: The identifier of at least one preprocessing model and / or algorithm; At least one adjustable parameter index for the preprocessing model and / or algorithm; The correlation between parameter tuning and preprocessing time for at least one preprocessing model and / or algorithm; At least one preprocessing model and / or algorithm, each preprocessing model and / or algorithm has a corresponding inverse processing model and / or algorithm; Queuing status of preprocessing tasks; Available computing resources for preprocessing; The estimated preprocessing time for the target file.

7. The method according to any one of claims 3-5, characterized in that, The reverse processing capability information includes at least one of the following: The identifier of at least one inverse processing model and / or algorithm; At least one adjustable parameter index for the inverse processing model and / or algorithm; The correlation between parameter tuning and inverse processing time for at least one inverse processing model and / or algorithm; At least one inverse processing model and / or algorithm, each inverse processing model and / or algorithm corresponding to a preprocessing model and / or algorithm; Reverse the queuing state of processing tasks; Available computing resources for inverse processing; The estimated inverse processing time for the target file.

8. The method according to any one of claims 3-5, characterized in that, The air interface status information includes at least one of the following: Signal-to-noise ratio; Signal reference point; Spectral efficiency; Channel quality metrics; Transmission resources pre-allocated for different transmission tasks; Rules for allocating transmission resources for different transmission tasks.

9. The method according to any one of claims 3-5, characterized in that, The transmission task information includes at least one of the following: File size; Buffer size File format; Color channels of media files; File characteristics; The time window for file transfer; The priority of the first node in transmitting the target file.

10. The method according to any one of claims 3-5, characterized in that, The service status information includes at least one of the following: The queuing status of the service tasks in which the target file participates; The priority of the service tasks in which the target file participates; The impact of preprocessing / reverse processing on the quality of service in the service tasks involving the target file; Priority for responding to the request from the first node.

11. The method according to any one of claims 6-10, characterized in that, The target transmission resource includes at least one of the following: Time and frequency resources; Channel resources.

12. The method according to any one of claims 6-10, characterized in that, The file preprocessing information includes at least one of the following: A task identifier used to indicate whether the file preprocessing should be performed; Processing rules used to instruct the execution of the file preprocessing; The first information of the target preprocessing model and / or algorithm; The input parameters required by the target preprocessing model and / or algorithm.

13. The method according to claim 12, characterized in that, The first information includes at least one of the following: The name information of the target preprocessing model and / or algorithm; The accuracy information of the target preprocessing model and / or algorithm; Version information of the target preprocessing model and / or algorithm; The hardware information used for the execution of the target preprocessing model and / or algorithm.

14. The method according to claim 12, characterized in that, The input parameters required by the target preprocessing model and / or algorithm include at least one of the following: Target compression ratio; Target compression quality; Target service quality requirements.

15. The method according to any one of claims 6-10, characterized in that, The file reverse processing information includes at least one of the following: The second information of the target inverse processing model and / or algorithm; The input parameters required for the target inverse processing model and / or algorithm.

16. The method according to claim 15, characterized in that, The second information includes at least one of the following: Name information of the target inverse processing model and / or algorithm; The accuracy information of the target inverse processing model and / or algorithm; Version information of the target inverse processing model and / or algorithm; The hardware information used by the target inverse processing model and / or algorithm execution.

17. The method according to claim 15, characterized in that, The input parameters required by the target inverse processing model and / or algorithm include at least one of the following: Target decompression quality; Target hardware requirements.

18. The method according to any one of claims 12-17, characterized in that, The preprocessed target file's message header carries at least one of the following: The file preprocessing information; Part of the information in the file preprocessing information; The file reverse processing information; Part of the information in the file reverse processing information.

19. The method according to any one of claims 1-18, characterized in that, The method further includes at least one of the following: Send the target transmission strategy to the first node; Send the target transmission strategy to the second node; The target transmission strategy is sent to the intermediate node.

20. The method according to claim 19, characterized in that, The method further includes: Receive the updated first status information sent by the first node; If the updated first status information and the first status information satisfy the first condition, the transmission strategy of the target file is re-determined.

21. The method according to claim 19, characterized in that, The method further includes: Receive the updated second status information sent by the second node; If the updated second status information and the second status information satisfy the second condition, the transmission strategy of the target file is re-determined.

22. The method according to claim 19, characterized in that, The method further includes: Receive the updated third status information sent by the intermediate node; If the updated third state information and the third state information satisfy the third condition, the transmission strategy of the target file is re-determined.

23. The method according to claim 19, characterized in that, The method further includes: At a preset time within a preset period, acquire the first state information of the first node at the preset time, the second state information of the second node at the preset time, and the third state information of the intermediate node at the preset time. Based on the first state information, the second state information, and the third state information at the preset time, the transmission strategy of the target file is re-determined.

24. The method according to any one of claims 1-23, characterized in that, The first node is a user node, the second node is a service node, and the intermediate node is a base station; or... The first node is a service node, the second node is a user node, and the intermediate node is a base station.

25. The method according to claim 24, characterized in that, The target node is either the base station or the service node.

26. The method according to claim 25, characterized in that, The target node is the central unit in the base station.

27. A communication device, characterized in that, include: A functional unit for performing the method as described in any one of claims 1-26; wherein the action performed by the functional unit is implemented by hardware or by hardware executing corresponding software.

28. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions to cause the communication device to perform the method as described in any one of claims 1-26.

29. A computer-readable storage medium, characterized in that, A computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the method as described in any one of claims 1-26 to be performed.

30. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are run on a computer, the method as described in any one of claims 1-26 is performed.

Images