Media data deployment method, device, computer equipment and storage medium

By grouping and encoding nodes in the point-to-point content distribution network, the cost of media data deployment is reduced, and the problem of expensive bandwidth required for encoding is solved in the prior art is solved, and the stability and performance of data deployment is improved.

CN118041773BActive Publication Date: 2024-11-22SWEET POTATO TECHNOLOGY (SHANGHAI) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410255317.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-06
Publication Date
2024-11-22
Estimated Expiration
2044-03-06

AI Technical Summary

Technical Problem

The existing Fountain Code version of the Point-to-Point Content Distribution Network (PCDN) requires encoding based on expensive bandwidth when deploying media data, resulting in high media data deployment costs.

Method used

By obtaining the media data to be deployed, grouping nodes according to their sharding information and node parameters, selecting seed nodes for fountain code encoding, and deploying the encoded data into the seed node, and then the encoded data is deployed to other In the target node group, avoid the need for expensive bandwidth for encoding processing for each node.

Benefits of technology

It reduces the deployment cost of media data, improves the stability and performance of media data deployment, and reduces abnormalities that occur during data deployment.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118041773B_ABST
    Figure CN118041773B_ABST
Patent Text Reader

Abstract

The present application discloses a method, device, computer equipment and storage medium for media data deployment, which includes: obtaining media data to be deployed to a content distribution network; grouping nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group; selecting a seed node from the target node group; performing fountain code encoding processing on the corresponding media data fragments according to the fountain coding identifier corresponding to the target node group through an encoder to obtain fountain code data, and deploying the fountain code data to the seed node; sending a data deployment request to the seed node, the data deployment request instructs the seed node to deploy the fountain code data to the nodes other than itself in the target node group. The fountain code data is deployed to the seed node through the encoder, and then the fountain code data is deployed to the remaining nodes based on the seed node, so as to avoid each node being deployed based on the bandwidth of the encoder and reduce the deployment cost of the media data.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a media data deployment method, apparatus, computer equipment and storage medium. Background Art

[0002] The full name of PCDN is “Peer Content Delivery Network”, which is translated into Chinese as “Peer-to-Peer Content Distribution Network”. PCDN is a network architecture that uses node-to-node (P2P) technology to provide efficient content distribution and transmission services.

[0003] For the existing fountain code version of PCDN, in the process of deploying media data, the media data is usually first encoded by the fountain code encoder, and then the encoded data in the encoder is sent to each node in the PCDN. This will result in each node needing to use the expensive bandwidth of the encoder when deploying media data, resulting in a high deployment cost of the media data.

[0004] Therefore, how to reduce the deployment cost of media data is an urgent problem to be solved. Summary of the invention

[0005] Embodiments of the present application provide a media data deployment method, apparatus, computer equipment, and storage medium, which can improve the deployment cost of media data.

[0006] In a first aspect, an embodiment of the present application provides a method for deploying media data, the method comprising:

[0007] Acquire media data to be deployed to a content distribution network, the content distribution network comprising at least two nodes, the media data comprising at least one media data slice;

[0008] The nodes are grouped according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0009] Selecting a seed node from the target node group, the seed node is used to receive fountain code data of an encoder;

[0010] Performing fountain code encoding processing on corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node;

[0011] A data deployment request is sent to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group.

[0012] In a second aspect, an embodiment of the present application provides a media data deployment device including:

[0013] An acquisition unit, configured to acquire media data to be deployed to a content distribution network, wherein the content distribution network includes at least two nodes, and the media data includes at least one media data slice;

[0014] a grouping unit, configured to group the nodes according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, wherein the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0015] A selection unit, used for selecting a seed node from the target node group, wherein the seed node is used for receiving fountain code data of an encoder;

[0016] A first deployment unit is configured to perform fountain code encoding processing on corresponding media data fragments according to the fountain code identifier corresponding to the target node group through the encoder to obtain fountain code data, and deploy the fountain code data to the seed node;

[0017] The second deployment unit is configured to send a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group.

[0018] In a third aspect, an embodiment of the present application further provides a computer device, which is configured with a processor and a memory, and the memory stores multiple computer programs; the processor loads the computer program from the memory to execute the steps of any media data deployment method provided in the embodiment of the present application.

[0019] In a fourth aspect, an embodiment of the present application further provides a storage medium, which is a computer-readable storage medium. The computer-readable storage medium stores multiple computer programs, and the computer programs are suitable for loading by a processor to execute the steps of any media data deployment method provided in the embodiment of the present application.

[0020] In a fifth aspect, an embodiment of the present application also provides a computer program product, including a computer program or a computer program, which, when executed by a processor, implements the steps of any media data deployment method provided in the embodiment of the present application.

[0021] Adopting the scheme of the embodiment of the application, the media data to be deployed to the content distribution network is obtained; according to the fragmentation information of the media data and the node parameters of the nodes, the nodes are grouped to obtain the target node group; the seed node is selected from the target node group; the corresponding media data fragments are fountain-coded by the encoder according to the fountain coding identifier corresponding to the target node group to obtain fountain code data, and the fountain code data is deployed to the seed node; a data deployment request is sent to the seed node, and the data deployment request instructs the seed node to deploy the fountain code data to the nodes other than itself in the target node group. The fountain code data is first deployed to the seed node corresponding to each target node group by the encoder, and then the fountain code data is deployed to the remaining nodes of the same group based on the seed node, so as to avoid that each node needs to be based on the expensive bandwidth of the encoder when the media data is deployed, but only the seed node in each group is deployed based on the expensive bandwidth of the encoder, and the remaining nodes in each group are deployed using the cheaper node bandwidth, thereby reducing the deployment cost of the media data. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0023] Figure 1 This is a flowchart of a first embodiment of the media data deployment method provided by the present application;

[0024] Figure 2 This is a flow chart of a second embodiment of the media data deployment method provided by the present application;

[0025] Figure 3 This is a schematic diagram of the third embodiment of the media data deployment method provided by the present application;

[0026] Figure 4 This is a schematic diagram of a fourth embodiment of the flow chart of the media data deployment method provided by the present application;

[0027] Figure 5 It is a schematic diagram of an embodiment flow of the interaction between nodes and servers of the media data deployment method provided by the present application;

[0028] Figure 6 is a structural diagram of a media data deployment device provided in an embodiment of the present application;

[0029] Figure 7It is a structural diagram of the media data deployment system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0030] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without making creative work are within the scope of protection of the present application. At the same time, in the description of the embodiments of the present application, the terms "first", "second", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance. Thus, the features defined as "first" and "second" may explicitly or implicitly include one or more features. In the description of the embodiments of the present application, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.

[0031] Embodiments of the present application provide a media data deployment method, apparatus, computer equipment, and storage medium.

[0032] Specifically, the embodiments of the present application will be described from the perspective of a computer device, which may include a smart phone, a smart computer, a smart terminal and other devices. The computer device is equipped with a server corresponding to a content distribution network, that is, the media data deployment method of the embodiments of the present application can be executed by a computer device.

