A method, device and computer equipment for managing pre-promotion content

Abstract

The present invention discloses a pre-pushing content management method, device and computer equipment, wherein the pre-pushing content management method is applied to an edge node, and the method comprises: determining the matching degree between the pre-pushing content in a designated storage space and the content requested by a user; when the matching degree meets a preset condition, obtaining a pre-pushing content list from a pre-pushing server; the pre-pushing content list comprises a pre-pushing content identifier; obtaining and storing the pre-pushing content matching the pre-pushing content identifier from a content distribution network. The present invention triggers the update of the pre-pushing content by the matching degree between the pre-pushing content in the designated storage space and the content requested by the user, which can maximize the utilization of the uplink bandwidth of the edge node and improve the utilization rate of bandwidth resources.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method, device and computer equipment for managing pre-promotion content. Background Art

[0002] CDN (Content Delivery Network) is an intelligent virtual network built on the existing network. It relies on edge servers deployed in various places and uses the load balancing, content distribution, scheduling and other functional modules of the central platform to enable users to obtain the required content from the nearest edge server, reduce network congestion, and improve user access response speed and hit rate.

[0003] However, the cost of CDN bandwidth is relatively high. In order to save CDN bandwidth and improve user experience when the CDN bandwidth is insufficient to support user requests, a content distribution method based on edge nodes such as APP clients, routers, and switches has emerged in the relevant technology. Different from the CDN content distribution method in which the required data is provided to users through the edge server, this edge node content distribution method transfers the pre-pushed content from the CDN to the edge node in advance, and subsequently responds to the user's content request from the edge node, and the edge node provides the user with the required data, thereby achieving the effect of saving CDN bandwidth and improving user experience.

[0004] In the related art, the update of the pre-pushed content stored in the edge node is mainly triggered by the available storage space of the edge node, that is, the update is performed only when the available storage space is sufficient, and no update is performed when the available storage space is insufficient, which makes it impossible to maximize the utilization of the uplink bandwidth of the edge node, resulting in a waste of bandwidth resources. Summary of the invention

[0005] In order to solve the problems of the prior art, the embodiments of the present invention provide a method, device and computer equipment for managing pre-promoted content. The technical solution is as follows:

[0006] On the one hand, a pre-pushing content management method is provided, which is applied to an edge node, and the method includes:

[0007] At every preset time interval, determining the degree of match between the pre-promoted content in the designated storage space and the content requested by the user;

[0008] When the matching degree meets a preset condition, obtaining a pre-push content list from a pre-push server; the pre-push content list includes a pre-push content identifier;

[0009] The pre-promoted content matching the pre-promoted content identifier is obtained from a content distribution network and stored.

[0010] Optionally, when the matching degree satisfies a preset condition, obtaining a pre-push content list from a pre-push server includes:

[0011] Sending the matching degree to a pre-push server, so that the pre-push server determines whether the matching degree meets a preset condition, and returns a pre-push content list if the result of the determination is yes;

[0012] The pre-push content list returned by the pre-push server is received.

[0013] Optionally, when the matching degree satisfies a preset condition, obtaining a pre-push content list from a pre-push server includes:

[0014] Determining whether the matching degree meets a preset condition;

[0015] When the result of the judgment is yes, sending a pre-push content acquisition request to the pre-push server, so that the pre-push server returns a pre-push content list according to the pre-push content acquisition request;

[0016] The pre-push content list returned by the pre-push server is received.

[0017] On the other hand, a pre-pushing content management device is provided, which is applied to an edge node, and the device includes:

[0018] A first determination module, configured to determine, at every preset time interval, a degree of match between the pre-recommended content in the designated storage space and the content requested by the user;

[0019] A first acquisition module, configured to acquire a pre-push content list from a pre-push server when the matching degree meets a preset condition; the pre-push content list includes a pre-push content identifier;

[0020] The second acquisition module is used to acquire and store the pre-promoted content matching the pre-promoted content identifier from the content distribution network.

[0021] Optionally, the first acquisition module includes:

[0022] A first sending module, configured to send the matching degree to a pre-push server, so that the pre-push server determines whether the matching degree meets a preset condition, and returns a pre-push content list if the result of the determination is yes;

[0023] The first receiving module is configured to receive the pre-push content list returned by the pre-push server.

[0024] Optionally, the first acquisition module includes:

[0025] A first judgment module, used to judge whether the matching degree meets a preset condition;

[0026] a second sending module, configured to send a pre-push content acquisition request to the pre-push server when the result of the determination by the first determining module is yes, so that the pre-push server returns a pre-push content list according to the pre-push content acquisition request;

[0027] The second receiving module is configured to receive the pre-push content list returned by the pre-push server.

[0028] Optionally, the second acquisition module includes:

[0029] a selection module, configured to select a target pre-pushed content identifier from the pre-pushed content identifiers in the pre-pushed content list, wherein the target pre-pushed content identifier is the pre-pushed content identifier that is not matched with the pre-pushed content in the designated storage space;

[0030] The third acquisition module is used to acquire and store the target pre-promoted content matching the target pre-promoted content identifier from the content distribution network.

[0031] Optionally, the third acquisition module includes:

[0032] A second determining module is used to determine the total data capacity of the target pre-pushing content corresponding to the target pre-pushing content identifier;

[0033] A second determination module, used to determine whether the remaining storage space of the designated storage space matches the total data capacity;

[0034] A first recycling module, configured to recycle the storage space occupied by the pre-promoted content in the designated storage space when the result of the judgment of the second judgment module is no;

[0035] The fourth acquisition module is used to acquire and store the target pre-pushed content from a content distribution network according to the remaining storage space and the recovered storage space.

[0036] Optionally, the first recovery module includes:

[0037] A third determining module is used to determine the overdue pre-promoted content in the designated storage space; the overdue pre-promoted content includes the pre-promoted content whose storage time in the designated storage space exceeds a preset time;

[0038] a fourth determining module, configured to determine a sum of the storage space occupied by the overdue pre-promoted content and the remaining storage space to obtain a first storage space capacity;

[0039] A third judgment module, used to judge whether the capacity of the first storage space matches the total data capacity;

