Content distribution method, electronic device and computer program product

By acquiring neighboring topology information in the collaborative storage network and optimizing the content distribution strategy, the computational complexity problem caused by the increase in the number of nodes and content is solved, achieving low-cost, efficient content transmission and fast response.

CN115695560BActive Publication Date: 2024-11-08EMC IP HLDG CO LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110837711.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-07-23
Publication Date
2024-11-08
Estimated Expiration
2041-07-23

AI Technical Summary

Technical Problem

In collaborative storage networks, as the number of nodes and the content to be distributed increase, the computational complexity and amount of computation in the optimization process of existing technologies increase significantly, and the optimization results lack interpretability, leading to a prolonged response time for users.

Method used

By acquiring the neighboring topology information of multiple nodes, the potential cost between one-hop and two-hop node pairs can be determined. Based on this information, the content distribution strategy can be optimized, reducing computational complexity and improving response speed.

Benefits of technology

It reduces the total cost of content transmission between nodes, shortens the response time on the user end, improves the user experience, and enhances the adaptability of the solution.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115695560B_ABST
    Figure CN115695560B_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure relate to content distribution methods, electronic devices, and computer program products. In the content distribution method provided by the embodiments of the present disclosure, neighboring topology information of multiple nodes in a collaborative storage network is obtained, and the multiple nodes are used to collaboratively store multiple contents requested by a user terminal. The neighboring topology information at least indicates a one-hop relationship between directly connected one-hop node pairs in the multiple nodes and a two-hop relationship between two-hop node pairs connected via intermediate nodes in the multiple nodes; based on the neighboring topology information, the potential cost of transmitting multiple contents to be distributed between the multiple nodes is determined; and based on the potential cost, the target content in the multiple contents is distributed to the nodes in the multiple nodes. In this way, the cost of transmitting content in the collaborative storage network is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the technical field of data storage, and more particularly, to a content distribution method, an electronic device, and a computer program product. Background Art

[0002] Multiple nodes in a collaborative storage network can collaboratively store data. In this way, when a user terminal requests the required content (e.g., video), the requested content can be transmitted to the user terminal from the nearest node, rather than being transmitted to the user terminal from the cloud server every time. Therefore, the load on the core network is reduced and the content delivery performance is improved. The storage policy indicates which of the multiple contents is stored in a node among the multiple nodes. The quality of the storage policy affects the cost of transmitting content between nodes in the collaborative storage network. Summary of the invention

[0003] In a first aspect of the present disclosure, a content distribution method is provided. The method includes obtaining neighboring topology information of multiple nodes in a collaborative storage network, the multiple nodes are used to collaboratively store multiple contents requested by a user terminal, and the neighboring topology information at least indicates a one-hop relationship between directly connected one-hop node pairs in the multiple nodes and a two-hop relationship between two-hop node pairs connected via intermediate nodes in the multiple nodes. The method also includes determining the potential cost of transmitting multiple contents to be distributed between the multiple nodes based on the neighboring topology information. The method also includes distributing target contents among the multiple contents to nodes among the multiple nodes based on the potential cost.

[0004] In a second aspect of the present disclosure, an electronic device is provided. The electronic device includes a processor and a memory coupled to the processor, the memory having instructions stored therein, and the instructions, when executed by the processor, cause the device to perform an action. The action includes obtaining neighboring topology information of multiple nodes in a collaborative storage network, the multiple nodes being used to collaboratively store multiple contents requested by a user terminal, the neighboring topology information at least indicating a one-hop relationship between directly connected one-hop node pairs among the multiple nodes and a two-hop relationship between two-hop node pairs connected via intermediate nodes among the multiple nodes. The action also includes determining the potential cost of transmitting multiple contents to be distributed between the multiple nodes based on the neighboring topology information. The action also includes distributing target contents among the multiple contents to nodes among the multiple nodes based on the potential cost.

[0005] In a third aspect of the present disclosure, there is provided a computer program product tangibly stored on a computer readable medium and comprising machine executable instructions which, when executed, cause a machine to perform the method according to the first aspect.