[0033] The following is a detailed description in conjunction with the accompanying drawings. In the embodiments of the present application, the execution subject is a computer device as an example. It should be noted that the description order of the following embodiments is not intended to limit the preferred order of the embodiments. Although the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in an order different from that shown in the accompanying drawings.

[0034] Please refer to Figure 1 The specific process of an embodiment of the media data deployment method includes the following steps:

[0035] Step 101, obtaining media data to be deployed to a content distribution network, wherein the content distribution network includes at least two nodes, and the media data includes at least one media data slice;

[0036] Step 102: grouping the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group, wherein the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0037] Step 103, selecting a seed node from the target node group, the seed node is used to receive fountain code data of the encoder;

[0038] Step 104, performing fountain code encoding processing on the corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node;

[0039] Step 105: Send a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than itself in the target node group.

[0040] In this embodiment, the computer device is equipped with a server corresponding to the content distribution network. When the server of the computer device responds to the deployment instruction corresponding to the media data to be deployed, it determines that the media data needs to be deployed to the relevant nodes, and then groups the nodes according to the fragmentation information of the media data to be deployed and the node parameters in the content distribution network to obtain the target node group; after the computer device completes the grouping of the nodes, the same fountain coding identifier is assigned to all nodes in the same target node group, and the fountain coding identifiers between nodes in different target node groups are different. The computer device is equipped with an encoder, which is used to encode the media data to be deployed into fountain code data. The computer device performs fountain code encoding on the media data to be deployed according to the fountain coding identifier corresponding to each target node group through the encoder to obtain fountain code data, and deploys the fountain code data to the seed node corresponding to each target node group; the computer device sends a data deployment request to the seed node, and the data deployment request instructs the seed node to deploy the fountain code data to the nodes in the target node group other than itself, that is, the fountain code data deployed by each node in the same target node group is the same.

[0041] It should be noted that fountain code is a coding technology used for wireless communication. It divides the original data into multiple small blocks and generates redundant data for each small block to increase the reliability and fault tolerance of data transmission. The receiving end only needs to receive a sufficient number of data blocks to restore the original data, without receiving all data blocks in a specific order. The content distribution network in this application is a fountain code coded version of the content distribution network, and all nodes in the content distribution network are used to store fountain code coded data corresponding to the media data.

[0042] The computer device of this embodiment obtains the media data to be deployed to the content distribution network; groups the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group; selects a seed node from the target node group; performs fountain code encoding processing on the corresponding media data fragments according to the fountain coding identifier corresponding to the target node group through the encoder to obtain fountain code data, and deploys the fountain code data to the seed node; sends a data deployment request to the seed node, and the data deployment request instructs the seed node to deploy the fountain code data to the nodes other than itself in the target node group. The fountain code data is first deployed to the seed node corresponding to each target node group through the encoder, and then the fountain code data is deployed to the remaining nodes in the same group based on the seed node, so as to avoid the need for each node to be based on the expensive bandwidth of the encoder when deploying the media data, thereby reducing the deployment cost of the media data.

[0043] Specifically, each step is described in detail below:

[0044] Step 101, obtaining media data to be deployed to a content distribution network, wherein the content distribution network includes at least two nodes, and the media data includes at least one media data slice;

[0045] In this step, the computer device is equipped with a server corresponding to the content distribution network. When the server of the computer device responds to the deployment instruction corresponding to the media data to be deployed, it obtains the media data to be deployed to the content distribution network. The content distribution network includes at least two nodes, and the media data includes at least one media data fragment.

[0046] Specifically, before the computer device groups the nodes, the computer device needs to perform sharding on the media data to be deployed. Specific sharding methods may include: 1. Fixed size sharding: sharding the data according to a fixed size, for example, each shard contains a fixed number of bytes or bits. This method is simple and direct, but may result in uneven shard sizes when the data content changes greatly. 2. Sharding according to specific marks: sharding can be performed according to specific marks or identifiers in the data, such as sharding at the position where a specific character appears, or sharding according to a specific data structure field. 3. Hash sharding: sharding the data using a hash function, so that the sharding position can be determined according to the hash result of the data content, and a relatively uniform sharding size can usually be achieved. 4. Sharding by row or record: For structured data, sharding can be performed by row or record, and each shard contains a certain number of rows or records. 5. Dynamic sharding: sharding is performed by dynamically adjusting the shard size or number according to the changes in the data content to adapt to different data situations. It is understandable that the computer device can select a corresponding segmentation method to segment the media data to be deployed according to actual conditions, and this is not limited here.

[0047] Step 102: grouping the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group, wherein the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0048] In this step, when the server in the computer device responds to the deployment instruction corresponding to the media data to be deployed, it determines that the media data needs to be deployed to the relevant nodes, and then groups the nodes according to the fragmentation information of the media data to be deployed and the node parameters in the content distribution network; after the computer device completes the grouping of the nodes, the same fountain coding identifier is assigned to all nodes in the same target node group, and the fountain coding identifiers between nodes in different target node groups are different.

[0049] Specifically, after the computer device performs slicing processing on the media data to be deployed, it can determine the slicing information of the media data to be deployed, and then obtain the node parameters corresponding to each node in the content distribution network, and group the nodes in combination with the slicing information of the media data to be deployed and the node parameters in the content distribution network, so that the functional data transmission efficiency and overall system performance of each target node group are similar. In this way, node resources can be better utilized, the stability and performance of media data deployment can be improved, anomalies in the data deployment process can be reduced, and the cost of media data deployment can be saved.

[0050] Step 103, selecting a seed node from the target node group, the seed node is used to receive fountain code data of the encoder;

[0051] In this step, the computer device selects a seed node from the target node group, and the seed node is used to receive the fountain code data of the encoder.

[0052] Step 104, performing fountain code encoding processing on the corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node;

[0053] In this step, the computer device performs fountain code encoding on the corresponding media data fragments according to the fountain code identifier corresponding to the target node group through an encoder to obtain fountain code data, and deploys the fountain code data to the seed node corresponding to the target node group.

[0054] In one embodiment, the computer device performs fountain code encoding on the entire media data to be deployed according to the fountain code identifier corresponding to the target node group, obtains fountain code data, and then deploys the corresponding fountain code data to the seed node of the corresponding target node group. Exemplarily, after the computer device groups the nodes, 5 target node groups are obtained, and the fountain code identifiers corresponding to each target node group are different; the computer device first performs fountain code encoding on the entire media data to be deployed according to the first fountain code identifier corresponding to the first target node group, obtains the fountain code data corresponding to the first fountain code identifier, and deploys the fountain code data to the seed node corresponding to the first target node group; the computer device then performs fountain code encoding on the entire media data to be deployed according to the second fountain code identifier corresponding to the second target node group, obtains the fountain code data corresponding to the second fountain code identifier, and deploys the fountain code data to the seed node corresponding to the second target node group, and so on, until the fountain code data corresponding to the fifth fountain code identifier of the fifth target node group is deployed to the seed node corresponding to the fifth target node group.