[0040] The first recycling submodule is used to recycle the storage space occupied by the overdue pre-promoted content when the result of the judgment of the third judgment module is yes.

[0041] Optionally, the first recovery module further includes:

[0042] A fourth judgment module is used to judge whether a protection mode is set for the non-overdue pre-promoted content in the designated storage space when the capacity of the first storage space does not match the total data capacity; the non-overdue pre-promoted content includes the pre-promoted content whose storage time in the designated storage space does not exceed a preset time;

[0043] The second recycling submodule is used to recycle the storage space occupied by the overdue pre-promoted content and the storage space occupied by the non-overdue pre-promoted content in sequence when the result of the judgment of the fourth judgment module is no.

[0044] Optionally, the first recovery module further includes:

[0045] The third recycling submodule is used to recycle the storage space occupied by the expired pre-promoted content when the judgment result is that the protection mode is set for the non-expired pre-promoted content in the designated storage space.

[0046] Optionally, the first recycling submodule, the second recycling submodule and the third recycling submodule include:

[0047] A fifth determination module, configured to determine a first contribution value of each of the overdue pre-recommended contents to the matching degree;

[0048] a sixth determining module, configured to determine, according to the first contribution value, an elimination priority of the overdue pre-promoted content;

[0049] The first priority recovery module is used to recover the storage space occupied by the overdue pre-promoted content according to the elimination priority of the overdue pre-promoted content.

[0050] Optionally, the second recovery submodule further includes:

[0051] a seventh determination module, configured to determine a difference between the total data capacity and the first storage space capacity, and obtain a storage space capacity to be reclaimed;

[0052] An eighth determination module, configured to determine a second contribution value of each of the non-overdue pre-recommended contents to the matching degree;

[0053] a ninth determination module, configured to determine, according to the second contribution value, an elimination priority of the pre-promoted content that has not expired;

[0054] The second priority recycling module is used to recycle the storage space occupied by the non-overdue pre-promoted content according to the elimination priority of the non-overdue pre-promoted content, until the capacity of the recycled storage space matches the capacity of the storage space to be recycled.

[0055] On the other hand, a computer device is provided, including a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set or an instruction set, and the at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by the processor to implement the above-mentioned pre-push content management method.

[0056] On the other hand, a computer-readable storage medium is provided, wherein at least one instruction, at least one program, a code set or an instruction set is stored in the storage medium, and the at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by a processor to implement the pre-push content management method as described above.

[0057] The edge node of the embodiment of the present invention determines the matching degree between the pre-pushed content in the designated storage space and the content requested by the user, obtains the pre-pushed content list from the pre-pushed server when the matching degree meets the preset condition, and then obtains and stores the pre-pushed content matching the pre-pushed content identifier in the pre-pushed content list from the content distribution network, thereby realizing the update of the pre-pushed content triggered by the matching degree between the pre-pushed content in the designated storage space and the content requested by the user, which can maximize the use of the uplink bandwidth of the edge node and improve the utilization rate of bandwidth resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0059] Figure 1 is a schematic diagram of an implementation environment provided by an embodiment of the present invention;

[0060] Figure 2 It is a flowchart of a method for managing pre-pushing content provided by an embodiment of the present invention;

[0061] Figure 3 This is a schematic diagram of a process for measuring the uplink bandwidth of an edge node provided by an embodiment of the present invention;

[0062] Figure 4 It is a schematic diagram of a process of acquiring and storing target pre-pushed content matching the target pre-pushed content identifier from a content distribution network provided by an embodiment of the present invention;

[0063] Figure 5 It is a schematic diagram of a flow chart of reclaiming the storage space occupied by the pre-promoted content in the specified storage space provided by an embodiment of the present invention;

[0064] Figure 6 This is a schematic diagram of a process for reclaiming storage space occupied by pre-promoted content that has not expired, provided by an embodiment of the present invention;

[0065] Figure 7 It is a structural schematic diagram of a pre-pushing content management device provided by an embodiment of the present invention;

[0066] Figure 8 The present invention provides a hardware structure block diagram of a computer device. DETAILED DESCRIPTION

[0067] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0068] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or server that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

[0069] See also Figure 1 , which is a schematic diagram of an implementation environment provided by an embodiment of the present invention, the implementation environment may include a content distribution network CDN 110, a pre-push server 120 and an edge node 130.

[0070] The content distribution network CDN 110 is a distributed server system built on the Internet, which can receive content requests from users and transfer the content requests from users to the edge node 130 through the distribution platform. The content distribution network CDN 110 can also store various content requested by users, which may include multimedia content such as audio, video, etc.

[0071] The pre-push server 120 may be a server that provides a pre-push content list service. In the embodiment of this specification, the pre-push content refers to the content cached in the edge node 130 to be distributed to the user. The pre-push server 120 may be an independent server or a server cluster composed of multiple servers.

[0072] The edge node 130 may be a terminal device for pushing data to a user, and the terminal device may include, but is not limited to, a client 131, a router 132, a switch 133, etc., wherein the client may be a hardware device with various operating systems such as a smart phone, a desktop computer, a tablet computer, a laptop computer, or a software configured in the above hardware device, such as an application. An edge node may correspond to multiple users, and sending pre-pushed content to the multiple users means providing data upload to the multiple users.

[0073] The edge node 130 may communicate with the content delivery network CDN 110 and the pre-push server 120 through a network, which may be a wired network or a wireless network.

[0074] See also Figure 2 , which is a flow chart of a method for managing pre-pushing content provided by an embodiment of the present invention, which can be applied to Figure 1 The edge nodes in the embodiment. It should be noted that this specification provides method operation steps as described in the embodiments or flowcharts, but more or fewer operation steps may be included based on routine or non-creative work. The order of steps listed in the embodiments is only one way of executing the steps among many orders, and does not represent the only order of execution. When the actual system or product is executed, it can be executed in sequence or in parallel according to the method shown in the embodiments or drawings (for example, in a parallel processor or multi-threaded processing environment). Specifically, Figure 2 As shown, the method may include:

[0075] S201, determining a matching degree between the pre-recommended content in a designated storage space and the content requested by the user.