[0006] This Summary is provided to introduce a selection of concepts in a simplified form that are further described in the Detailed Description below. This Summary is not intended to identify key features or essential features of the disclosure, nor is it intended to limit the scope of the disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] The above and other purposes, features and advantages of the present disclosure will become more apparent by describing the exemplary embodiments of the present disclosure in more detail in conjunction with the accompanying drawings, wherein the same reference numerals generally represent the same components in the exemplary embodiments of the present disclosure. In the accompanying drawings:

[0008] Figure 1 A schematic diagram illustrating an example environment in which embodiments of the present disclosure may be implemented;

[0009] Figure 2 A flowchart illustrating an example method of content distribution according to an embodiment of the present disclosure;

[0010] Figure 3 A schematic diagram showing a neighbor connection relationship between multiple nodes in a collaborative storage network according to some embodiments of the present disclosure;

[0011] Figure 4 A flowchart of a method for determining potential costs based on popularity of content and updating storage policies according to some embodiments of the present disclosure is shown;

[0012] Figure 5 A matrix diagram showing a storage strategy obtained according to some embodiments of the present disclosure is shown;

[0013] Figure 6 A schematic diagram showing a method of responding to a client request using a storage strategy according to some embodiments of the present disclosure; and

[0014] Figure 7 A block diagram of an example device that may be used to implement embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0015] The principles of the present disclosure will be described below with reference to several example embodiments shown in the accompanying drawings. Although preferred embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that these embodiments are described only to enable those skilled in the art to better understand and implement the present disclosure, and are not intended to limit the scope of the present disclosure in any way.

[0016] As used herein, the term "including" and its variations mean open inclusion, i.e., "including but not limited to". Unless otherwise stated, the term "or" means "and / or". The term "based on" means "based at least in part on". The terms "an example embodiment" and "an embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first", "second", etc. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0017] Figure 1 Schematic diagram of an example environment in which embodiments of the present disclosure may be implemented. Figure 1 As shown, the environment 100 includes a cloud server 110, a node 120-1, a node 120-2, and a node 120-n (also collectively or individually referred to as "node 120"), where n is a natural number. The cloud server 110 stores a content library 111, which stores one or more contents, and the contents may be, for example, videos (such as episodes of movies or TV series), etc. The cloud server 110 and each node 120 may communicate with each other. For example, the cloud server 110 may distribute to the node 120 a plurality of contents that need to be stored collaboratively between the nodes 120. The node 120 may obtain the contents in the content library 111 from the cloud server 110 and store the obtained contents.

[0018] Multiple nodes in node 120 can communicate with each other. For example, node 120-1 can transmit the content stored by each node to node 120-2. It should be understood that the structure and function of environment 100 are described for exemplary purposes only and do not imply any limitation on the scope of the present disclosure. For example, the embodiments of the present disclosure can also be applied to environments different from environment 100. In addition, although Figure 1 Only three nodes are shown in FIG. 1 , but the present invention is not limited thereto, and there may be more or fewer nodes.

[0019] In the case where multiple contents have been distributed to multiple nodes 120 by the cloud server 110, a client (not shown) sends a request for specific content to one of the multiple nodes 120 (e.g., node 120-1). If the specific content exists in the node 120-1, the node 120-1 transmits the specific content to the client. If the specific content does not exist in the node 120-1, the node 120-1 pulls the specific content from other nodes in the environment 100 or from the cloud server 110, and then transmits the specific content to the client.

[0020] Due to the limited storage capacity of the node, a single node can only store a portion of the multiple contents. In traditional solutions, which of the multiple contents should be stored by a node in the multiple nodes is optimized based on the storage capacity of each node in the network and the content to be distributed, so as to reduce the total cost of content transmission in the network.

[0021] However, in the known traditional scheme, when optimizing as described above, it is necessary to consider the cost of transmitting the content to be distributed between all pairs of nodes in the network. As the number of nodes increases or the amount of content to be distributed increases, the computational complexity and amount of calculation of the optimization process will increase significantly.

[0022] In addition, in traditional solutions, the results of the above optimization are not interpretable and cannot be used for downstream tasks. That is to say, when the above optimization has been performed, when the user terminal requests specific content from the current node, if the specific content does not exist in the current node, the current node cannot use the above optimization results to know which nodes in the network should be prioritized to pull the specific content from. The current node needs to communicate with other nodes separately to determine whether the specific content exists in the node communicating with it. As a result, the response time to the user terminal request may time out.