[0055] In one embodiment, the computer device performs fountain code encoding on each data block of the media data to be deployed according to the fountain code identifier corresponding to each target node group, obtains the data block fountain code data, and then deploys the corresponding data block fountain code data to the seed node of the corresponding target node group. For example, the media data to be deployed is divided into 5 data blocks, and after the computer device groups the nodes, 5 target node groups are obtained, and the fountain code identifiers corresponding to each target node group are different. At this time, the seed node of each target node group deploys a data block fountain code data; the computer device first performs fountain code encoding on the first data block of the media data to be deployed according to the first fountain code identifier corresponding to the first target node group, obtains the first data block fountain code data, and deploys the first data block fountain code data to the seed node corresponding to the first target node group, and then the computer device performs fountain code encoding on the second data block of the media data to be deployed according to the second fountain code identifier corresponding to the second target node group, obtains the second data block fountain code data, and deploys the second data block fountain code data to the seed node corresponding to the second target node group, and so on, until the fifth data block fountain code data is deployed to the seed node corresponding to the fifth target node group.

[0056] In one embodiment, the computer device performs fountain code encoding on each data slice in each data block of the media data to be deployed according to the fountain coding identifier corresponding to each target node group, obtains the data slice fountain code data, and then deploys the corresponding data slice fountain code data to the seed node of the corresponding target node group. For example: the media data to be deployed is divided into 5 data blocks, each data block is divided into 5 data slices, and after the computer device groups the nodes, 25 target node groups are obtained, and the fountain coding identifier corresponding to each target node group is different; for each data block in the media data to be deployed, the computer device assigns 5 target node groups to the data block, and the computer device first performs fountain code encoding on the first data slice of the data block according to the first fountain coding identifier corresponding to the first target node group, obtains the first data slice fountain code data, and deploys the first data slice fountain code data to the seed node corresponding to the first target node group. In the process, the computer device performs fountain code encoding on the second data slice of the data block according to the second fountain code identifier corresponding to the second target node group to obtain the second data slice fountain code data, and deploys the second data slice fountain code data to the seed node corresponding to the second target node group, and so on, until the fifth data slice fountain code data is deployed to the seed node corresponding to the fifth target node group, and the deployment of the data block is completed; the deployment process of other data blocks is the same as the above steps, which will not be repeated here, until the data slices corresponding to each data block of the computer device are deployed to the seed node of the corresponding target node group.

[0057] Step 105: Send a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than itself in the target node group.

[0058] In this step, after the fountain code data is deployed to the seed node corresponding to the target node group, the computer device sends a data deployment request to the seed node, so that the seed node deploys the fountain code data to the nodes in the target node group except itself.

[0059] In one embodiment, for each target node group, the computer device respectively establishes communication connections with the remaining nodes in the target node group based on the seed node, and then sends the fountain code data deployed therein to the remaining nodes in the target node group based on the seed node.

[0060] In one embodiment, for each target node group, the computer device obtains information about each node in the target node group, and uses the seed node of the target node group as a starting point and combines the information of each node to construct a target path with the lowest deployment cost, and then based on the target path, sends the fountain code data deployed in the seed node to the remaining nodes in the target node group. By constructing the target path with the lowest deployment cost in the process of deploying fountain code data in each target node group, and performing deployment operations in combination with the target path, the deployment cost of media data can be further reduced.

[0061] The computer device of this embodiment first deploys the fountain code data to the seed nodes corresponding to each target node group through the encoder, and then deploys the fountain code data to the remaining nodes of the same target node group based on the seed nodes, thereby avoiding the need for each node to use the expensive bandwidth of the encoder when deploying media data, thereby reducing the deployment cost of media data.

[0062] Specifically, refer to Figure 2 , grouping the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group, including:

[0063] Step 1021, determining the total number of fragments of each data block corresponding to the media data according to the fragment information of the media data, and determining the target number of groups according to the total number of fragments;

[0064] In this step, the computer device determines the total number of fragments of each data block corresponding to the media data to be deployed according to the fragment information of the media data to be deployed, and determines the target number of groups according to the total number of fragments.

[0065] In one embodiment, the computer device determines the total number of shards of each data block corresponding to the media data to be deployed according to the shard information of the media data to be deployed, and determines the target number of groups according to the total number of shards and the specific deployment strategy. Exemplarily, the media data to be deployed is divided into 5 data blocks, and each data block is divided into 5 data shards; when each target node group deploys the fountain code data of the entire media data to be deployed, the target number of groups is determined to be 5; when each target node group deploys the fountain code data of a data block of the media data to be deployed, the target number of groups is determined to be 5; when each target node group deploys the fountain code data in a data block of the media data to be deployed, the target number of groups corresponding to a data block is determined to be 5, and the target number of groups for deploying the entire media data to be deployed is 25.

[0066] In one embodiment, the computer device determines the total number of shards of each data block corresponding to the media data to be deployed according to the shard information of the media data to be deployed, and determines the target number of groups according to the total number of shards, the specific deployment strategy and the preset redundancy number. Exemplarily, the media data to be deployed is divided into 5 data blocks, each data block is divided into 5 data shards, and the preset redundancy number is 3; when each target node group deploys the fountain code data of the entire media data to be deployed, the target number of groups is determined to be 8; when each target node group deploys the fountain code data of a data block of the media data to be deployed, the target number of groups is determined to be 8; when each target node group deploys the fountain code data in a data block of the media data to be deployed, the target number of groups corresponding to a data block is determined to be 5, and the target number of groups for deploying the entire media data to be deployed is 45. Since the node is a node that stores fountain code data, its stability is usually poor. Therefore, by adding the redundancy number, the fountain code data can be deployed on more nodes, avoiding the situation where the node suddenly fails when the client obtains the data of the node, resulting in the client being unable to restore the target media data, thereby improving the stability of the content distribution network.

[0067] Step 1022, determining location information and network status information corresponding to each node according to the node parameters of the node;

[0068] In this step, the computer device determines the location information and network status information corresponding to each node based on the node parameters of each node; wherein the network status information includes network bandwidth, and the computer device obtains indicators such as the transmission rate and bandwidth utilization of the network interface in each node parameter, and determines the network bandwidth of each node based on indicators such as the transmission rate and bandwidth utilization of the network interface.

[0069] Step 1013: Divide all nodes in the content distribution network into a target grouping number of target node groups according to the location information and the network status information.