[0076] The designated storage space may be a cache space locally used by the edge node to store the pre-pushed content. In practical applications, the edge node may calculate an indicator reflecting the degree of match between the pre-pushed content in the designated storage space and the content requested by the user at a preset time interval, and characterize the degree of match between the two through the indicator, which may be the uplink bandwidth ratio of the edge node or the number of user requests per unit time received by the edge node in the recent period, etc.

[0077] In a specific embodiment, the uplink bandwidth ratio of the edge node is used to characterize the matching degree between the pre-promoted content in the specified storage space and the content requested by the user. The uplink bandwidth ratio of the edge node is the ratio of the uplink bandwidth of the edge node to the total uplink throughput, as shown in the following formula (1):

[0078]

[0079] Among them, BW represents the uplink bandwidth of the edge node; TO represents the total uplink throughput of the edge node.

[0080] Specifically, the uplink bandwidth BW of the edge node refers to the maximum uplink throughput that the edge node can provide, which is generally determined by the network operator and the unit can be bps (bits per second). The total uplink throughput TO of the edge node refers to the data transmission rate when the edge node actually transmits data to the user, which generally does not exceed the uplink bandwidth of the edge node and the unit can be bps (bits per second).

[0081] For the uplink bandwidth BW of the edge node, the maximum upload that the physical hardware of the edge node can provide under permitted conditions can be measured. This maximum upload may be limited by the network card, CPU (Central Processing Unit), and the operator's uplink. In a specific embodiment, Figure 3 As shown, a bandwidth measurement server can be deployed, and the edge node periodically sends a specific amount of data S to the bandwidth measurement server. The bandwidth measurement server counts the receiving time T of the data amount S, calculates the ratio S / T of the data amount S to the receiving time T, and returns the ratio S / T as the uplink bandwidth BW of the edge node to the edge node. The edge node updates the value of the uplink bandwidth BW according to the measurement result returned by the bandwidth measurement server.

[0082] The total uplink throughput of the edge node can be obtained by accumulating the data transmission rates of all uploaded data objects within a preset time period. It should be noted that in the embodiments of this specification, uplink refers to the edge node transmitting data to the user, and uploaded data objects refer to the data objects transmitted by the edge node to the user.

[0083] S203: When the matching degree meets a preset condition, obtain a pre-push content list from a pre-push server; the pre-push content list includes a pre-push content identifier.

[0084] In the embodiments of the present specification, the preset condition is used to characterize that the maximum utilization of the uplink bandwidth of the edge node has not been achieved. It can be set according to an indicator that characterizes the matching degree. For example, when the uplink bandwidth ratio is used to characterize the matching degree, the preset condition can be less than the preset uplink bandwidth ratio. That is, when the actually calculated uplink bandwidth ratio is less than the preset uplink bandwidth ratio, it indicates that the maximum utilization of the uplink bandwidth of the edge node has not been achieved. It is considered that the matching degree meets the preset condition, and the pre-push content list can be obtained from the pre-push server.

[0085] In practical applications, the method of obtaining the pre-recommended content list from the pre-recommended server when the matching degree meets the preset condition includes at least one of the following methods:

[0086] Method 1: The edge node sends the matching degree to the pre-push server, so that the pre-push server determines whether the matching degree meets the preset conditions, and returns the pre-push content list when the result of the judgment is yes; accordingly, the edge node receives the pre-push content list returned by the pre-push server. Taking the uplink bandwidth proportion R as an example to represent the matching degree, the edge node sends the uplink bandwidth proportion R calculated according to the preset time interval to the pre-push server, and the pre-push server receives the uplink bandwidth proportion R and determines whether the uplink bandwidth proportion R is less than the preset uplink bandwidth proportion R′. When the result of the judgment is that the uplink bandwidth proportion R is less than the preset uplink bandwidth proportion R′, the pre-push server returns the pre-push content list to the edge node, and the edge node receives the pre-push content list returned by the pre-push server.

[0087] Method 2: After calculating the uplink bandwidth ratio R, the edge node determines whether the uplink bandwidth ratio R meets the preset conditions; when the result of the judgment is yes, it sends a pre-push content acquisition request to the pre-push server, so that the pre-push server returns the pre-push content list according to the pre-push content acquisition request; accordingly, the edge node receives the pre-push content list returned by the pre-push server. Taking the uplink bandwidth ratio R as an example to represent the matching degree, after calculating the uplink bandwidth ratio R, the edge node determines whether the uplink bandwidth ratio R is less than the preset uplink bandwidth ratio R′. When the result of the judgment is that the uplink bandwidth ratio R is less than the preset uplink bandwidth ratio R′, the edge node sends a pre-push content acquisition request to the pre-push server, the pre-push server receives the pre-push content acquisition request, and returns the pre-push content list to the edge node according to the pre-push content acquisition request, and the edge node receives the pre-push content list returned by the pre-push server.

[0088] In the embodiment of the present specification, the pre-pushing content list returned by the pre-pushing server includes a pre-pushing content identifier, which is used to uniquely identify a pre-pushing content. In practical applications, the pre-pushing server can count the number of requests for each content recently, and generate a pre-pushing content list based on the content identifiers corresponding to the content with the highest number of requests. For example, the pre-pushing server can count the number of views of each video in the previous day, and generate a pre-pushing content list based on the video identifiers corresponding to the top N videos with the highest number of views.

[0089] It can be understood that the pre-pushed content list may also include attribute information of the pre-pushed content corresponding to the pre-pushed content identifier, and the attribute information may include but is not limited to the size of the pre-pushed content, the cache address of the pre-pushed content in the CDN, and the like.

[0090] S205: Acquire and store the pre-promoted content matching the pre-promoted content identifier from a content distribution network.

[0091] Specifically, after receiving the pre-push content list returned by the pre-push server, the edge node may download and store the pre-push content corresponding to the pre-push content identifier in the pre-push content list from the content distribution network according to the pre-push content list.