[0023] The embodiment of the present disclosure proposes a content distribution scheme, so that as the number of nodes and the amount of content to be distributed increase, the computational complexity and amount of the optimization process do not increase significantly. The optimization results can be used for downstream tasks, thereby reducing the cost of content transmission between nodes and reducing the waiting time of the user end.

[0024] According to various embodiments of the present disclosure, neighboring topology information of multiple nodes is obtained. The neighboring topology information at least indicates a one-hop relationship between a pair of directly connected one-hop nodes and a two-hop relationship between a pair of two-hop nodes connected via an intermediate node. Potential costs are determined based on the neighboring topology information. Potential costs refer to potential costs of transmitting multiple contents to be distributed between multiple nodes. The potential costs include at least a first cost of transmitting complementary contents between a pair of one-hop nodes. Based on the potential costs, target contents are distributed to nodes among the multiple nodes.

[0025] According to the embodiments described herein, by using the neighboring topology information between multiple nodes, the computational complexity and amount of computation can be reduced. Thus, the total cost of transmitting content between multiple nodes is reduced. The response time to user requests is reduced, and the user experience is improved. In addition, because there is no need to consider the cost of transmitting content between all node pairs, the proposed solution has good adaptability to the environment.

[0026] The following references Figures 2 to 6It should be understood that these exemplary embodiments are provided only to enable those skilled in the art to better understand and implement the embodiments of the present disclosure, and are not intended to limit the scope of the present disclosure in any way.

[0027] Figure 2 2 is a flowchart showing an exemplary method 200 for content distribution according to an embodiment of the present disclosure. The method 200 may be performed by, for example, Figure 1 It should be understood that the method 200 may also include additional actions not shown and / or may omit the actions shown, and the scope of the present disclosure is not limited in this respect. Figure 1 The method 200 will be described in detail.

[0028] In block 210, neighbor topology information of multiple nodes in the collaborative storage network is obtained. The neighbor topology information represents neighbor connection relationships between multiple nodes. The neighbor topology information includes at least one-hop relationships between directly connected one-hop node pairs among the multiple nodes and two-hop relationships between two-hop node pairs connected via intermediate nodes among the multiple nodes.

[0029] Reference below Figure 3 Detailed description of the proximity connection relationship between multiple nodes. Figure 3 FIG. 3 is a schematic diagram showing a neighboring connection relationship between multiple nodes in a collaborative storage network 300 according to some embodiments of the present disclosure. Figure 3 In the figure, it is assumed that a user terminal (not shown) sends a request for specific content to one of the multiple nodes (referred to as the "current node") 310-1. Each node 310-2 directly connected to the current node 310-1 is called a one-hop node and is located within the dotted circle K=1. The one-hop relationship between the current node 310-1 and each one-hop node 310-2 can be represented by the matrix D1 described later. Each node 310-3 connected to the current node 310-1 via an intermediate node (for example, the one-hop node 310-2) is called a two-hop node and is located within the dotted circle K=2. The two-hop relationship between the current node 310-1 and each two-hop node 310-2 can be represented by the matrix D2 described later. For any node in the collaborative storage network, there is no intersection between its one-hop node and its two-hop node. For example, for the current node 310-1, its one-hop nodes are multiple nodes 310-2 within the dotted circle K=1 as shown in the figure, and these nodes 310-2 will not appear within the dotted circle K=2, that is, a node 310-2 will not be both a one-hop node of the current node 310-1 and a two-hop node of the current node 310-1. Vice versa.

[0030] return Figure 2At block 220, based on the neighboring topology information, potential costs of transmitting the plurality of contents to be distributed between the plurality of nodes are determined. For example, a first cost of transmitting the contents to be distributed between a pair of one-hop nodes directly connected among the plurality of nodes is determined. In some embodiments, the first cost may be determined as a cost of transmitting complementary contents between the one-hop node pair.

[0031] In some embodiments, a second cost may be determined as part of the potential cost, where the second cost is determined as the cost of transmitting partially overlapping content between the two-hop node pair. For example, assuming that the number of the plurality of content to be distributed is d, the potential cost J(z) of transmitting the content between the nth node and its neighboring nodes among the plurality of nodes is n ) can be expressed as follows:

[0032]

