CN106686060A - Content spread method and system - Google Patents
Content spread method and system Download PDFInfo
- Publication number
- CN106686060A CN106686060A CN201611104729.9A CN201611104729A CN106686060A CN 106686060 A CN106686060 A CN 106686060A CN 201611104729 A CN201611104729 A CN 201611104729A CN 106686060 A CN106686060 A CN 106686060A
- Authority
- CN
- China
- Prior art keywords
- node
- content
- nodes
- candidate
- cache
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000004364 calculation method Methods 0.000 claims abstract description 8
- 238000009792 diffusion process Methods 0.000 claims description 23
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 7
- 230000007704 transition Effects 0.000 claims description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The present invention relates to a content spread method and system. The method is applied to a system composed of a plurality of nodes, wherein each node contains a candidate node list. The method comprises the following steps that: when any one of the plurality of nodes receives content, the cache gain of all candidate nodes in the candidate node list is calculated according to the popularity of the content; any node selects maximum cache gain from the cache gain of all the candidate nodes, and determines a candidate node corresponding to the maximum cache gain as a candidate node to be spread; and any node forwards the received content to the candidate node to be spread. The system includes a receiving module, a calculation module, a selection module, a sending module and a candidate node list. According to the content spread method and system of the invention, the characteristics of the capacity difference and content cache difference of the nodes are considered; the nodes are grouped and maintained according to network link states and content cache similarities; and when a content request exists, factors such as the rareness of the content are considered, and the content is cached to nodes which have capability to provide services to the outside and potentially have similar interests, and therefore, the validity of caching can be improved.
Description
Technical Field
The invention relates to the field of Internet, in particular to a content diffusion method and system based on cache gain calculation.
Background
Currently in the internet, video and content services account for a large portion of the network traffic. For internet service providers, in order to guarantee service quality, large-scale user requests are processed in a near and distributed manner through technologies such as a content distribution network and cloud services, so that on one hand, the pressure of a service center is reduced, on the other hand, the waiting time of users is reduced, and the user experience is improved.
In a traditional content distribution mode, corresponding resources are deployed in data centers in different regions, and when a user requests, a proper service node is assigned according to the principle that the same operator or the position is close to the service node. However, such a structure still has some problems, such as: the position of the data center is still far away from the user, and the 'near' is difficult to truly embody; user resources in a network, such as a PC, a mobile phone, a set-top box and the like, are huge but still in an idle state, the huge resources are not reasonably utilized, the total amount of deployed resources is limited, and the problem of service bottleneck can continuously occur.
In view of the above problems, it is desirable to reasonably utilize user resources in a network, thereby improving the quality of content services and improving user experience.
Disclosure of Invention
The object of the present invention is to overcome the problems of the conventional content services with the content distribution network as the subject.
In order to achieve the above object, the present invention provides a content diffusion method and system, and in particular, to a content diffusion method and system based on cache gain calculation, which utilize content diffusion of user resources, thereby improving a service hit rate and improving user experience. In one aspect, the present invention provides a content diffusion method, applied in a system composed of a plurality of nodes, wherein each node contains a candidate node list; the method is characterized by comprising the following steps:
when any node in the plurality of nodes receives the content, calculating the cache gain of all candidate nodes in the candidate node list according to the content heat degree; any node in the plurality of nodes selects the maximized cache gain according to the cache gains of all the candidate nodes, and the candidate node corresponding to the maximized cache gain is determined as the candidate node to be diffused; and any node in the plurality of nodes forwards the received content to the candidate node to be diffused.
Wherein the candidate node list comprises: the first node list is a neighbor node list with better link connection transition state, and the second node list is a similar node list with similar content.
Specifically, the step of calculating the cache gain of all candidate nodes in the candidate node list according to the content heat includes: calculating and obtaining the access probability of the cached content in the network according to the content heat; any node in the nodes sends inquiry information to the nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the nodes is calculated according to the feedback information of the inquiry information; if the cache rate is less than or equal to the preset value T, calculating the cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'.
The step that any node in the plurality of nodes sends inquiry information to the plurality of nodes according to the accessed probability of the content, and the cache rate of the content in the candidate node list in the plurality of nodes is calculated according to the feedback information of the inquiry information comprises the following steps: the method comprises the following steps that any node in a plurality of nodes sends first inquiry information to a first candidate node of any node in the plurality of nodes according to the visited probability, the first candidate node sends second inquiry information to a second candidate node until an Nth candidate node sends Nth inquiry information (N is a positive integer), and the cache rate of the content is calculated according to the first inquiry information, the second inquiry information and feedback information of the Nth inquiry information, and specifically comprises the following steps: dividing the number of nodes with cached content in the network by the total number of nodes of TTL (time live) hops.
On the other hand, the invention provides a content diffusion system which is composed of a plurality of nodes, wherein each node comprises a receiving module, a calculating module, a selecting module, a sending module and a candidate node list; wherein,
and the receiving module is used for receiving the content by any one of the nodes.
And the calculating module is used for calculating the cache gains of all candidate nodes in the candidate node list according to the content heat when any node in the plurality of nodes receives the content.
And the selection module is used for selecting the maximized cache gain according to the cache gains of all the candidate nodes by any node in the plurality of nodes and determining the candidate node corresponding to the maximized cache gain as the candidate node to be diffused.
And the sending module is used for forwarding the received content to the candidate node to be diffused by any node in the plurality of nodes.
Specifically, the candidate node list includes: the first node list is a neighbor node list with better link connection transition state, and the second node list is a similar node list with similar content.
The calculation module is specifically used for calculating and obtaining the access probability of the content cached in the network according to the content heat; any node in the nodes sends inquiry information to the nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the nodes is calculated according to the feedback information of the inquiry information; if the cache rate is less than or equal to the preset value T, calculating the cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'. Wherein, any node in the plurality of nodes sends first query information to a first candidate node of any node in the plurality of nodes according to the visited probability, the first candidate node sends second query information to a second candidate node until an nth candidate node sends nth query information (N is a positive integer), and the cache rate of the content is calculated according to the first query information, the second query information and feedback information of the nth query information, and the specific calculation method is as follows: dividing the node number of the cached content in the network by the total node number of the TTL hops.
The invention has the beneficial effects that: the invention considers the characteristics of node capacity difference and content cache difference, groups and maintains the nodes according to the network link state and the content cache similarity, fully considers the factors of the rarity of the content and the like when a content request exists, caches between the nodes which have the capacity of providing service to the outside and have similar interest, and improves the cache effectiveness.
Drawings
FIG. 1 is a flow chart of a method for content diffusion according to an embodiment of the present invention;
FIG. 2 is a flow chart of a diffusion method according to an embodiment of the present invention;
FIG. 3 is a diagram of a system for content diffusion according to an embodiment of the present invention;
fig. 4 is a schematic diagram of a content diffusion system according to an embodiment of the present invention.
Detailed Description
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a flowchart of a content diffusion method according to an embodiment of the present invention. As shown in fig. 1, a content diffusion method is applied to a system composed of a plurality of nodes, wherein each node contains a candidate node list, and the candidate node list includes: the first node list is a neighbor node list with better link connection transition state, and the second node list is a similar node list with similar content.
The method comprises the following steps: and when any node in the plurality of nodes receives the content, calculating the cache gain of all candidate nodes in the candidate node list according to the content heat degree. Specifically, the step of calculating the cache gain of all candidate nodes in the candidate node list according to the content heat includes: calculating and obtaining the access probability of the cached content in the network according to the content heat; any node in the nodes sends inquiry information to the nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the nodes is calculated according to the feedback information of the inquiry information; if the cache rate is less than or equal to the preset value T, calculating the cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein,f is content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'.
The method comprises the following steps that any node in a plurality of nodes sends inquiry information to the plurality of nodes according to the visited probability of content, and the step of calculating the cache rate of the content in a candidate node list in the plurality of nodes according to the feedback information of the inquiry information comprises the following steps: the method comprises the following steps that any node in a plurality of nodes sends first inquiry information to a first candidate node of any node in the plurality of nodes according to the visited probability, the first candidate node sends second inquiry information to a second candidate node until an Nth candidate node sends Nth inquiry information (N is a positive integer), and the cache rate of the content is calculated according to the first inquiry information, the second inquiry information and feedback information of the Nth inquiry information, and specifically comprises the following steps: dividing the node number of the cached content in the network by the total node number of the TTL hops.
Fig. 2 is a flowchart of a diffusion method according to an embodiment of the present invention. As shown in fig. 2, step S201: when any node in the plurality of nodes receives the content, the access probability of the content cached in the network is calculated and obtained according to the content heat.
Step S202: the method comprises the following steps that any node in a plurality of nodes sends first inquiry information to a first candidate node of any node in the plurality of nodes according to the visited probability, the first candidate node sends second inquiry information to a second candidate node until an Nth candidate node sends Nth inquiry information (N is a positive integer), and the cache rate of the content is calculated according to the first inquiry information, the second inquiry information and feedback information of the Nth inquiry information, and specifically comprises the following steps: dividing the node number of the cached content in the network by the total node number of the TTL hops.
Step S, 203: if the cache rate is less than or equal to the preset value T, calculating the cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'.
Step S204: and any node in the plurality of nodes selects the maximized cache gain according to the cache gains of all the candidate nodes, and determines the candidate node corresponding to the maximized cache gain as the candidate node to be diffused.
Step S205: the cache gain of each candidate node is calculated according to a cache gain calculation method, and based on the goal of maximizing the gain, a proper diffusion node is selected for content diffusion.
The cache gain may be calculated from the content and network characteristics, including but not limited to:
f is the content to be cached, probfCalculating the global access probability of the content according to the content heat; f' is the content under replacement according to the cache replacement rule when the cache space is insufficient. b is the available bandwidth of the node to be cached.
Each node p maintains two node lists as diffusion candidate nodes: the node list comprises a neighbor node list with a better link connection state and a node list with close node distances according to definition.
The neighbor selection method in the neighbor node list is to select the neighbor node according to the network distance or serviceability of the node p and other nodes, such as one or more combinations of larger bandwidth, smaller delay, less packet loss, etc., where the selected neighbor node list is represented as PN ═ { PN ═ PN1,...,pnMAnd M is the node number of the neighbor node list of the selected pair.
The node distance can be defined according to actual requirements, and comprises the following steps: content phaseSimilarity, location proximity, content diversity, behavior similarity, and combinations of one or more thereof. The node p also needs to maintain a similar node list PS ═ PS calculated according to the node distance definition1,...,psN}。
And any node in the plurality of nodes forwards the received content to the candidate node to be diffused. The candidate node to be diffused also needs to maintain information such as the residual cacheable space of the node, the size of the node cache content and the like, and periodically exchange information such as node distance, network state, cache content, available resources and the like with the node and the own diffusion candidate node.
Step S206: and ending the flow.
If the cache rate is greater than the preset value T, the content is not diffused, and the process is ended.
Fig. 3 is a system structure diagram of content diffusion according to an embodiment of the present invention. As shown in fig. 3, the present invention provides a content diffusion system, which is composed of a plurality of nodes, each of which includes a receiving module 101, a calculating module 102, a selecting module 103, a sending module 104, and a candidate node list.
Wherein the candidate node list comprises: a first node list 105 and a second node list 106, wherein the first node list 105 is a neighbor node list with better link connection transition state, and the second node list 106 is a similar node list with similar content.
Fig. 4 is a schematic diagram of a content diffusion system according to an embodiment of the present invention. As shown in fig. 4, the present invention provides a content diffusion system, which is composed of a plurality of nodes, each node includes a receiving module 101, a calculating module 102, a selecting module 103, a sending module 104, and a candidate node list; wherein,
a receiving module 101, configured to receive content by any node of the multiple nodes.
The calculating module 102 is configured to calculate, according to the content heat when any node of the plurality of nodes receives the content, cache gains of all candidate nodes in the candidate node list according to the content heat. Calculating and obtaining the access probability of the cached content in the network according to the content heat; any node in the nodes sends inquiry information to the nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the nodes is calculated according to the feedback information of the inquiry information; if the cache rate is less than or equal to the preset value T, calculating the cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'. Wherein, any node in the plurality of nodes sends first query information to a first candidate node of any node in the plurality of nodes according to the visited probability, the first candidate node sends second query information to a second candidate node until an nth candidate node sends nth query information (N is a positive integer), and the cache rate of the content is calculated according to the first query information, the second query information and feedback information of the nth query information, and the specific calculation method is as follows: dividing the node number of the cached content in the network by the total node number of the TTL hops.
The selecting module 103 is configured to select a maximized cache gain from the cache gains of all candidate nodes by any node of the multiple nodes, and determine a candidate node corresponding to the maximized cache gain as a candidate node to be diffused.
A sending module 104, configured to forward the received content to the candidate node to be flooded by any node of the multiple nodes.
Specifically, the candidate node list includes: a first node list 105 and a second node list 106, wherein the first node list 105 is a neighbor node list with better link connection transition state, and the second node list 106 is a similar node list with similar content.
The invention has the beneficial effects that: the invention considers the characteristics of node capacity difference and content cache difference, groups and maintains the nodes according to the network link state and the content cache similarity, fully considers the factors of the rarity of the content and the like when a content request exists, caches between the nodes which have the capacity of providing service to the outside and have similar interest, and improves the cache effectiveness.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (8)
1. A content diffusion method is applied to a system formed by a plurality of nodes, wherein each node comprises a candidate node list; the method is characterized by comprising the following steps:
when any node in the plurality of nodes receives the content, calculating the cache gain of all candidate nodes in the candidate node list according to the content heat degree;
any node in the plurality of nodes selects a maximized cache gain according to the cache gains of all the candidate nodes, and determines the candidate node corresponding to the maximized cache gain as a candidate node to be diffused;
and any node in the plurality of nodes forwards the received content to the candidate node to be diffused.
2. The method of claim 1, wherein the list of candidate nodes comprises: the node comprises a first node list and a second node list, wherein the first node list is a neighbor node list with better link connection transition state, and the second node list is a similar node list with similar content.
3. The method of claim 1, wherein the step of calculating the cache gain of all candidate nodes in the candidate node list according to the content heat comprises:
calculating and obtaining the access probability of the cached content in the network according to the content heat; any node in the plurality of nodes sends inquiry information to the plurality of nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the plurality of nodes is calculated according to the feedback information of the inquiry information;
if the cache rate is less than or equal to a preset value T, calculating cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'.
4. The method of claim 3, wherein the step of any one of the plurality of nodes sending query information to the plurality of nodes according to the probability of the content being accessed, and the step of calculating the cache rate of the content in the candidate node list of the plurality of nodes according to the feedback information of the query information comprises:
the method includes the following specific steps that any node in the multiple nodes sends first query information to a first candidate node of any node in the multiple nodes according to the visited probability, the first candidate node sends second query information to a second candidate node until an nth candidate node sends nth query information (N is a positive integer), and the cache rate of the content is calculated according to the first query information, the second query information and feedback information of the nth query information, and the specific calculation method includes: dividing the node number of the cached content in the network by the total node number of the TTL hops.
5. A system for content flooding, comprising a plurality of nodes, characterized by: each node comprises a receiving module 101, a calculating module 102, a selecting module 103, a sending module 104 and a candidate node list; wherein,
a receiving module 101, configured to receive content at any node of the multiple nodes;
a calculating module 102, configured to calculate, according to content popularity when any node of the multiple nodes receives content, cache gains of all candidate nodes in the candidate node list;
a selecting module 103, configured to select, by any node of the multiple nodes, a maximized cache gain according to the cache gains of all the candidate nodes, and determine a candidate node corresponding to the maximized cache gain as a candidate node to be diffused;
a sending module 104, configured to forward the received content to the candidate node to be flooded by any node of the plurality of nodes.
6. The system of claim 5, wherein the list of candidate nodes comprises: a first node list 105 and a second node list 106, wherein the first node list 105 is a neighbor node list with better link connection transition state, and the second node list 106 is a similar node list with similar content.
7. The system according to claim 5, wherein the calculating module 102 is specifically configured to calculate, according to the content popularity, an access probability of the content cached in the network; any node in the plurality of nodes sends inquiry information to the plurality of nodes according to the access probability of the content, and the cache rate of the content in a candidate node list in the plurality of nodes is calculated according to the feedback information of the inquiry information;
if the cache rate is less than or equal to a preset value T, calculating cache gains of all candidate nodes in the candidate node list according to the following formula, wherein the specific formula is as follows:
gf＝G(popf,V,V')
wherein f is the content to be cached, popfThe accessed degree of the content f, the related characteristic of the node is V, and the network characteristic is represented by a vector V'.
8. The system according to claim 7, wherein the computing module 102 is specifically configured to, by any one of the plurality of nodes, send a first query message to a first candidate node of the plurality of nodes according to the probability of being visited, and send a second query message to the second candidate node by the first candidate node until an nth query message (N is a positive integer) is sent by an nth candidate node, and calculate the cache rate of the content according to feedback information of the first query message, the second query message, and the nth query message, and specifically calculate the following: dividing the node number of the cached content in the network by the total node number of the TTL hops.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611104729.9A CN106686060B (en) | 2016-12-05 | 2016-12-05 | A kind of method and system of content diffusion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611104729.9A CN106686060B (en) | 2016-12-05 | 2016-12-05 | A kind of method and system of content diffusion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106686060A true CN106686060A (en) | 2017-05-17 |
| CN106686060B CN106686060B (en) | 2019-11-05 |
Family
ID=58867536
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611104729.9A Active CN106686060B (en) | 2016-12-05 | 2016-12-05 | A kind of method and system of content diffusion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106686060B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019057209A1 (en) * | 2017-09-25 | 2019-03-28 | 中兴通讯股份有限公司 | Local content caching method and apparatus, storage medium and electronic apparatus |
| CN110839166A (en) * | 2019-11-19 | 2020-02-25 | 中国联合网络通信集团有限公司 | Data sharing method and device |
| CN110875938A (en) * | 2018-08-31 | 2020-03-10 | 元一科技控股有限公司 | Method and device for sending information in block chain |
| US11258879B2 (en) * | 2017-06-19 | 2022-02-22 | Northeastern University | Joint routing and caching method for content delivery with optimality guarantees for arbitrary networks |
| US11677625B2 (en) | 2019-07-02 | 2023-06-13 | Northeastern University | Network and method for servicing a computation request |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104756449A (en) * | 2012-11-26 | 2015-07-01 | 三星电子株式会社 | Method of packet transmission from node and contentowner in content-centric networking |
| CN105099944A (en) * | 2014-04-22 | 2015-11-25 | 华为技术有限公司 | Data caching method and forwarding device |
| CN106101223A (en) * | 2016-06-12 | 2016-11-09 | 北京邮电大学 | A kind of caching method mated with node rank based on content popularit |
-
2016
- 2016-12-05 CN CN201611104729.9A patent/CN106686060B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104756449A (en) * | 2012-11-26 | 2015-07-01 | 三星电子株式会社 | Method of packet transmission from node and contentowner in content-centric networking |
| CN105099944A (en) * | 2014-04-22 | 2015-11-25 | 华为技术有限公司 | Data caching method and forwarding device |
| CN106101223A (en) * | 2016-06-12 | 2016-11-09 | 北京邮电大学 | A kind of caching method mated with node rank based on content popularit |
Non-Patent Citations (2)
| Title |
|---|
| JIALI YOU等: "《A potential energy based clustering algorithm of nodes for network media services》", 《2013 15TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATIONS TECHNOLOGY (ICACT)》 * |
| 梁程加: "《基于P2P_CDN的流媒体缓存机制研究与实现》", 《中国优秀硕士学位论文全文数据库·信息科技辑》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11258879B2 (en) * | 2017-06-19 | 2022-02-22 | Northeastern University | Joint routing and caching method for content delivery with optimality guarantees for arbitrary networks |
| WO2019057209A1 (en) * | 2017-09-25 | 2019-03-28 | 中兴通讯股份有限公司 | Local content caching method and apparatus, storage medium and electronic apparatus |
| CN109561469A (en) * | 2017-09-25 | 2019-04-02 | 中兴通讯股份有限公司 | Caching method, device, storage medium and the electronic device of local content |
| CN110875938A (en) * | 2018-08-31 | 2020-03-10 | 元一科技控股有限公司 | Method and device for sending information in block chain |
| US11677625B2 (en) | 2019-07-02 | 2023-06-13 | Northeastern University | Network and method for servicing a computation request |
| US11962463B2 (en) | 2019-07-02 | 2024-04-16 | Northeastern University | Network and method for servicing a computation request |
| CN110839166A (en) * | 2019-11-19 | 2020-02-25 | 中国联合网络通信集团有限公司 | Data sharing method and device |
| CN110839166B (en) * | 2019-11-19 | 2022-01-25 | 中国联合网络通信集团有限公司 | Data sharing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106686060B (en) | 2019-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106686060B (en) | A kind of method and system of content diffusion | |
| EP2704402B1 (en) | Method and node for distributing electronic content in a content distribution network | |
| CN107454562B (en) | ICN (Integrated Circuit network) architecture-oriented D2D mobile content distribution method | |
| Baccour et al. | Pccp: Proactive video chunks caching and processing in edge networks | |
| JP2011525312A (en) | Method and apparatus for prefetching data in a mobile network environment using edge data storage | |
| Si et al. | Spectrum management for proactive video caching in information-centric cognitive radio networks | |
| CN108541025B (en) | Wireless heterogeneous network-oriented base station and D2D common caching method | |
| KR101670910B1 (en) | Efficient cache selection for content delivery networks and user equipments | |
| CN109451517A (en) | A kind of caching placement optimization method based on mobile edge cache network | |
| Liu et al. | Deep learning-enabled file popularity-aware caching replacement for satellite-integrated content-centric networks | |
| Sun et al. | A proactive on-demand content placement strategy in edge intelligent gateways | |
| Kottursamy et al. | Optimized D-RAN aware data retrieval for 5G information centric networks | |
| KR20130087810A (en) | Method and apparatus for cooperative caching in mobile communication system | |
| CN107733949B (en) | Wireless access network caching method and system | |
| CN109644160B (en) | Hybrid method for name resolution and producer selection in ICN by classification | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| CN110139125B (en) | Video sharing method based on demand perception and resource caching in wireless mobile network | |
| CN105430062B (en) | It is a kind of based on interest-degree of correlation mobile P 2 P network data prefetching method | |
| CN101316281B (en) | P2P service node selection system and method | |
| CN110545300A (en) | Content caching method and device | |
| CN110139126B (en) | Mobile video system resource sharing method based on user interaction behavior perception | |
| CN114245422A (en) | Edge active caching method based on intelligent sharing in cluster | |
| KR101627625B1 (en) | Multi-protocol routing system and method driven by application and network in convergence | |
| CN113810461A (en) | Bandwidth control method, device, equipment and readable storage medium | |
| CN105162720A (en) | Data transmission reducing communication network and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210802 Address after: Room 1601, 16th floor, East Tower, Ximei building, No. 6, Changchun Road, high tech Industrial Development Zone, Zhengzhou, Henan 450001 Patentee after: Zhengzhou xinrand Network Technology Co.,Ltd. Address before: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District Patentee before: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES |
|
| TR01 | Transfer of patent right |