[0092] In a specific embodiment, the edge node can select a target pre-pushed content identifier from the pre-pushed content identifiers in the pre-pushed content list, the target pre-pushed content identifier being a pre-pushed content identifier that is not matched to the pre-pushed content in the designated storage space of the edge node; the edge node obtains and stores the target pre-pushed content that matches the target pre-pushed content identifier from the content distribution network, thereby avoiding repeated downloading of the pre-pushed content that is already locally available. That is, the edge node can generate an existing pre-pushed content list based on the pre-pushed content that is already available in the designated storage space, and the existing pre-pushed content list includes the pre-pushed content identifiers of the pre-pushed content that is already available in the designated storage space. After receiving the pre-push content list returned by the pre-push server, the edge node compares the pre-push content identifiers in the pre-push content list with the pre-push content identifiers in the existing pre-push content list, and removes the pre-push content identifiers in the existing pre-push content list from the pre-push content list, thereby obtaining a target pre-push content list, the target pre-push content list including the pre-push content identifiers of the pre-push content that is not available in the designated storage space, namely, the target pre-push content identifiers, so that only the target pre-push content corresponding to the target pre-push content identifiers is subsequently downloaded and stored from the content distribution network.

[0093] In actual applications, the number of target pre-push content identifiers in the target pre-push content list can also be set, for example, the number of target pre-push content identifiers is set to M, and subsequently only the target pre-push contents corresponding to the M target pre-push content identifiers are obtained and stored from the content distribution network.

[0094] The above-mentioned scheme implemented by the present invention can timely update and adjust the pre-pushed content in the edge node whose total uplink throughput is not good enough, until the total uplink throughput of the edge node is good enough, and finally all edge nodes can obtain a good enough uplink throughput, so as to maximize the utilization of the uplink bandwidth of each edge node.

[0095] In the embodiments of this specification, it is possible to use Figure 4 The method in the embodiment of the present invention implements the step of acquiring and storing the target pre-pushing content matching the target pre-pushing content identifier from the content distribution network, such as Figure 4 As shown, the method may include:

[0096] S401, determining the total data capacity of the target pre-pushing content corresponding to the target pre-pushing content identifier.

[0097] Specifically, the edge node may calculate the sum of the sizes of the target pre-pushed contents corresponding to the target pre-pushed content identifiers, thereby obtaining the total data capacity of the target pre-pushed contents corresponding to the target pre-pushed content identifiers.

[0098] S403, determine whether the remaining storage space of the designated storage space matches the total data capacity. When the determination result is no, execute steps S405 to 407; when the determination result is yes, execute step S409.

[0099] In an embodiment of the present specification, the edge node can determine the storage space capacity that has been occupied by the designated storage space based on the size of the pre-promoted content already in the designated storage space, and calculate the difference between the total capacity of the designated storage space and the occupied storage space capacity, thereby obtaining the unoccupied storage space capacity in the designated storage space, that is, the remaining storage space, and further determine whether the remaining storage space matches the above-mentioned total data capacity.

[0100] Specifically, when the capacity of the remaining storage space is greater than or equal to the above-mentioned total data capacity, it is determined that the remaining storage space matches the above-mentioned total data capacity; conversely, when the capacity of the remaining storage space is less than the above-mentioned total data capacity, it is determined that the remaining storage space does not match the above-mentioned total data capacity.

[0101] S405: Reclaim the storage space occupied by the pre-promoted content in the designated storage space.

[0102] Specifically, when the capacity of the remaining storage space is smaller than the total data capacity, the existing pre-promoted content in the designated storage space may be deleted to reclaim the storage space occupied by the existing pre-promoted content.

[0103] In actual applications, the storage space occupied by the pre-pushed content can be reclaimed according to the survival timestamp of the pre-pushed content in the specified storage space. That is, when reclaiming the storage space, it is determined whether the pre-pushed content has expired according to the survival timestamp of each pre-pushed content. If it has expired, the pre-pushed content is deleted to reclaim the storage space occupied by it. Among them, the storage timestamp can be determined according to the preset life cycle corresponding to each pre-pushed content. The preset life cycle can be set as needed, for example, it can be set to 7 days. The edge node sets a "survival timestamp" for the corresponding pre-pushed content according to the preset life cycle.

[0104] Obviously, the above-mentioned method of reclaiming the storage space occupied by the pre-pushed content based on the survival timestamp of the pre-pushed content has the following defects: when the pre-pushed content becomes unpopular content (i.e. content with a popularity lower than a certain popularity threshold), the storage space occupied by it cannot be reclaimed because its preset life cycle is too long; when the pre-pushed content becomes popular content (i.e. content with a popularity reaching a certain popularity threshold), it will be deleted to reclaim the storage space occupied by it because its preset life cycle is too short. In order to effectively avoid the storage space occupied by unpopular content being unable to be reclaimed due to its long life cycle, and to effectively avoid the deletion of popular content due to its short life cycle, in the embodiments of this specification, it can be adopted Figure 5 The method in is used to reclaim the storage space occupied by the pre-pushed content in the specified storage space, such as Figure 5 As shown, the method may include:

[0105] S501, determining the overdue pre-promoted content in the designated storage space; the overdue pre-promoted content includes the pre-promoted content whose storage time in the designated storage space exceeds a preset time.

[0106] In the embodiment of the present specification, in the list of pre-pushed content returned by the pre-pushing server, the attribute information of the pre-pushed content corresponding to the pre-pushing content identifier may also include the protection period of the pre-pushing content, for example, the protection period is H hours. The edge node may record the storage duration of each existing pre-pushed content in the designated storage space, and compare the storage duration with the protection period of the existing pre-pushed content. When the storage duration exceeds the protection period, the existing pre-pushed content is determined to be an overdue pre-pushed content. On the contrary, when the storage duration does not exceed the protection period, the existing pre-pushed content is determined to be a non-overdue pre-pushed content.

[0107] S503: Determine the sum of the storage space occupied by the overdue pre-promoted content and the remaining storage space to obtain a first storage space capacity.

[0108] The edge node may count the capacity of the storage space occupied by all the overdue pre-promoted contents in the designated storage space, and calculate the sum of the capacity of the storage space occupied by all the overdue pre-promoted contents and the capacity of the remaining storage space to obtain the first storage space capacity.