[0033] where z n represents a d-dimensional vector, which indicates which contents among the multiple contents are stored in the n-th node; L1(n) represents the set of one-hop neighboring nodes of the n-th node, z v represents a d-dimensional vector, which indicates which of the multiple contents are stored in a one-hop neighboring node of the n-th node; L2(n) represents the set of two-hop neighboring nodes of the n-th node, z u represents a d-dimensional vector, which indicates which contents among multiple contents are stored in a two-hop neighboring node of the nth node. σ represents the Sigmoid function; α represents the weight coefficient, α>0, which can be selected based on experience or set based on the effect of the experiment. represents the first cost of transmitting complementary content between the nth node and its one-hop neighboring node; represents the second cost of transmitting partially overlapping content between the nth node and its two-hop neighboring node.

[0034] It should be understood that the potential cost shown in formula (1) is only exemplary and is not intended to limit the content of the present disclosure. In the embodiments of the present disclosure, other suitable methods can also be used to represent the potential cost.

[0035] In some embodiments, the potential cost can also be determined based on the popularity of each content. The popularity can be represented by, for example, the click-through rate of the content, or other information. This will be discussed later in conjunction with Figure 4 Describe in detail.

[0036] At block 230, target content from among the plurality of contents is distributed to nodes from among the plurality of nodes based on the potential cost. In some embodiments, the target content from among the plurality of contents is distributed to nodes from among the plurality of nodes by at least reducing the first cost. In some embodiments, the target content from among the plurality of contents is distributed to nodes from among the plurality of nodes by reducing the first cost and the second cost.

[0037] For example, z in the above formula (1) n It can be expressed as follows:

[0038] z n =f(Wx n ) (2)

[0039] where the vector x n Indicates the nth node. For example, x n It can be a binary vector indicating the encoding of the nth node in the collaborative storage network, and its dimension can be any value. W represents the learnable network parameter used to transform the vector x n is mapped to a d-dimensional vector. f() represents an activation function. In this embodiment, the Heaviside step function is used as the activation function, but it is not limited to this, and other common activation functions can also be used. In conventional operations, a stretched Sigmoid function is usually used to approximate the Heaviside step function. The Heaviside step function is used as the activation function for the vector x n After mapping, the resulting d-dimensional vector z n is a vector containing only numbers 0 and 1 as vector element values. Number 1 may indicate content that should be distributed to the nth node among the d contents to be distributed. Number 0 may indicate content that is not distributed to the nth node among the d contents to be distributed.

[0040] Therefore, for multiple nodes in a collaborative storage network, the following equation exists:

[0041] Z=f(WX) (3)

[0042] Wherein Z represents a matrix indicating how a plurality of contents to be distributed should be distributed to a plurality of nodes in the collaborative storage network; X represents a matrix indicating a plurality of nodes in the collaborative storage network, for example, the elements of X may be a plurality of d-dimensional vectors.

[0043] For simplicity, how a plurality of to-be-distributed contents should be distributed to a plurality of nodes in a collaborative storage network is referred to as a “storage strategy” hereinafter.

[0044] Substituting the above equation (2) into the above equation (1) and using tensor operations, the potential cost J(Z) can be obtained as follows.

[0045]

[0046] where D represents the neighbor tensor, Represents a one-hop relationship between directly connected one-hop node pairs among multiple nodes; Represents a two-hop relationship between two-hop node pairs connected via an intermediate node among multiple nodes; represents the Einstein product, which is used to convert the result of multiplying adjacent tensors from a three-dimensional relationship to a two-dimensional result; σ represents the Sigmoid function; α represents the weight coefficient, α>0.

[0047] By reducing the potential cost expressed by the above formula (4), the network parameter W can be learned, thereby obtaining the storage strategy expressed by the above formula (3). That is, by reducing the potential cost, the target content among the multiple contents can be distributed to the nodes among the multiple nodes.

[0048] In some embodiments, the target content in the multiple contents can be distributed to the nodes in the multiple nodes by at least minimizing the aforementioned first cost. In some embodiments, the target content in the multiple contents can be distributed to the nodes in the multiple nodes by minimizing the aforementioned first cost and the aforementioned second cost. For example, by minimizing the potential cost expressed by the above formula (4), the network parameter W can be learned, thereby obtaining the storage strategy expressed by the above formula (3).