[0070] In this step, the computer device divides all nodes in the content distribution network into target grouping number of target node groups according to the location information and network status information. Optionally, a grouping model is created in advance in the computer device, and the location information and network status information of each node are input into the grouping model, and the grouping model can divide all nodes in the content distribution network into target grouping number of target node groups. Optionally, the computer device first divides all nodes in the content distribution network into target grouping number of reference node groups according to the network status information of each node, and the total network bandwidth of each reference node group is within the preset bandwidth range, and then adjusts the reference node group according to the location information of each node to obtain the final target grouping number of target node groups, and the distance between adjacent nodes of each target node group is within the preset distance range. The nodes are grouped so that the functional data transmission efficiency of each target node group is similar to the overall system performance. In this way, node resources can be better utilized, the stability and performance of media data deployment can be improved, the anomalies in the data deployment process can be reduced, and the cost of media data deployment can be saved.

[0071] Specifically, step 1023 includes:

[0072] Step 10231, based on the network state information, determine the network bandwidth corresponding to each node, and divide all nodes in the content distribution network into a target group of reference node groups according to the network bandwidth, and the total network bandwidth of each reference node group is within a preset bandwidth range;

[0073] In this step, the computer device determines the network bandwidth corresponding to each node based on the network status information, and divides all nodes in the content distribution network into a target number of reference node groups according to the network bandwidth, and the total network bandwidth of each reference node group is within the preset bandwidth range. Specifically, the process of dividing all nodes in the content distribution network into a target number of reference node groups includes: 1. The computer device first needs to collect the network topology information of the entire content distribution network, and the network topology information includes information such as the connection status between nodes and the network bandwidth; 2. The computer device determines the total number of fragments of each data block corresponding to the media data to be deployed according to the fragmentation information of the media data to be deployed, and determines the target number of groups according to the total number of fragments; 3. The computer device divides the nodes into a target number of reference node groups according to the preset bandwidth balancing algorithm by analyzing and optimizing the network topology. The goal of the bandwidth balancing algorithm is to make the total network bandwidth of each reference node group within the preset bandwidth range and to balance the network load to the greatest extent.

[0074] Step 10232, determining the distance between every two adjacent nodes based on the position information corresponding to every two adjacent nodes, and determining the target distance range based on the distance between every two adjacent nodes.

[0075] In this step, the computer device determines the adjacent nodes according to the network topology information of the content distribution network, determines the distance between each two adjacent nodes according to the position information corresponding to each two adjacent nodes, and calculates the average distance between adjacent nodes in the content distribution network according to the distance between each two adjacent nodes, and then determines the target distance range by combining the average distance and the preset error range.

[0076] Step 10233: Based on the position information, the reference node group is adjusted to obtain a target node group, and the distances between adjacent nodes of each target node group are within the target distance range.

[0077] In this step, the computer device adjusts the reference node group based on the location information of each node to obtain the target node group, and the distance between adjacent nodes of each target node group is within the target distance range. Optionally, the process of adjusting the reference node group to obtain the target node group is as follows: for each node, the computer device calculates the distance between it and other nodes based on the location information of the node, and divides the nodes into corresponding target node groups according to the distance. For each target node group, check whether the distance between adjacent nodes is within the target distance range. If not, adjust the grouping of the nodes so that the distance between adjacent nodes meets the requirements of the target distance range. The computer device continuously repeats the above iterative optimization steps until the stop condition is reached, such as reaching the maximum number of iterations or the target node group no longer changes; the computer device returns the final target node group result, wherein the distance between adjacent nodes of each target node group is within the target distance range.

[0078] Optionally, the process of adjusting the reference node group to obtain the target node group may also use a simulated annealing algorithm, a genetic algorithm, a taboo search algorithm, an artificial neural network, etc., which is not limited here.

[0079] The computer device of this embodiment groups nodes according to location information and network status information, so that the functional data transmission efficiency and overall system performance of each target node group are similar. This can better utilize node resources, improve the stability and performance of media data deployment, reduce anomalies in the data deployment process, and help save the cost of media data deployment.

[0080] Specifically, refer to Figure 3 , the selecting a seed node from the target node group includes:

[0081] Step 1031, calculating a capability score value corresponding to each node according to the position information of the encoder and the node parameters of each node in the target node group;

[0082] In this step, the computer device calculates the capability score value corresponding to each node for each target node group according to the position information of the encoder and the node parameters of each node in the target node group; the capability score value is used to indicate the size of each node's ability to process. Optionally, the computer device inputs the position information and node parameters corresponding to each node into a capability value evaluation model created in advance to calculate the capability score value of each node. Optionally, the computer device displays the position information and node parameters corresponding to each node to relevant personnel, and the capability score value of each node is determined accordingly. Optionally, the capability score value of each node is calculated based on the actual performance and historical data of the node, such as the node's bandwidth, failure rate, packet loss rate, and average delay.

[0083] Specifically, step 1031 includes:

[0084] Step 10311, based on the node parameters of each node in the target node group and the preset standardization rules, obtain the bandwidth standardization value, the failure rate standardization value, the packet loss rate standardization value and the average delay standardization value corresponding to each node;

[0085] In this step, for each node, the computer device obtains the node parameters such as bandwidth, failure rate, packet loss rate and average delay, and calculates the corresponding bandwidth standardized value, failure rate standardized value, packet loss rate standardized value and average delay standardized value of the node in combination with the preset standardization rules.

[0086] In one embodiment, the computer device determines the preset standardization rules for each indicator based on the preset standardization rules, for example, the higher the bandwidth, the better, the lower the failure rate and packet loss rate, the better, and the shorter the average delay, the better. Determine the target direction of standardization according to the specific situation, whether the larger the value, the better or the smaller the value, the better. The computer device performs standardization processing on the bandwidth, failure rate, packet loss rate and average delay, and converts the original data into standardized values. Commonly used standardization methods include Min-Max standardization, Z-Score standardization, etc. Bandwidth standardized value: The bandwidth standardized value can use Min-Max standardization to linearly map the actual bandwidth value to the range of [0,1]. The calculation formula is: bandwidth standardized value = (actual bandwidth-bandwidth lower limit) / (bandwidth upper limit-bandwidth lower limit); the standardization processing of failure rate, packet loss rate, and average delay can also adopt the above method. Obtain bandwidth standardized value, failure rate standardized value, packet loss rate standardized value and average delay standardized value.

[0087] Step 10312, calculating a reference capability score corresponding to each node based on the bandwidth normalized value, the failure rate normalized value, the packet loss rate normalized value, the average delay normalized value and a preset weight;

[0088] In this step, for each node, the computer device calculates the reference capability score value corresponding to each node based on the bandwidth standardized value, the failure rate standardized value, the packet loss rate standardized value, the average delay standardized value and the preset weight, wherein the specific calculation formula is: A=a1*B+a2*G+a3*D+a4*S, A is the reference capability score value, B is the bandwidth standardized value, G is the failure rate standardized value, D is the packet loss rate standardized value, S is the average delay standardized value, a1 is the preset weight corresponding to the bandwidth standardized value, a2 is the preset weight corresponding to the failure rate standardized value, a3 is the preset weight corresponding to the packet loss rate standardized value, and a4 is the preset weight corresponding to the packet loss rate standardized value.