[0109] S505, determine whether the capacity of the first storage space matches the total data capacity. If the result of the determination is yes, execute step S507; otherwise, execute steps S509 to S511.

[0110] Specifically, the edge node determines whether the capacity of the first storage space is greater than or equal to the total data capacity of the above-mentioned target pre-promoted content. If the capacity of the first storage space is greater than or equal to the total data capacity of the above-mentioned target pre-promoted content, it is determined that the first storage space capacity matches the total data capacity; conversely, if the capacity of the first storage space is less than the total data capacity of the above-mentioned target pre-promoted content, it is determined that the first storage space capacity does not match the total data capacity.

[0111] S507: Reclaim the storage space occupied by the overdue recommended content.

[0112] Specifically, when the capacity of the first storage space matches the total data volume of the target pre-promoted content, it indicates that the capacity of the first storage space can accommodate the target pre-promoted content. At this time, the overdue pre-promoted content can be deleted to reclaim the storage space occupied by the overdue pre-promoted content.

[0113] In actual applications, when reclaiming the storage space occupied by overdue pre-promoted content, there are two situations:

[0114] The first case: the capacity of the first storage space is equal to the total data capacity of the above-mentioned target pre-promoted content, that is, the storage space occupied by all overdue pre-promoted content and the remaining storage space can just accommodate the target pre-promoted content. At this time, all overdue pre-promoted content needs to be deleted to reclaim the storage space occupied by all overdue pre-promoted content. Since all overdue pre-promoted content will be deleted, it is meaningless to consider the priority of elimination when deleting. All overdue pre-promoted content can be deleted at once, or deleted randomly, or deleted in other ways. There are no restrictions in this case.

[0115] The second situation: the capacity of the first storage space is greater than the total data capacity of the above-mentioned target pre-promoted content. In this case, there is no need to delete all the overdue pre-promoted content. At this time, you can consider reclaiming the storage space occupied by the overdue pre-promoted content based on the elimination priority of the overdue pre-promoted content.

[0116] In a specific embodiment, the edge node determines a first contribution value of each overdue pre-promoted content to the matching degree. Specifically, for each overdue pre-promoted content, the edge node can accumulate the uplink data rate of the overdue pre-promoted content within a preset time period to obtain the individual resource uplink throughput corresponding to each overdue pre-promoted content, calculate the ratio of the individual resource uplink throughput to the total uplink throughput, and thus obtain the first contribution value of each overdue pre-promoted content to the uplink bandwidth ratio.

[0117] The edge node determines the elimination priority of the overdue pre-promoted content based on the above-mentioned first contribution value. Specifically, the smaller the first contribution value, the less popular the corresponding overdue pre-promoted content is, and the higher its elimination priority is; conversely, the larger the first contribution value, the more popular the corresponding overdue pre-promoted content is, and the lower its elimination priority is.

[0118] The edge node reclaims the storage space occupied by the overdue pre-promoted content according to the elimination priority of the overdue pre-promoted content. Specifically, the edge node may delete the overdue pre-promoted content according to the elimination priority from high to low to reclaim the occupied storage space, and stop deleting the overdue pre-promoted content when the sum of the recovered storage space and the remaining storage space can accommodate the target pre-promoted content.

[0119] S509, when the capacity of the first storage space does not match the total data capacity, determine whether a protection mode is set for the non-expired pre-promoted content in the designated storage space. If the result of the determination is no, execute step S511; otherwise, execute step S507.

[0120] The non-overdue pre-promoted content includes pre-promoted content whose storage time in the designated storage space does not exceed a preset time. The protection mode is used to forcibly retain the pre-promoted content in the designated storage space within the protection period and not allow deletion thereof.

[0121] In the embodiment of the present specification, when the capacity of the first storage space does not match the total data capacity of the above-mentioned target pre-promoted content, it indicates that only reclaiming the storage space occupied by the overdue pre-promoted content is still insufficient to accommodate the target pre-promoted content. At this time, it is possible to consider reclaiming the storage space occupied by the pre-promoted content that has not expired. Whether the storage space occupied by the pre-promoted content that has not expired can be reclaimed needs to consider whether a protection mode is set for the pre-promoted content that has not expired. If the edge node sets a protection mode for the pre-promoted content that has not expired, it indicates that the pre-promoted content within the protection period cannot be deleted to reclaim the storage space it occupies; if the edge node does not set a protection mode for the pre-promoted content that has not expired, it indicates that no mandatory protection is performed on the pre-promoted content that is within the protection period, and it can be deleted when the conditions are met.

[0122] S511, reclaiming the storage space occupied by the overdue pre-promoted content and the storage space occupied by the non-overdue pre-promoted content in sequence.

[0123] The storage space occupied by the overdue pre-promoted content can be recovered by deleting all the overdue pre-promoted content at once, or by deleting them randomly, or by deleting them in other ways until the storage space occupied by all the overdue pre-promoted content is recovered.

[0124] The storage space occupied by the unexpired pre-promoted content can be recovered by Figure 6 Methods such as Figure 6 As shown, the method may include:

[0125] S601, determine the difference between the total data capacity and the first storage space capacity to obtain the storage space capacity to be reclaimed.

[0126] S603: Determine a second contribution value of each of the non-overdue recommended contents to the matching degree.

[0127] Specifically, for each non-expired pre-pushed content, the edge node can accumulate the uplink data rate of the non-expired pre-pushed content within a preset time period, obtain the individual resource uplink throughput corresponding to each non-expired pre-pushed content, calculate the ratio of the individual resource uplink throughput to the total uplink throughput, and thus obtain the second contribution value of each non-expired pre-pushed content to the uplink bandwidth.

[0128] S605: Determine the elimination priority of the non-overdue pre-promoted content according to the second contribution value.

[0129] Specifically, the smaller the second contribution value is, the less popular the corresponding non-overdue pre-promoted content is, and the higher its elimination priority is; conversely, the larger the second contribution value is, the more popular the corresponding overdue pre-promoted content is, and the lower its elimination priority is.

[0130] S607: Reclaim the storage space occupied by the non-expired pre-promoted content according to the elimination priority of the non-expired pre-promoted content, until the capacity of the reclaimed storage space matches the capacity of the storage space to be reclaimed.