[0049] In some embodiments, the potential cost may be determined based on the popularity of each of the plurality of contents in addition to the proximity topology information. In some additional embodiments, the potential cost may be updated in response to changes in the popularity of the content, and then the storage strategy may be updated based on the updated potential cost.

[0050] Figure 4 A flowchart of a method 400 for determining potential costs based on the popularity of content and updating a storage policy according to some embodiments of the present disclosure is shown. The method 400 can be viewed as an example implementation of block 220 in the method 200. It should be understood that the method 400 may also include additional actions not shown and / or may omit the actions shown, and the scope of the present disclosure is not limited in this respect. Figure 1 The method 400 will be described in detail.

[0051] At this time, the potential cost J(Z) can be expressed as follows:

[0052]

[0053] D represents the neighbor tensor, where Represents a one-hop relationship between directly connected one-hop node pairs among multiple nodes; Represents a two-hop relationship between two-hop node pairs connected via an intermediate node among multiple nodes; represents the Einstein product, which is used to convert the result of multiplying adjacent tensors from a three-dimensional relationship to a two-dimensional result; σ represents the Sigmoid function; α represents the weight coefficient, α>0; p n represents a vector indicating the popularity of the content in the nth node. n It can be obtained from the statistics of the node, such as click rate, etc. λ represents the stretching coefficient of the stretched Sigmoid function; ⊙ represents the dot multiplication of the vector.

[0054] In block 410, it is determined whether the popularity has changed. The popularity may be represented by, for example, a click rate of the content, or other information.

[0055] In response to a change in the popularity of the content ("yes" in box 410), the potential cost is updated in box 420. In some embodiments, using the above formula (5), the potential cost J(Z) can be updated in response to a change in the popularity of the content (i.e., a change in P). Then, in box 430, based on the updated potential cost, the content distributed to the nodes in the multiple nodes is updated. For example, when P in the above formula (5) changes, the potential cost J(Z) is updated, and by reducing the updated potential cost J(Z), an updated storage strategy expressed by formula (3) can be obtained. In some embodiments, the updated storage strategy expressed by formula (3) can be obtained by minimizing the updated potential cost J(Z).

[0056] In some embodiments, the potential cost may also be determined based on the capacity of each of the multiple nodes and the size of each of the multiple contents to be distributed. The size of the content may be, for example, the size of a video (such as an episode of a movie or a TV series). Substituting this constraint into the above formula (5), the potential cost J(Z) expressed as follows can be obtained:

[0057]

[0058] Where β represents the weight coefficient, which can be selected based on experience or set based on the experimental results; C n represents the capacity of the nth node; q n Indicates the size of the content to be distributed to the nth node; z n represents a d-dimensional vector, which indicates which contents among multiple contents are stored in the n-th node; ||1 means finding the absolute value.

[0059] As described above, based on the potential cost, a storage strategy may be derived, ie, which contents of the plurality of contents are distributed to a node among the plurality of nodes. Figure 5A schematic diagram of a matrix of storage strategies obtained according to some embodiments of the present disclosure is shown. The rows of the matrix represent node identifications, such as the sequence number of the node, such as the nth node among multiple nodes; the columns of the matrix represent content identifications, such as the sequence number of the content, such as the mth content among multiple contents. Figure 5 The solid-line box in indicates the content that should be distributed to the current node.

[0060] Figure 6 Shows the use of Figure 5 The storage strategy shown is a schematic diagram of responding to a request from a user end 630. Figure 3 and Figure 5 right Figure 6 For explanation. Figure 6 As shown, the user terminal 630 is close to Figure 3 The current node 310-1 sends a request for specific content. The response delay from the cloud server to the current node 310-1 is 0.9, the response delay from the current node 310-1 to the user end 630 is 0.1, and the response delay from the one-hop node 310-2 to the current node 310-1 is 0.2. If the current node 310-1 stores the specific content, the response delay to the request is 0.1. If the current node 310-1 does not store the specific content, according to Figure 5 According to the storage strategy shown, the current node 310-1 pulls the specific content from its first-hop node 310-2, and the response delay to the request is 0.3. If the specific content does not exist in the current node 310-1 and does not exist in its first-hop node 310-2 and second-hop node 310-3, the current node 310-1 pulls the specific content from the cloud server 110, and the response delay to the user request is 1.