[0089] Step 10313, determining a distance score value corresponding to each node based on the position information of the encoder, the position information of each node, and a mapping relationship between a preset distance and a score value;

[0090] In this step, for each node, the computer device determines the distance score value corresponding to each node based on the position information of the encoder, the position information of each node, and the mapping relationship between the preset distance and the score value. Specifically, the mapping relationship between the distance and the distance score value is pre-stored in the computer device. For each node, the computer device calculates the distance between the node and the encoder based on the position information of the encoder and the position information of each node, and then queries the mapping relationship between the distance and the distance score value according to the calculated distance to obtain the distance score value of the node.

[0091] Step 10314, adjusting the corresponding reference capability score value by the distance score value corresponding to each node to obtain the capability score value corresponding to each node.

[0092] In this step, for each node, the computer device adds the distance score value between the node and the corresponding reference capability score value to obtain the capability score value corresponding to the node. It can be understood that by adding the distance score value, it can be ensured that the capability score value corresponding to the node takes into account both the performance of the node itself and the data transmission performance between the node and the encoder, thereby improving the comprehensiveness and accuracy of the capability score value.

[0093] Step 1032, comparing the capability score values ​​corresponding to each node, and selecting the node with the largest capability score value as the seed node corresponding to the target node group.

[0094] In this step, for each target node group, the computer device compares the capability score values ​​corresponding to each node in the target node group, and selects the node with the largest capability score value as the seed node corresponding to the target node group.

[0095] The computer device of this embodiment calculates the capability score value corresponding to each node based on the position information of the encoder and the node parameters and position information of each node in the target node group, and then uses the node with the largest capability score value in each target node group as the seed node corresponding to the target node group. This can ensure that each target node group uses the best node as the seed node, which can not only improve the stability of the seed node, but also improve the efficiency of data transmission between the seed node and the encoder, reduce the time that the seed node uses the expensive bandwidth of the encoder, and thus save the cost of media data deployment.

[0096] Specifically, refer to Figure 4 , before sending the data deployment request to the seed node, comprising:

[0097] Step a, taking the seed node as the starting point and combining with the remaining nodes in the target node group to build a deployment path set;

[0098] In this step, the computer device takes the seed node as the starting point for each target node group and builds a deployment path set in combination with the remaining nodes; specifically, the computer device abstracts the connection relationship between the nodes in the same group and the nodes into a graph model; the computer device determines the source node of the data transmission as the seed node, and the target node as the remaining nodes in the target node group, and the starting and ending positions of the data can be determined based on the source node and the target node; the computer device uses a path selection algorithm to determine the path for data deployment. Common path selection algorithms include: shortest path algorithm, minimum cost path algorithm, load balancing path algorithm, etc., and a deployment path set can be constructed.

[0099] Step b, calculating the deployment cost corresponding to each deployment path according to the cost information and network performance indicator information of each deployment path in the deployment path set;

[0100] In this step, the computer device calculates the deployment cost corresponding to each deployment path according to the cost information and network performance index information of each deployment path in the deployment path set. Specifically, the computer device determines the various costs of each path, including the use cost of hardware equipment, the rental cost of network bandwidth, the rental cost of data center resources, etc. For the use cost of hardware equipment and resources, it can be calculated based on the purchase cost, maintenance cost and depreciation of the equipment, and for the rental cost of network bandwidth, it can be calculated based on the bandwidth usage and the supplier's charging standards; the computer device determines the network performance indicators that need to be considered, including bandwidth, delay, packet loss rate, and collects the bandwidth, delay, and packet loss rate on each path; the computer device assigns weights to each cost item in each path according to the selected bandwidth, delay, packet loss rate and cost information, so as to comprehensively consider, use the weighted average method or other cost calculation models, summarize and calculate each cost according to the weight, and obtain the deployment cost of each deployment path.

[0101] Step c: determining the deployment path with the minimum deployment cost in the deployment path set as the target path, and generating a data deployment request based on the target path.

[0102] In this step, for each target node group, the computer device determines the deployment path with the minimum deployment cost in the deployment path set as the target path, and generates a data deployment request based on the target path, so that the seed node deploys the fountain code data to the nodes other than itself in the target node group. For example: a target node group includes 6 nodes, namely the seed node, the first node, the second node, the third node, the fourth node, and the fifth node, and the target path is: the seed node is connected to the first node and the second node respectively, the first node is connected to the third node, and the second node is connected to the fourth node and the fifth node respectively. At this time, the computer device deploys the fountain code data stored in the seed node to the first node and the second node respectively based on the seed node, deploys the fountain code data stored in the first node to the third node based on the first node, and deploys the fountain code data stored in the second node to the fourth node and the fifth node based on the second node.

[0103] Further, after deploying the fountain code data to the remaining nodes of the corresponding target node group based on the seed node, the method further includes:

[0104] Step 106, in response to the data acquisition instruction of the client, acquiring the location information and network information corresponding to the client;

[0105] Step 107: Based on the location information and the network information, a target node is selected from each of the target node groups, and corresponding fountain code data is sent to the client through the target node.

[0106] In step 106 to step 107, after the computer device completes the deployment of the media data to be deployed, when receiving the data acquisition instruction of the client, the computer device obtains the location information and network information corresponding to the client. Based on the location information and network information, a node that best matches the client location information and network information is selected in each target node group as the target node, and the corresponding fountain code data is sent to the client through the target node.

[0107] Specifically, for each target node group, the computer device obtains the location information of each node in the target node group, and calculates the distance between each node and the client based on the location information of each node and the location information of the client; the computer device compares the distance between each node and the client with a preset distance threshold, and determines the node whose distance is less than the preset distance threshold as a candidate node. It can be understood that the candidate node may include multiple nodes; the computer device determines the network information corresponding to each candidate node based on the node parameters of each candidate node, and determines the data transmission efficiency of each candidate node based on the network information of each candidate node and the network information of the client, and determines the candidate node with the highest data transmission efficiency as the target node, and then sends the fountain code data stored therein to the client through the target node.

[0108] The computer device of this embodiment deploys the fountain code data stored in the seed node to the remaining nodes of the corresponding target node group based on the deployment path with the minimum deployment cost, which can further save the cost of media data deployment.

[0109] In the specific implementation, refer to Figure 5 .

[0110] For a piece of media data, the server corresponding to the content distribution network divides the media data into several data blocks, and each data block is divided into several data slices.

[0111] For each data block, the server determines the target number of groups according to the total number of shards of the data shards corresponding to the data block, and groups the nodes in the content distribution network according to the target number of groups and the node parameters in the content distribution network to obtain the target number of target node groups. Optionally, the server determines the target number of groups according to the total number of shards of the data shards corresponding to the data block and the preset number of redundancies, and then groups the nodes in the content distribution network according to the target number of groups and the node parameters in the content distribution network to obtain the target number of target node groups.