[0131] Specifically, the edge node may delete the non-expired pre-promoted content according to the elimination priority from high to low to reclaim the occupied storage space, and stop deleting the non-expired pre-promoted content when the reclaimed storage space capacity matches the storage space capacity to be reclaimed.

[0132] S513: When the result of the judgment is that the protection mode is set for the non-expired pre-promoted content in the designated storage space, the storage space occupied by the expired pre-promoted content is reclaimed.

[0133] In the embodiment of the present specification, if the edge node sets a protection mode for the pre-promoted content that has not expired, it means that the pre-promoted content within the protection period cannot be deleted to reclaim the storage space it occupies, and only the storage space occupied by the pre-promoted content that has expired can be reclaimed. At this time, all the pre-promoted content that has expired can be deleted at once, or deleted randomly, or deleted in other ways until the storage space occupied by all the pre-promoted content that has expired is reclaimed. Subsequently, the target pre-promoted content is downloaded according to the storage space actually recovered and the remaining storage space, that is, at this time, only the target pre-promoted content with a data capacity that matches the storage space actually recovered and the remaining storage space (i.e., the capacity of the first storage space) can be downloaded.

[0134] S407: Acquire and store the target pre-promoted content from a content distribution network according to the remaining storage space and the recovered storage space.

[0135] Specifically, the target pre-pushed content may be acquired and stored from the content distribution network according to the total capacity of the remaining storage space and the recovered storage space.

[0136] S409: Acquire and store the target pre-promoted content from a content distribution network according to the remaining storage space.

[0137] Specifically, when the remaining storage space matches the total data capacity, it indicates that the designated storage space has enough remaining storage space for storing the target pre-promoted content. In this case, the target pre-promoted content can be directly acquired and stored in the remaining storage space.

[0138] It can be seen from the above technical solution of the present invention that the edge node of the embodiment of the present invention determines the matching degree between the pre-pushed content in the designated storage space and the content requested by the user, and obtains the pre-pushed content list from the pre-pushed server when the matching degree meets the preset condition, and then obtains and stores the pre-pushed content matching the pre-pushed content identifier in the pre-pushed content list from the content distribution network, thereby realizing the update of the pre-pushed content triggered by the matching degree (such as the uplink bandwidth ratio) between the pre-pushed content in the designated storage space and the content requested by the user, which can maximize the use of the uplink bandwidth of the edge node and improve the utilization rate of bandwidth resources.

[0139] In addition, when reclaiming the storage space occupied by the pre-promoted content, the embodiment of the present invention determines the elimination priority based on the contribution of the pre-promoted content to the matching degree, and subsequently reclaims the storage space occupied by the corresponding pre-promoted content based on the elimination priority, thereby effectively avoiding the problem that the storage space occupied by unpopular content cannot be reclaimed due to its long life cycle, and effectively avoiding the problem that popular content is deleted due to its short life cycle.

[0140] Corresponding to the pre-push content management methods provided in the above-mentioned embodiments, an embodiment of the present invention further provides a pre-push content management device. Since the pre-push content management device provided in the embodiment of the present invention corresponds to the pre-push content management methods provided in the above-mentioned embodiments, the implementation methods of the aforementioned pre-push content management methods are also applicable to the pre-push content management device provided in this embodiment and will not be described in detail in this embodiment.

[0141] See also Figure 7 , which is a schematic diagram of the structure of a pre-pushing content management device provided by an embodiment of the present invention. The device has the function of implementing the pre-pushing content management method in the above method embodiment. The function can be implemented by hardware or by hardware executing corresponding software. The device can be applied to edge nodes. Figure 7 As shown, the device may include:

[0142] A first determination module 710 is used to determine the matching degree between the pre-recommended content in the specified storage space and the content requested by the user;

[0143] A first acquisition module 720 is configured to acquire a pre-push content list from a pre-push server when the matching degree satisfies a preset condition; the pre-push content list includes a pre-push content identifier;

[0144] The second acquisition module 730 is configured to acquire and store the pre-promoted content matching the pre-promoted content identifier from a content distribution network.

[0145] In some embodiments, the first acquisition module 720 may include:

[0146] A first sending module, configured to send the matching degree to a pre-push server, so that the pre-push server determines whether the matching degree meets a preset condition, and returns a pre-push content list if the result of the determination is yes;

[0147] The first receiving module is configured to receive the pre-push content list returned by the pre-push server.

[0148] In some other embodiments, the first acquisition module 720 may include:

[0149] A first judgment module, used to judge whether the matching degree meets a preset condition;

[0150] a second sending module, configured to send a pre-push content acquisition request to the pre-push server when the result of the determination by the first determining module is yes, so that the pre-push server returns a pre-push content list according to the pre-push content acquisition request;

[0151] The second receiving module is configured to receive the pre-push content list returned by the pre-push server.

[0152] In some embodiments, the second acquisition module 730 may include:

[0153] a selection module, configured to select a target pre-pushed content identifier from the pre-pushed content identifiers in the pre-pushed content list, wherein the target pre-pushed content identifier is the pre-pushed content identifier that is not matched with the pre-pushed content in the designated storage space;

[0154] The third acquisition module is used to acquire and store the target pre-promoted content matching the target pre-promoted content identifier from the content distribution network.

[0155] In some embodiments, the third acquisition module may include:

[0156] A second determining module is used to determine the total data capacity of the target pre-pushing content corresponding to the target pre-pushing content identifier;

[0157] A second determination module, used to determine whether the remaining storage space of the designated storage space matches the total data capacity;

[0158] A first recycling module, configured to recycle the storage space occupied by the pre-promoted content in the designated storage space when the result of the judgment of the second judgment module is no;

[0159] The fourth acquisition module is used to acquire and store the target pre-pushed content from a content distribution network according to the remaining storage space and the recovered storage space.

[0160] In some embodiments, the first recycling module may include:

[0161] A third determining module is used to determine the overdue pre-promoted content in the designated storage space; the overdue pre-promoted content includes the pre-promoted content whose storage time in the designated storage space exceeds a preset time;