[0061] Figure 7 Schematic block diagram of an example device 700 that can be used to implement embodiments of the present disclosure is shown. Figure 1 The cloud server 110 shown may be implemented by the device 700. Figure 7 As shown, the device 700 includes a central processing unit (CPU) 701, which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) 702 or computer program instructions loaded from a storage unit 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 can also be stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0062] A number of components in the device 700 are connected to the I / O interface 705, including: an input unit 706, such as a keyboard, a mouse, etc.; an output unit 707, such as various types of displays, speakers, etc.; a storage unit 708, such as a disk, an optical disk, etc.; and a communication unit 709, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 709 allows the device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0063] The various processes and processing described above, such as method 200, may be performed by processing unit 701. For example, in some embodiments, method 200 may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on device 700 via ROM 702 and / or communication unit 709. When the computer program is loaded into RAM 703 and executed by CPU 701, one or more actions of method 200 described above may be performed.

[0064] The present disclosure may be a method, an apparatus, a system and / or a computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for executing various aspects of the present disclosure.

[0065] Computer readable storage medium can be a tangible device that can hold and store instructions used by an instruction execution device. Computer readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the above. More specific examples (non-exhaustive list) of computer readable storage medium include: portable computer disk, hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static random access memory (SRAM), portable compact disk read-only memory (CD-ROM), digital versatile disk (DVD), memory stick, floppy disk, mechanical encoding device, such as a punch card or a convex structure in a groove on which instructions are stored, and any suitable combination of the above. The computer readable storage medium used here is not interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated by a waveguide or other transmission medium (e.g., a light pulse by an optical fiber cable), or an electrical signal transmitted by a wire.

[0066] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical fiber transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing / processing device.

[0067] The computer program instructions for performing the operation of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages, such as Smalltalk, C++, etc., and conventional procedural programming languages, such as "C" language or similar programming languages. Computer-readable program instructions may be executed completely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or completely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider to connect via the Internet). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), may be customized by utilizing the state information of the computer-readable program instructions, and the electronic circuit may execute the computer-readable program instructions, thereby realizing various aspects of the present disclosure.

[0068] Various aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of the methods, devices (systems) and computer program products according to the embodiments of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer-readable program instructions.

[0069] These computer-readable program instructions can be provided to a processing unit of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processing unit of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0070] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operating steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.

[0071] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and a part of the module, program segment or instruction includes one or more executable instructions for realizing the specified logical function. In some alternative implementations, the function marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous square boxes can actually be executed substantially in parallel, and they can sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or action, or can be implemented with a combination of special hardware and computer instructions.

[0072] The embodiments of the present disclosure have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and changes will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The selection of terms used herein is intended to best explain the principles of the embodiments, practical applications, or improvements to the technology in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A content distribution method, comprising: Acquire neighboring topology information of a plurality of nodes in a collaborative storage network, the plurality of nodes being used to collaboratively store a plurality of contents requested by a user terminal, the neighboring topology information comprising at least a first data structure and a second data structure different from the first data structure, the first data structure indicating a one-hop relationship between a pair of one-hop nodes directly connected among the plurality of nodes, and the second data structure indicating a two-hop relationship between a pair of two-hop nodes connected via an intermediate node among the plurality of nodes; determining a potential cost of transmitting the plurality of contents to be distributed between the plurality of nodes based on one or more tensor operations implemented using the first data structure and the second data structure of the proximity topology information, the tensor operations being based on a tensor of at least three dimensions, wherein a first dimension of the dimensions of the tensor takes a first value identifying an additional dimension corresponding to the first data structure and takes a second value identifying an additional dimension corresponding to the second data structure; and Distributing target content among the plurality of contents to nodes among the plurality of nodes based on the potential cost; Wherein determining the potential cost of transmitting the plurality of contents to be distributed between the plurality of nodes based on the proximity topology information comprises: applying a first cost determination function to at least a subset of the one-hop node pairs, the first cost determination function being based at least in part on content of the plurality of content that is stored in at least one one-hop neighboring node of a given node; applying a second cost determination function to at least a subset of the two-hop node pairs, the second cost determination function being different from the first cost determination function, the second cost determination function being based at least in part on content of the plurality of content that is stored in at least one two-hop neighboring node of the given node; and The potential cost is determined based on a result of applying the first cost determination function and applying the second cost determination function.