[0112] For each data block and the number of target node groups grouped, the server assigns a corresponding fountain coding identifier to each target node group, and the fountain coding identifier corresponding to each node in each target node group is the same; the server determines the seed node corresponding to each target node group according to the distance between each node and the encoder and the node parameters of each node; the server determines the data shards corresponding to the data block that the target node group needs to deploy according to the fountain coding identifier corresponding to each target node group through the encoder, and performs fountain code encoding on the data shards according to the fountain coding identifier corresponding to the target node group through the fountain code encoder to obtain fountain code data, and deploy the fountain code data to the seed node corresponding to the target node group. It can be understood that for all target node groups, the corresponding fountain code data is deployed to the seed node corresponding to the target node group in the above manner.

[0113] For each target node group, after the seed node deploys the corresponding fountain code data, the server builds a target path with the lowest deployment cost for the target node group and sends the target path to the seed node; the seed node deploys the fountain code data to the remaining nodes of the target node group based on the target path.

[0114] This embodiment groups nodes according to location information and network status information, so that the functional data transmission efficiency of each target node group is similar to the overall system performance, which can better utilize node resources, improve the stability and performance of media data deployment, reduce anomalies in the data deployment process, and help save the cost of media data deployment; first deploy fountain code data to the seed node corresponding to each target node group through an encoder, and then deploy fountain code data to the remaining nodes of the same group based on the seed node, so as to avoid the need for each node to be based on the expensive bandwidth of the encoder when deploying media data, thereby reducing the deployment cost of media data. Deploying the fountain code data stored in the seed node to the remaining nodes of the corresponding target node group based on the deployment path with the lowest deployment cost can further save the cost of media data deployment.

[0115] In the specific implementation, take the deployment of video data on Xiaohongshu as an example:

[0116] For a piece of video data, the Xiaohongshu server corresponding to the content distribution network used by Xiaohongshu divides the video data into several video data blocks, and each video data block is divided into several video data slices.

[0117] For each video data block, the Xiaohongshu server determines the target number of groups according to the total number of shards of the video data shards corresponding to the video data block, and groups the nodes in the content distribution network according to the target number of groups and the node parameters in the content distribution network to obtain the target number of target node groups. Optionally, the Xiaohongshu server determines the target number of groups according to the total number of shards of the video data shards corresponding to the video data block and the preset number of redundancies, and then groups the nodes in the content distribution network according to the target number of groups and the node parameters in the content distribution network to obtain the target number of target node groups.

[0118] For each group of target node groups corresponding to each video data block, the Xiaohongshu server assigns a corresponding fountain coding identifier to each target node group, and the fountain coding identifier corresponding to each node in each target node group is the same; the Xiaohongshu server determines the seed node corresponding to each target node group based on the distance between each node and the encoder and the node parameters of each node; the server determines the video data fragments corresponding to the video data block that needs to be deployed by the target node group through the encoder according to the fountain coding identifier corresponding to each target node group, and performs fountain code encoding on the video data fragments according to the fountain coding identifier corresponding to the target node group through the fountain code encoder to obtain video fountain code data, and deploy the video fountain code data to the seed node corresponding to the target node group. It can be understood that for all target node groups, the above method is used to deploy the corresponding video fountain code data to the seed node corresponding to the target node group.

[0119] For each target node group, after the seed node deploys the corresponding video fountain code data, the Xiaohongshu server builds a target path with the lowest deployment cost for the target node group and sends the target path to the seed node; the middle box seed node deploys the video fountain code data to the remaining nodes of the target node group based on the target path.

[0120] The Xiaohongshu server of this embodiment groups nodes according to location information and network status information, so that the functional data transmission efficiency of each target node group is similar to the overall system performance, which can better utilize node resources, improve the stability and performance of video data deployment, reduce anomalies in the video data deployment process, and help save the cost of video data deployment; first deploy the video fountain code data to the seed node corresponding to each target node group through the encoder, and then deploy the video fountain code data to the remaining nodes of the same group based on the seed node, so as to avoid the need for each node to be based on the expensive bandwidth of the encoder when deploying video data, thereby reducing the deployment cost of video data. Deploying the video fountain code data stored in the seed node to the remaining nodes of the corresponding target node group based on the deployment path with the lowest deployment cost can further save the cost of video data deployment.

[0121] This embodiment also provides a media data deployment device, such as Figure 6 As shown, the media data deployment device may include:

[0122] An acquisition unit 1001 is configured to acquire media data to be deployed to a content distribution network, wherein the content distribution network includes at least two nodes, and the media data includes at least one media data fragment;

[0123] A grouping unit 1002 is used to group the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group, wherein the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0124] A selection unit 1003 is used to select a seed node from the target node group, and the seed node is used to receive fountain code data of an encoder;

[0125] The first deployment unit 1004 is configured to perform fountain code encoding processing on the corresponding media data fragments according to the fountain code identifier corresponding to the target node group through the encoder to obtain fountain code data, and deploy the fountain code data to the seed node;

[0126] The second deployment unit 1005 is configured to send a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group.

[0127] In an optional example, the grouping unit is further used to:

[0128] Determine the total number of fragments of each data block corresponding to the media data according to the fragment information of the media data, and determine the target number of groups according to the total number of fragments;

[0129] Determine the location information and network status information corresponding to each node according to the node parameters of the node;

[0130] According to the location information and the network status information, all nodes in the content distribution network are divided into a target grouping and a plurality of target node groups.

[0131] In an optional example, the grouping unit is further used to:

[0132] Determine the distance between every two adjacent nodes according to the position information corresponding to every two adjacent nodes, and determine the average distance between two adjacent nodes according to the distance between every two adjacent nodes;

[0133] Based on the network status information, determine the network bandwidth corresponding to each node, and divide all nodes in the content distribution network into a target group of reference node groups according to the network bandwidth, and the total network bandwidth of each reference node group is within a preset bandwidth range;

[0134] Based on the average distance and the position information, the reference node group is adjusted to obtain a target node group, and the distance between adjacent nodes of each target node group is within a preset distance range.

[0135] In an optional example, the selection unit is also used to:

[0136] Calculating a capability score value corresponding to each node according to the position information of the encoder and the node parameters of each node in the target node group;

[0137] The capability score values ​​corresponding to each node are compared, and the node with the largest capability score value is selected as the seed node corresponding to the target node group.

[0138] In an optional example, the selection unit is also used to:

[0139] Based on the node parameters of each node in the target node group and the preset standardization rules, a bandwidth standardization value, a failure rate standardization value, a packet loss rate standardization value and an average delay standardization value corresponding to each node are obtained;

[0140] Calculate the reference capability score corresponding to each node based on the bandwidth normalized value, the failure rate normalized value, the packet loss rate normalized value, the average delay normalized value and the preset weight;

[0141] Determine a distance score value corresponding to each node based on the position information of the encoder, the position information of each node, and a mapping relationship between a preset distance and a score value;

[0142] The corresponding reference ability score value is adjusted by the distance score value corresponding to each node to obtain the ability score value corresponding to each node.