[0162] a fourth determining module, configured to determine a sum of the storage space occupied by the overdue pre-promoted content and the remaining storage space to obtain a first storage space capacity;

[0163] A third judgment module, used to judge whether the capacity of the first storage space matches the total data capacity;

[0164] The first recycling submodule is used to recycle the storage space occupied by the overdue pre-promoted content when the result of the judgment of the third judgment module is yes.

[0165] In some other embodiments, the first recycling module may further include:

[0166] A fourth judgment module is used to judge whether a protection mode is set for the non-overdue pre-promoted content in the designated storage space when the capacity of the first storage space does not match the total data capacity; the non-overdue pre-promoted content includes the pre-promoted content whose storage time in the designated storage space does not exceed a preset time;

[0167] The second recycling submodule is used to recycle the storage space occupied by the overdue pre-promoted content and the storage space occupied by the non-overdue pre-promoted content in sequence when the result of the judgment of the fourth judgment module is no.

[0168] In some other embodiments, the first recycling module may further include:

[0169] The third recycling submodule is used to recycle the storage space occupied by the expired pre-promoted content when the judgment result is that the protection mode is set for the non-expired pre-promoted content in the designated storage space.

[0170] Optionally, the first recycling submodule, the second recycling submodule and the third recycling submodule may include:

[0171] A fifth determination module, configured to determine a first contribution value of each of the overdue pre-recommended contents to the matching degree;

[0172] a sixth determining module, configured to determine, according to the first contribution value, an elimination priority of the overdue pre-promoted content;

[0173] The first priority recovery module is used to recover the storage space occupied by the overdue pre-promoted content according to the elimination priority of the overdue pre-promoted content.

[0174] In some embodiments, the second recovery submodule may further include:

[0175] a seventh determination module, configured to determine a difference between the total data capacity and the first storage space capacity, and obtain a storage space capacity to be reclaimed;

[0176] An eighth determination module, configured to determine a second contribution value of each of the non-overdue pre-recommended contents to the matching degree;

[0177] a ninth determination module, configured to determine, according to the second contribution value, an elimination priority of the pre-promoted content that has not expired;

[0178] The second priority recycling module is used to recycle the storage space occupied by the non-overdue pre-promoted content according to the elimination priority of the non-overdue pre-promoted content, until the capacity of the recycled storage space matches the capacity of the storage space to be recycled.

[0179] It should be noted that the device provided in the above embodiment, when implementing its functions, is only illustrated by the division of the above functional modules. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the device and method embodiments provided in the above embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0180] The pre-pushed content management device of the embodiment of the present invention determines the matching degree between the pre-pushed content in the designated storage space and the content requested by the user through the edge node, and obtains the pre-pushed content list from the pre-pushed server when the matching degree meets the preset condition, and then obtains and stores the pre-pushed content matching the pre-pushed content identifier in the pre-pushed content list from the content distribution network, thereby realizing the update of the pre-pushed content triggered by the matching degree (such as the uplink bandwidth ratio) between the pre-pushed content in the designated storage space and the content requested by the user, which can maximize the use of the uplink bandwidth of the edge node and improve the utilization rate of bandwidth resources.

[0181] In addition, the pre-promoted content management device of the embodiment of the present invention determines an elimination priority based on the contribution of the pre-promoted content to the matching degree when reclaiming the storage space occupied by the pre-promoted content, and subsequently reclaims the storage space occupied by the corresponding pre-promoted content based on the elimination priority, thereby effectively avoiding the problem that the storage space occupied by unpopular content cannot be reclaimed due to its long life cycle, and effectively avoiding the problem that popular content is deleted due to its short life cycle.

[0182] An embodiment of the present invention provides a computer device, which includes a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set, or an instruction set, and the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by the processor to implement the pre-push content management method provided in the above method embodiment.

[0183] The memory can be used to store software programs and modules. The processor executes various functional applications and pre-pushed content management by running the software programs and modules stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, application programs required for functions, etc.; the data storage area can store data created according to the use of the device, etc. In addition, the memory can include a high-speed random access memory and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage device. Accordingly, the memory can also include a memory controller to provide the processor with access to the memory.

[0184] The method embodiments provided in the embodiments of the present invention may be executed in a computer terminal, a server or a similar computing device, that is, the above-mentioned computer device may include a computer terminal, a server or a similar computing device. Figure 8 is a hardware structure block diagram of a computer device running a method for managing pre-pushing content provided by an embodiment of the present invention, such as Figure 8 As shown, the internal structure of the computer device may include but is not limited to: a processor, a network interface and a memory. The processor, network interface and memory in the computer device may be connected via a bus or other means. Figure 8 The example of connecting through bus is taken in the following.

[0185] Among them, the processor (or CPU (Central Processing Unit)) is the computing core and control core of the computer device. The network interface may optionally include a standard wired interface, a wireless interface (such as WI-FI, a mobile communication interface, etc.). Memory is a memory device in a computer device for storing programs and data. It is understandable that the memory here can be a high-speed RAM storage device or a non-volatile memory device (non-volatile memory), such as at least one disk storage device; optionally, it can also be at least one storage device located away from the aforementioned processor. The memory provides a storage space, which stores the operating system of the electronic device, which may include but is not limited to: Windows system (an operating system), Linux (an operating system), Android (Android, a mobile operating system) system, IOS (a mobile operating system) system, etc., and the present invention is not limited to this; and, in the storage space, one or more instructions suitable for being loaded and executed by the processor are also stored, and these instructions may be one or more computer programs (including program codes). In the embodiment of this specification, the processor loads and executes one or more instructions stored in the memory to implement the pre-push content management method provided in the above method embodiment.

[0186] An embodiment of the present invention also provides a computer-readable storage medium, which can be set in a terminal to store at least one instruction, at least one program, code set or instruction set related to implementing a pre-push content management method. The at least one instruction, the at least one program, the code set or instruction set is loaded and executed by the processor to implement the pre-push content management method provided by the above method embodiment.

[0187] Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and other media that can store program codes.