2. The method of claim 1 , wherein determining the potential cost comprises: A first cost for transmitting complementary content between the one-hop node pair is determined as at least a portion of the potential cost.

3. The method of claim 2, wherein determining the potential cost further comprises: A second cost for transmitting the partially overlapping content between the two-hop node pair is determined as part of the potential cost.

4. The method of claim 1, wherein distributing the target content to a node in the plurality of nodes comprises: determining, from the plurality of contents, target content to be distributed to the node among the plurality of nodes by minimizing the potential cost; as well as The target content is distributed to the nodes.

5. The method of claim 1 , wherein determining the potential cost further comprises: The potential cost is further determined based on popularity of each of the plurality of contents.

6. The method according to claim 5, further comprising: updating the potential cost in response to a change in the popularity; as well as Based on the updated potential cost, content distributed to the nodes of the plurality of nodes is updated.

7. The method of claim 1, wherein determining the potential cost further comprises: The potential cost is further determined based on respective capacities of the plurality of nodes and respective sizes of the plurality of contents.

8. An electronic device comprising: processor; as well as A memory coupled to the processor, the memory having instructions stored therein, the instructions causing the electronic device to perform actions when executed by the processor, the actions comprising: Acquire neighboring topology information of a plurality of nodes in a collaborative storage network, the plurality of nodes being used to collaboratively store a plurality of contents requested by a user terminal, the neighboring topology information comprising at least a first data structure and a second data structure different from the first data structure, the first data structure indicating a one-hop relationship between a pair of one-hop nodes directly connected among the plurality of nodes, and the second data structure indicating a two-hop relationship between a pair of two-hop nodes connected via an intermediate node among the plurality of nodes; determining a potential cost of transmitting the plurality of contents to be distributed between the plurality of nodes based on one or more tensor operations implemented using the first data structure and the second data structure of the proximity topology information, the tensor operations being based on a tensor of at least three dimensions, wherein a first dimension of the dimensions of the tensor takes a first value identifying an additional dimension corresponding to the first data structure and takes a second value identifying an additional dimension corresponding to the second data structure; and Distributing target content among the plurality of contents to nodes among the plurality of nodes based on the potential cost; Wherein determining the potential cost of transmitting the plurality of contents to be distributed between the plurality of nodes based on the proximity topology information comprises: applying a first cost determination function to at least a subset of the one-hop node pairs, the first cost determination function being based at least in part on content of the plurality of content that is stored in at least one one-hop neighboring node of a given node; applying a second cost determination function to at least a subset of the two-hop node pairs, the second cost determination function being different from the first cost determination function, the second cost determination function being based at least in part on content of the plurality of content that is stored in at least one two-hop neighboring node of the given node; and The potential cost is determined based on a result of applying the first cost determination function and applying the second cost determination function.

9. The electronic device of claim 8, wherein determining the potential cost comprises: A first cost for transmitting complementary content between the one-hop node pair is determined as at least a portion of the potential cost.

10. The electronic device of claim 9, wherein determining the potential cost further comprises: A second cost for transmitting the partially overlapping content between the two-hop node pair is determined as part of the potential cost.

11. The electronic device of claim 8, wherein distributing the target content to a node among the plurality of nodes comprises: determining, from the plurality of contents, target content to be distributed to the node among the plurality of nodes by minimizing the potential cost; as well as The target content is distributed to the nodes.

12. The electronic device of claim 8, wherein determining the potential cost further comprises: The potential cost is further determined based on popularity of each of the plurality of contents.

13. The electronic device according to claim 12, wherein the actions further comprise: updating the potential cost in response to a change in the popularity; as well as Based on the updated potential cost, content distributed to the nodes of the plurality of nodes is updated.

14. The electronic device of claim 8, wherein determining the potential cost further comprises: The potential cost is further determined based on respective capacities of the plurality of nodes and respective sizes of the plurality of contents.

15. A computer program product tangibly stored on a computer readable medium and comprising machine executable instructions which, when executed, cause a machine to perform the method according to any one of claims 1 to 7.