[0143] In an optional example, the second deployment unit is further configured to:

[0144] Taking the seed node as the starting point, and combining with the remaining nodes in the target node group, a deployment path set is constructed;

[0145] Calculate the deployment cost corresponding to each deployment path according to the cost information and network performance indicator information of each deployment path in the deployment path set;

[0146] The deployment path with the minimum deployment cost in the deployment path set is determined as the target path, and a data deployment request is generated based on the target path.

[0147] In an optional example, the media data deployment apparatus further includes a sending unit, and the sending unit is used to:

[0148] In response to a data acquisition instruction of the client, acquiring location information and network information corresponding to the client;

[0149] Based on the location information and the network information, a target node is selected in each of the target node groups, and corresponding fountain code data is sent to the client through the target node.

[0150] By adopting the solution of this embodiment, fountain code data is first deployed to the seed node corresponding to each target node group through the encoder, and then the fountain code data is deployed to the remaining nodes of the same group based on the seed node, so as to avoid the situation that each node needs to be based on the expensive bandwidth of the encoder when deploying media data. Instead, only the seed node in each group is deployed based on the expensive bandwidth of the encoder, and the remaining nodes in each group are deployed using the relatively cheap node bandwidth, thereby reducing the deployment cost of media data.

[0151] Accordingly, the present application also provides a computer device, such as Figure 7 As shown, Figure 7 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. The computer device 1100 client and / or server includes a processor 1101 with one or more processing cores, a memory 1102 with one or more computer-readable storage media, and a computer program stored in the memory 1102 and executable on the processor. Among them, the processor 1101 is electrically connected to the memory 1102. Those skilled in the art will understand that the computer device structure shown in the figure does not constitute a limitation on the computer device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange components differently.

[0152] The processor 1101 is the control center of the computer device 1100, and uses various interfaces and lines to connect various parts of the entire computer device 1100. By running or loading software programs and / or units stored in the memory 1102, and calling data stored in the memory 1102, the processor 1101 executes various functions of the computer device 1100 and processes data, thereby monitoring the computer device 1100 as a whole. The processor 1101 can be a processor CPU, a graphics processor GPU, a network processor (Network Processor, NP), etc., and can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application.

[0153] In the embodiment of the present application, the processor 1101 in the computer device 1100 will load the computer program corresponding to the process of one or more application programs into the memory 1102 according to the following steps, and the processor 1101 will run the application program stored in the memory 1102, thereby executing the steps of the media data deployment method:

[0154] Acquire media data to be deployed to a content distribution network, the content distribution network comprising at least two nodes, the media data comprising at least one media data slice;

[0155] The nodes are grouped according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0156] Selecting a seed node from the target node group, the seed node is used to receive fountain code data of an encoder;

[0157] Performing fountain code encoding processing on corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node;

[0158] A data deployment request is sent to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group.

[0159] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.

[0160] Optional, such as Figure 7 As shown, the computer device 1100 further includes: a touch screen 1103, a radio frequency circuit 1104, an audio circuit 1105, an input unit 1106, and a power supply 1107. The processor 1101 is electrically connected to the touch screen 1103, the radio frequency circuit 1104, the audio circuit 1105, the input unit 1106, and the power supply 1107, respectively. Those skilled in the art can understand that Figure 4 The computer device structure shown in the figure does not constitute a limitation on the computer device, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0161] The touch display screen 1103 can be used to display a graphical user interface and receive operation instructions generated by the user acting on the graphical user interface. The touch display screen 1103 may include a display panel and a touch panel. Among them, the display panel can be used to display information input by the user or information provided to the user and various graphical user interfaces of the computer device, and these graphical user interfaces can be composed of graphics, text, icons, videos and any combination thereof. Optionally, the display panel can be configured in the form of a liquid crystal display (LCD, Liquid Crystal Display), an organic light-emitting diode (OLED, Organic Light-EmittingDiode) and the like. The touch panel can be used to collect the user's touch operation on or near it (such as the user uses any suitable object or attachment such as a finger, a stylus, etc. on the touch panel or near the touch panel), and generate corresponding operation instructions, and the operation instructions execute corresponding programs. Optionally, the touch panel may include two parts: a touch detection device and a touch controller. Among them, the touch detection device detects the user's touch orientation, detects the signal brought by the touch operation, and transmits the signal to the touch controller; the touch controller receives the touch information from the touch detection device, converts it into the touch point coordinates, and then sends it to the processor 1101, and can receive the command sent by the processor 1101 and execute it. The touch panel can cover the display panel. When the touch panel detects a touch operation on or near it, it is transmitted to the processor 1101 to determine the type of touch event, and then the processor 1101 provides a corresponding visual output on the display panel according to the type of touch event. In an embodiment of the present application, the touch panel and the display panel can be integrated into the touch display screen 1103 to realize the input and output functions. However, in some embodiments, the touch panel and the touch panel can be used as two independent components to realize the input and output functions. That is, the touch display screen 1103 can also be used as a part of the input unit 1106 to realize the input function.

[0162] The radio frequency circuit 1104 may be used to send and receive radio frequency signals, so as to establish wireless communication with a network device or other computer device through wireless communication, and to send and receive signals between the network device or other computer device.

[0163] The audio circuit 1105 can be used to provide an audio interface between the user and the computer device through a speaker and a microphone. The audio circuit 1105 can transmit the electrical signal converted from the received audio data to the speaker, which is converted into a sound signal for output; on the other hand, the microphone converts the collected sound signal into an electrical signal, which is received by the audio circuit 1105 and converted into audio data, and then the audio data is output to the processor 1101 for processing, and then sent to another computer device through the radio frequency circuit 1104, or the audio data is output to the memory 1102 for further processing. The audio circuit 1105 may also include an earphone jack to provide communication between an external headset and the computer device.

[0164] The input unit 1106 may be used to receive input numbers, character information or user feature information (such as fingerprint, iris, facial information, etc.), and to generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.

[0165] The power supply 1107 is used to supply power to various components of the computer device 1100. Optionally, the power supply 1107 can be logically connected to the processor 1101 through a power management system, so that the power management system can manage charging, discharging, and power consumption. The power supply 1107 can also include one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

[0166] although Figure 7 Not shown, the computer device 1100 may also include a camera, a sensor, a wireless fidelity module, a Bluetooth module, etc., which will not be described in detail here.

[0167] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0168] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by a computer program, or by controlling related hardware through a computer program. The computer program may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0169] To this end, an embodiment of the present application provides a computer-readable storage medium, in which multiple computer programs are stored, and the computer program can be loaded by a processor to execute any one of the media data deployment methods provided in the embodiments of the present application. The computer program can execute the steps of the media data deployment method:

[0170] Acquire media data to be deployed to a content distribution network, the content distribution network comprising at least two nodes, the media data comprising at least one media data slice;

[0171] The nodes are grouped according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake;

[0172] Selecting a seed node from the target node group, the seed node is used to receive fountain code data of an encoder;