[0188] It should be noted that the sequence of the embodiments of the present invention described above is for description only and does not represent the advantages and disadvantages of the embodiments. The above describes specific embodiments of this specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0189] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0190] A person skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware or by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

[0191] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for managing pre-promotion content, characterized in that: Applied to an edge node, the method comprises: Determine a ratio of the uplink bandwidth of the edge node to the total uplink throughput, and obtain an uplink bandwidth ratio of the edge node; when the uplink bandwidth ratio is less than a preset uplink bandwidth ratio, obtain a pre-pushed content list from a pre-pushed server; the pre-pushed content list includes a pre-pushed content identifier and a size of the pre-pushed content corresponding to the pre-pushed content identifier; Selecting a target pre-pushed content identifier from the pre-pushed content identifiers in the pre-pushed content list, wherein the target pre-pushed content identifier is the pre-pushed content identifier that is not matched to the pre-pushed content in the designated storage space; the designated storage space is a cache space used by the edge node to store the pre-pushed content; Determine the sum of the sizes of the target pre-pushed contents corresponding to the target pre-pushed content identifiers to obtain a total data capacity; When the remaining storage space of the designated storage space does not match the total data capacity, determining the overdue pre-promoted content in the designated storage space; determining the sum of the storage space occupied by the overdue pre-promoted content and the remaining storage space to obtain a first storage space capacity; based on the matching result of the first storage space capacity and the total data capacity, reclaiming the storage space occupied by the overdue pre-promoted content; acquiring and storing the target pre-promoted content from a content distribution network according to the remaining storage space and the reclaimed storage space; The step of reclaiming the storage space occupied by the overdue pre-promoted content includes: For each of the overdue predicted contents, the uplink data rates of the overdue predicted contents within a preset period are accumulated to obtain the individual resource uplink throughput of the overdue predicted contents, and the ratio of the individual resource uplink throughput to the total uplink throughput of the edge node is calculated to obtain a first contribution value of the overdue predicted contents to the uplink bandwidth, and the elimination priority of the overdue predicted contents is determined according to the first contribution value; according to the elimination priority of the overdue predicted contents, the storage space occupied by the overdue predicted contents is reclaimed.

2. The method for managing pre-promotion content according to claim 1, characterized in that: The reclaiming the storage space occupied by the overdue pre-promoted content based on the matching result of the first storage space capacity and the total data capacity includes: Determining whether the first storage space capacity matches the total data capacity; When the result of the judgment is yes, the storage space occupied by the overdue pre-promoted content is reclaimed.

3. The method for managing pre-pushing content according to claim 2, characterized in that: The method further comprises: When the capacity of the first storage space does not match the total data capacity, determining whether a protection mode is set for the non-overdue pre-promoted content in the designated storage space; the non-overdue pre-promoted content includes pre-promoted content whose storage time in the designated storage space does not exceed a preset time; When the result of the judgment is no, the storage space occupied by the overdue predicted content and the storage space occupied by the non-overdue predicted content are recycled in turn.

4. The method for managing pre-pushing content according to claim 3, characterized in that: The method further comprises: When the result of the judgment is that the protection mode is set for the non-expired pre-promoted content in the designated storage space, the storage space occupied by the expired pre-promoted content is reclaimed.

5. The method for managing pre-pushing content according to claim 3, characterized in that: The reclaiming of the storage space occupied by the pre-pushed content that has not expired includes: Determine the difference between the total data capacity and the first storage space capacity to obtain the storage space capacity to be reclaimed; Determine a second contribution value of each of the non-overdue pre-pushed contents to the uplink bandwidth proportion; Determining the elimination priority of the pre-promoted content that has not exceeded the deadline according to the second contribution value; According to the elimination priority of the non-overdue pre-promoted content, the storage space occupied by the non-overdue pre-promoted content is reclaimed until the capacity of the reclaimed storage space matches the capacity of the storage space to be reclaimed.

6. A pre-promotion content management device, characterized in that: Applied to an edge node, the device comprises: A first determination module, configured to determine a ratio of an uplink bandwidth of the edge node to a total uplink throughput rate, and obtain an uplink bandwidth ratio of the edge node; A first acquisition module is configured to acquire a pre-pushed content list from a pre-pushed server when the uplink bandwidth ratio is less than a preset uplink bandwidth ratio; the pre-pushed content list includes a pre-pushed content identifier and a size of the pre-pushed content corresponding to the pre-pushed content identifier; A second acquisition module is configured to select a target pre-pushed content identifier from the pre-pushed content identifiers in the pre-pushed content list, wherein the target pre-pushed content identifier is the pre-pushed content identifier that does not match the pre-pushed content in the designated storage space; the designated storage space is a cache space used by the edge node to store the pre-pushed content; determine the sum of the sizes of the target pre-pushed content corresponding to the target pre-pushed content identifier to obtain a total data capacity; when the remaining storage space of the designated storage space does not match the total data capacity, determine the overdue pre-pushed content in the designated storage space; determine the sum of the storage space occupied by the overdue pre-pushed content and the remaining storage space to obtain a first storage space capacity; based on the matching result of the first storage space capacity and the total data capacity, reclaim the storage space occupied by the overdue pre-pushed content; and acquire and store the target pre-pushed content from a content distribution network according to the remaining storage space and the reclaimed storage space; The step of reclaiming the storage space occupied by the overdue pre-promoted content includes: For each of the overdue predicted contents, the uplink data rates of the overdue predicted contents within a preset period are accumulated to obtain the individual resource uplink throughput of the overdue predicted contents, and the ratio of the individual resource uplink throughput to the total uplink throughput of the edge node is calculated to obtain a first contribution value of the overdue predicted contents to the uplink bandwidth, and the elimination priority of the overdue predicted contents is determined according to the first contribution value; according to the elimination priority of the overdue predicted contents, the storage space occupied by the overdue predicted contents is reclaimed.

7. A computer device, characterized in that: The method comprises a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set or an instruction set, and the at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by the processor to implement the pre-push content management method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores at least one instruction, at least one program, a code set or an instruction set, and the at least one instruction, the at least one program, the code set or the instruction set is loaded and executed by the processor to implement the pre-push content management method as described in any one of claims 1 to 5.

Images