[0173] Performing fountain code encoding processing on corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node;

[0174] A data deployment request is sent to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group.

[0175] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.

[0176] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0177] Since the computer program stored in the computer-readable storage medium can execute any one of the media data deployment methods provided in the embodiments of the present application, the beneficial effects that can be achieved by any one of the media data deployment methods provided in the embodiments of the present application can be achieved. Please refer to the previous embodiments for details and will not be repeated here.

[0178] According to one aspect of the present application, a computer program product or a computer program is also provided, the computer program product or the computer program includes a computer instruction, and the computer instruction is stored in a computer-readable storage medium. The processor of the computer device reads the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the computer device executes the method provided in various optional implementations in the above embodiments.

[0179] In the above-mentioned embodiments of the media data deployment device, computer-readable storage medium, media data deployment system, and computer program product, the description of each embodiment has its own emphasis. For the parts not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process and beneficial effects of the above-described media data deployment device, computer-readable storage medium, computer program product, media data deployment system, and corresponding units can refer to the description of the media data deployment method in the above embodiment, and will not be repeated here.

[0180] The above is a detailed introduction to a media data deployment method, system, device, computer equipment, computer-readable storage medium and computer program product provided in the embodiments of the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for technical personnel in this field, according to the ideas of the present application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A media data deployment method, It is characterized in that The media data deployment method comprises: Acquire media data to be deployed to a content distribution network, the content distribution network comprising at least two nodes, the media data comprising at least one media data slice; The nodes are grouped according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake; Selecting a seed node from the target node group, the seed node is used to receive fountain code data of an encoder; Performing fountain code encoding processing on corresponding media data slices according to the fountain code identifier corresponding to the target node group by the encoder to obtain fountain code data, and deploying the fountain code data to the seed node; Sending a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group; The step of grouping the nodes according to the fragmentation information of the media data and the node parameters of the nodes to obtain a target node group includes: Determine the total number of fragments of each data block corresponding to the media data according to the fragment information of the media data, and determine the target number of groups according to the total number of fragments; Determine the location information and network status information corresponding to each node according to the node parameters of the node; Dividing all nodes in the content distribution network into a target grouping number of target node groups according to the location information and the network status information; The step of dividing all nodes in the content distribution network into a target group or a plurality of target node groups according to the location information and the network status information includes: Determine the distance between every two adjacent nodes according to the position information corresponding to every two adjacent nodes, and determine the average distance between two adjacent nodes according to the distance between every two adjacent nodes; Based on the network status information, determine the network bandwidth corresponding to each node, and divide all nodes in the content distribution network into a target group of reference node groups according to the network bandwidth, and the total network bandwidth of each reference node group is within a preset bandwidth range; Based on the average distance and the position information, the reference node group is adjusted to obtain a target node group, and the distance between adjacent nodes of each target node group is within a preset distance range.

2. The media data deployment method according to claim 1, It is characterized in that The selecting a seed node from the target node group includes: Calculating a capability score value corresponding to each node according to the position information of the encoder and the node parameters of each node in the target node group; The capability score values ​​corresponding to each node are compared, and the node with the largest capability score value is selected as the seed node corresponding to the target node group.

3. The media data deployment method according to claim 2, It is characterized in that The step of calculating the capability score value corresponding to each node according to the position information of the encoder and the node parameters of each node in the target node group includes: Based on the node parameters of each node in the target node group and the preset standardization rules, a bandwidth standardization value, a failure rate standardization value, a packet loss rate standardization value and an average delay standardization value corresponding to each node are obtained; Calculate the reference capability score corresponding to each node based on the bandwidth normalized value, the failure rate normalized value, the packet loss rate normalized value, the average delay normalized value and the preset weight; Determine a distance score value corresponding to each node based on the position information of the encoder, the position information of each node, and a mapping relationship between a preset distance and a score value; The corresponding reference ability score value is adjusted by the distance score value corresponding to each node to obtain the ability score value corresponding to each node.

4. The media data deployment method according to claim 1, It is characterized in that Before sending the data deployment request to the seed node, the method includes: Taking the seed node as the starting point, and combining with the remaining nodes in the target node group, a deployment path set is constructed; Calculate the deployment cost corresponding to each deployment path according to the cost information and network performance indicator information of each deployment path in the deployment path set; The deployment path with the minimum deployment cost in the deployment path set is determined as a target path, and a data deployment request is generated based on the target path.

5. The media data deployment method according to any one of claims 1 to 4, It is characterized in that After sending the data deployment request to the seed node, the method further comprises: In response to a data acquisition instruction of the client, acquiring location information and network information corresponding to the client; Based on the location information and the network information, a target node is selected in each of the target node groups, and corresponding fountain code data is sent to the client through the target node.

6. A media data deployment device, It is characterized in that The device comprises: An acquisition unit, configured to acquire media data to be deployed to a content distribution network, wherein the content distribution network includes at least two nodes, and the media data includes at least one media data slice; a grouping unit, configured to group the nodes according to the fragment information of the media data and the node parameters of the nodes to obtain a target node group, wherein the nodes in the target node group are assigned the same fountain coding identifier, and the fountain coding identifier indicates the media data fragment to be encoded that the node needs to undertake; A selection unit, used for selecting a seed node from the target node group, wherein the seed node is used for receiving fountain code data of an encoder; A first deployment unit is configured to perform fountain code encoding processing on corresponding media data fragments according to the fountain code identifier corresponding to the target node group through the encoder to obtain fountain code data, and deploy the fountain code data to the seed node; A second deployment unit, configured to send a data deployment request to the seed node, wherein the data deployment request instructs the seed node to deploy the fountain code data to nodes other than the seed node in the target node group; The grouping unit is further used to determine the total number of fragments of each data block corresponding to the media data according to the fragmentation information of the media data, and determine the target number of groups according to the total number of fragments; Determine the location information and network status information corresponding to each node according to the node parameters of the node; Dividing all nodes in the content distribution network into a target grouping number of target node groups according to the location information and the network status information; The grouping unit is further used to determine the distance between every two adjacent nodes according to the position information corresponding to every two adjacent nodes, and determine the average distance between two adjacent nodes according to the distance between every two adjacent nodes; Based on the network status information, determine the network bandwidth corresponding to each node, and divide all nodes in the content distribution network into a target group of reference node groups according to the network bandwidth, and the total network bandwidth of each reference node group is within a preset bandwidth range; Based on the average distance and the position information, the reference node group is adjusted to obtain a target node group, and the distance between adjacent nodes of each target node group is within a preset distance range.

7. A computer device, It is characterized in that The computer device is configured with a processor and a memory, the memory stores a plurality of computer programs, and the processor loads the computer programs from the memory to execute the steps of the media data deployment method according to any one of claims 1-5.

8. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a plurality of computer programs, and the computer programs are suitable for being loaded by a processor to execute the steps of the media data deployment method according to any one of claims 1 to 5.