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
- candidate
- nodes
- list
- 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
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 present invention relates to internet arena, and in particular to method and be that a kind of content calculated based on caching gain is spread
System.
Background technology
It is current in the Internet, video and content service occupy the major part of network traffics.For Internet service is carried
For for business, in order to ensure service quality, it will usually by technologies such as content distributing network and cloud services by large-scale user
Request is carried out nearby and decentralized processing, on the one hand reduces the pressure of service centre, on the other hand reduces the waiting time of user, is carried
High Consumer's Experience.
Traditional content distribution mode, is all the data center deployment respective resources in different regions, when there is user's request
When, according to same operator or position principle nearby, assign suitable service node.However, such structure is still
There are problems that, for example：The positional distance user of data center is still farther out, it is difficult to real embodiment " nearby "；In network
User resources are huge, such as PC, mobile phone, Set Top Box etc., but still are idle states, and huge resource is not rationally utilized,
And the total resources of deployment is limited, the problem that can constantly occur servicing bottleneck.
For the problems referred to above, it is intended that reasonably can be utilized user resources in network, so as to improve content
The quality of service, improves Consumer's Experience.
The content of the invention
It is problem under the structure for overcoming traditional content service and being the theme with content distributing network that the purpose of the present invention is.
For achieving the above object, the present invention is provided a kind of content method of diffusion and system, and in particular to one kind is based on slow
The method and system for depositing the content diffusion of gain calculating are spread using the content of user resources, so as to improve service hit rate,
Lift Consumer's Experience.On the one hand, the invention provides a kind of method of content diffusion, is applied to the system being made up of multiple nodes
In, wherein each node includes candidate node list；Characterized in that, comprising the following steps：
When any node receives content in multiple nodes, institute in the candidate node list is calculated according to content temperature
There is the caching gain of both candidate nodes；Any node is maximized according to selection in the caching gain of all both candidate nodes in multiple nodes
Caching gain, will maximize the corresponding both candidate nodes of caching gain and is defined as both candidate nodes to be spread；Arbitrary section in multiple nodes
The content for receiving is forwarded to both candidate nodes to be spread by point.
Wherein, candidate node list includes：Primary nodal point list and secondary nodal point list, primary nodal point list be with compared with
The neighboring node list of good link connection transition, secondary nodal point list is the similar node list with similar contents.
Specifically, wrap in the step of calculating the caching gain of all both candidate nodes in candidate node list according to content temperature
Include：Calculated according to content temperature and obtain the content accessed probability of cache contents in a network；Any node in multiple nodes
Inquiry message is sent to multiple nodes according to the accessed probability of content, content is calculated many according to the feedback information of inquiry message
Caching rate in candidate node list in individual node；If caching rate is less than or equal to preset value T, calculated according to below equation
The caching gain of all both candidate nodes in candidate node list, concrete formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is V, network characterization
Represented by vectorial V ＇.
Any node sends inquiry message according to the accessed probability of content to multiple nodes in multiple nodes, according to inquiry
The step of feedback information of information calculates the caching rate in candidate node list of the content in multiple nodes includes：Multiple nodes
Middle any node sends the first inquiry message according to accessed probability to the first both candidate nodes of any node in multiple nodes, the
One both candidate nodes to the second both candidate nodes send the second inquiry message, until n-th both candidate nodes send N inquiry message (N
For positive integer), the slow of content is calculated according to the feedback information of the first inquiry message, the second inquiry message and N inquiry messages
Rate is deposited, circular is as follows：Using the number of nodes of the content cached in the network divided by TTL (time to
Live) the node total number amount jumped.
On the other hand, the invention provides a kind of system of content diffusion, is made up of multiple nodes, each node is included and connect
Receive module, computing module, selecting module, sending module and candidate node list；Wherein,
Receiver module, for any node in multiple nodes content is received.
Computing module, for basis when any node receives content in multiple nodes, calculates according to content temperature and waits
Select the caching gain of all both candidate nodes in node listing.
Selecting module, for selecting to maximize in caching gain of any node in multiple nodes according to all both candidate nodes
Caching gain, will maximize the corresponding both candidate nodes of caching gain and is defined as both candidate nodes to be spread.
Sending module, both candidate nodes to be spread are forwarded to for any node in multiple nodes by the content for receiving.
Specifically, candidate node list includes：Primary nodal point list and secondary nodal point list, primary nodal point list be with
The neighboring node list of preferable link connection transition, secondary nodal point list is the similar node list with similar contents.
Computing module according to content temperature specifically for calculating and obtaining the accessed general of content cache contents in a network
Rate；Any node sends inquiry message according to the accessed probability of content to multiple nodes in multiple nodes, according to inquiry message
Feedback information calculate caching rate in candidate node list of the content in multiple nodes；If caching rate is less than or equal to preset value
T, then calculate the caching gain of all both candidate nodes in the candidate node list according to below equation, and concrete formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is V, network characterization
Represented by vectorial V ＇.Wherein, in multiple nodes any node according to the accessed probability to arbitrary in the plurality of node
First both candidate nodes of node send the first inquiry message, and the first both candidate nodes to the second both candidate nodes send the second inquiry letter
Breath, until n-th both candidate nodes send N inquiry messages (N is positive integer), according to the first inquiry message, the second inquiry letter
The feedback information of breath and N inquiry messages calculates the caching rate of the content, and circular is as follows：Using the network
In the node total number amount jumped divided by TTL of the number of nodes of content that cached.
The invention has the beneficial effects as follows：The characteristics of present invention considers node capacity difference and content caching difference, by node
It is grouped and is safeguarded according to network link status and content caching similarity, when there are content requests, is taken into full account content
The factor such as rarity, is cached between the node for having the ability externally to provide service and may have similar interests, improves caching
Effectiveness.
Description of the drawings
Fig. 1 is a kind of method flow diagram of content diffusion provided in an embodiment of the present invention；
Fig. 2 is a kind of flow chart of method of diffusion provided in an embodiment of the present invention；
Fig. 3 is a kind of system construction drawing of content diffusion provided in an embodiment of the present invention；
Fig. 4 is a kind of system schematic of content diffusion provided in an embodiment of the present invention.
Specific embodiment
Below by drawings and Examples, technical scheme is described in further detail.
In order that the object, technical solutions and advantages of the present invention are clearer, below in conjunction with accompanying drawing the present invention is made into
One step ground is described in detail, it is clear that described embodiment is only a part of embodiment of the invention, rather than the enforcement of whole
Example.Based on the embodiment in the present invention, what those of ordinary skill in the art were obtained under the premise of creative work is not made
Every other embodiment, belongs to the scope of protection of the invention.
Fig. 1 is a kind of method flow diagram of content diffusion provided in an embodiment of the present invention.As shown in figure 1, a kind of content expands
Scattered method, in being applied to the system being made up of multiple nodes, wherein each node includes candidate node list, both candidate nodes row
Table includes：Primary nodal point list and secondary nodal point list, primary nodal point list is the section of the neighbours with preferable link connection transition
Point list, secondary nodal point list is the similar node list with similar contents.
The method is comprised the following steps：When any node receives content in multiple nodes, calculated according to content temperature
The caching gain of all both candidate nodes in candidate node list.Specifically, institute in candidate node list is calculated according to content temperature
The step of having the caching gain of both candidate nodes includes：Calculated according to content temperature and obtain content cache contents in a network
Accessed probability；Any node sends inquiry message according to the accessed probability of content to multiple nodes in multiple nodes, according to
The feedback information of inquiry message calculates the caching rate in candidate node list of the content in multiple nodes；If caching rate less than etc.
In preset value T, then the caching gain of all both candidate nodes in candidate node list is calculated according to below equation, concrete formula is such as
Under：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is V, network characterization
Represented by vectorial V ＇.
Wherein, any node sends inquiry message, root according to the accessed probability of content to multiple nodes in multiple nodes
The step of calculating the caching rate in candidate node list of the content in multiple nodes according to the feedback information of inquiry message includes：It is many
Any node sends the first inquiry according to accessed probability to the first both candidate nodes of any node in multiple nodes in individual node
Information, the first both candidate nodes to the second both candidate nodes send the second inquiry message, until n-th both candidate nodes send N inquiries
Information (N is positive integer) is asked, is calculated according to the feedback information of the first inquiry message, the second inquiry message and N inquiry messages
The caching rate of content, circular is as follows：Jumped divided by TTL using the number of nodes of the content cached in the network
Node total number amount.
Fig. 2 is a kind of flow chart of method of diffusion provided in an embodiment of the present invention.As shown in Fig. 2 step S201：When multiple
When any node receives content in node, calculated according to content temperature and obtain the accessed of content cache contents in a network
Probability.
Step S202：Any node is waited according to accessed probability to first of any node in multiple nodes in multiple nodes
Node is selected to send the first inquiry message, the first both candidate nodes to the second both candidate nodes send the second inquiry message, until n-th
Both candidate nodes send N inquiry messages (N is positive integer), are believed according to the first inquiry message, the second inquiry message and N inquiry
The feedback information of breath calculates the caching rate of content, and circular is as follows：Using the section of the content cached in the network
The node total number amount that point quantity is jumped divided by TTL.
Step S:203：If caching rate is less than or equal to preset value T, calculated in candidate node list according to below equation
The caching gain of all both candidate nodes, concrete formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is V, network characterization
Represented by vectorial V ＇.
Step S204：Any node maximizes caching according to selection in the caching gain of all both candidate nodes in multiple nodes
Gain, will maximize the corresponding both candidate nodes of caching gain and is defined as both candidate nodes to be spread.
Step S205：Wherein, the caching gain of each both candidate nodes is calculated according to caching gain calculating method, based on maximum
Change the target of gain, select suitable diffusion node to carry out content diffusion.
Caching gain can be calculated by content and network characterization, and computational methods are included but is not limited to：
F is to treat cache contents, probfIt is that content is calculated in global accessed probability according to content temperature；F' be
During inadequate buffer space, according to the content that caching Substitution Rules are displaced.B is the available bandwidth of wanted cache node.
Each node p safeguards two node listings as diffusion both candidate nodes：Neighbours with preferable link connection state
Node listing and the close node listing of nodal distance according to definition.
Wherein, the neighbor choice method in neighboring node list be according to the network distance of node p and other nodes or
Serviceability is selected, and such as bandwidth is larger, postpone less one or more the combination of less, packet loss, it is selected go out
Neighboring node list is expressed as PN={ pn1,...,pnM, M be it is selected to neighboring node list interstitial content.
Nodal distance can be defined according to the actual requirements, including：Content similarities, position proximity, content variety,
Behavioral similarity, and one of which or various combinations.Node p also needs to safeguard that one calculates according to nodal distance definition
Close node listing PS={ ps1,...,psN}。
The content for receiving is forwarded to both candidate nodes to be spread by any node in multiple nodes.Candidate's section wherein to be spread
Point also need to safeguard node residue can spatial cache, the information such as the size of nodal cache content, and by nodal distance, network state,
The information such as cache contents, available resources and node and the diffusion both candidate nodes of itself carry out periodical exchange.
Step S206：Terminate flow process.
If caching rate is more than preset value T, for indiffusion content, so terminating flow process.
Fig. 3 is a kind of system construction drawing of content diffusion provided in an embodiment of the present invention.As shown in figure 3, the present invention is provided
A kind of system of content diffusion, is made up of multiple nodes, each node comprising receiver module 101, computing module 102, select
Module 103, sending module 104 and candidate node list.
Wherein, candidate node list includes：Primary nodal point list 105 and secondary nodal point list 106, primary nodal point list
105 is the neighboring node list with preferable link connection transition, and secondary nodal point list 106 is the similar section with similar contents
Point list.
Fig. 4 is a kind of system schematic of content diffusion provided in an embodiment of the present invention.As shown in figure 4, the present invention is provided
A kind of system of content diffusion, is made up of multiple nodes, each node comprising receiver module 101, computing module 102, select
Module 103, sending module 104 and candidate node list；Wherein,
Receiver module 101, for any node in multiple nodes content is received.
Computing module 102, for basis when any node receives content in multiple nodes, calculates according to content temperature
The caching gain of all both candidate nodes in candidate node list.Calculated according to content temperature and obtained in content cached in a network
The accessed probability for holding；Any node sends inquiry message according to the accessed probability of content to multiple nodes in multiple nodes,
Caching rate in candidate node list of the content in multiple nodes is calculated according to the feedback information of inquiry message；If caching rate is little
In equal to preset value T, then the caching gain of all both candidate nodes in the candidate node list is calculated according to below equation, had
Body formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is V, network characterization
Represented by vectorial V ＇.Wherein, in multiple nodes any node according to the accessed probability to arbitrary in the plurality of node
First both candidate nodes of node send the first inquiry message, and the first both candidate nodes to the second both candidate nodes send the second inquiry letter
Breath, until n-th both candidate nodes send N inquiry messages (N is positive integer), according to the first inquiry message, the second inquiry letter
The feedback information of breath and N inquiry messages calculates the caching rate of the content, and circular is as follows：Using the network
In the node total number amount jumped divided by TTL of the number of nodes of content that cached.
Selecting module 103, for selecting most in caching gain of any node in multiple nodes according to all both candidate nodes
Bigization caches gain, will maximize the corresponding both candidate nodes of caching gain and is defined as both candidate nodes to be spread.
Sending module 104, both candidate nodes to be spread are forwarded to for any node in multiple nodes by the content for receiving.
Specifically, candidate node list includes：Primary nodal point list 105 and secondary nodal point list 106, primary nodal point list
105 is the neighboring node list with preferable link connection transition, and secondary nodal point list 106 is the similar section with similar contents
Point list.
The invention has the beneficial effects as follows：The characteristics of present invention considers node capacity difference and content caching difference, by node
It is grouped and is safeguarded according to network link status and content caching similarity, when there are content requests, is taken into full account content
The factor such as rarity, is cached between the node for having the ability externally to provide service and may have similar interests, improves caching
Effectiveness.
Above-described specific embodiment, has been carried out further to the purpose of the present invention, technical scheme and beneficial effect
Describe in detail, should be understood that the specific embodiment that the foregoing is only the present invention, be not intended to limit the present invention
Protection domain, all any modification, equivalent substitution and improvements within the spirit and principles in the present invention, done etc. all should include
Within protection scope of the present invention.
Claims (8)
1. a kind of method that content spreads, in being applied to the system being made up of multiple nodes, wherein each node includes candidate and saves
Point list；Characterized in that, comprising the following steps：
When any node receives content in the plurality of node, institute in the candidate node list is calculated according to content temperature
There is the caching gain of both candidate nodes；
Any node maximizes caching gain according to selection in the caching gain of all both candidate nodes in the plurality of node,
The corresponding both candidate nodes of caching gain that maximize are defined as into both candidate nodes to be spread；
The content for receiving is forwarded to the both candidate nodes to be spread by any node in the plurality of node.
2. method according to claim 1, it is characterised in that the candidate node list includes：Primary nodal point list and
Secondary nodal point list, the primary nodal point list is the neighboring node list with preferable link connection transition, the second section
Point list is the similar node list with similar contents.
3. method according to claim 1, it is characterised in that described that the candidate node list is calculated according to content temperature
In all both candidate nodes caching gain the step of include：
Calculated according to content temperature and obtain the content accessed probability of cache contents in a network；In the plurality of node
Any node sends inquiry message according to the accessed probability of the content to the plurality of node, according to the inquiry message
Feedback information calculates the caching rate in candidate node list of the content in the plurality of node；
If the caching rate is less than or equal to preset value T, all times in the candidate node list are calculated according to below equation
The caching gain of node is selected, concrete formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is that V, network characterization pass through
Vectorial V ＇ are represented.
4. method according to claim 3, it is characterised in that any node is according to the content in the plurality of node
Accessed probability to the plurality of node sends inquiry message, calculates the content according to the feedback information of the inquiry message and exists
The step of caching rate in candidate node list in the plurality of node, includes：
Any node is waited according to the accessed probability to first of any node in the plurality of node in the plurality of node
Node is selected to send the first inquiry message, first both candidate nodes to second both candidate nodes send the second inquiry message, one
Until n-th both candidate nodes send N inquiry messages (N is positive integer), according to first inquiry message, the second inquiry message
And the feedback information of N inquiry messages calculates the caching rate of the content, circular is as follows：Using in the network
The node total number amount that the number of nodes of the content for having cached is jumped divided by TTL.
5. a kind of system of content diffusion, is made up of multiple nodes, it is characterised in that：Described each node includes receiver module
101st, computing module 102, selecting module 103, sending module 104 and candidate node list；Wherein,
Receiver module 101, for any node in multiple nodes content is received；
Computing module 102, for basis when any node receives content in multiple nodes, according to content temperature is calculated
The caching gain of all both candidate nodes in candidate node list；
Selecting module 103, for selecting most in caching gain of any node in multiple nodes according to all both candidate nodes
Bigization caches gain, and the corresponding both candidate nodes of caching gain that maximize are defined as into both candidate nodes to be spread；
Sending module 104, the candidate to be spread is forwarded to for any node in the plurality of node by the content for receiving
Node.
6. system according to claim 5, it is characterised in that the candidate node list includes：Primary nodal point list 105
With secondary nodal point list 106, the primary nodal point list 105 is the neighboring node list with preferable link connection transition, institute
It is the similar node list with similar contents to state secondary nodal point list 106.
7. system according to claim 5, it is characterised in that the computing module 102 is specifically for according to content temperature
Calculate and obtain the content accessed probability of cache contents in a network；Any node is according to described in the plurality of node
The accessed probability of content sends inquiry message to the plurality of node, according to the feedback information of the inquiry message is calculated
Caching rate in candidate node list of the content in the plurality of node；
If the caching rate is less than or equal to preset value T, all times in the candidate node list are calculated according to below equation
The caching gain of node is selected, concrete formula is as follows：
gf=G (popf,V,V')
Wherein, f is to treat cache contents, popfCorrelated characteristic for the accessed temperature of content f, node is that V, network characterization pass through
Vectorial V ＇ are represented.
8. system according to claim 7, it is characterised in that the computing module 102 is specifically for the plurality of node
Middle any node sends the first inquiry according to the accessed probability to the first both candidate nodes of any node in the plurality of node
Information is asked, first both candidate nodes to second both candidate nodes send the second inquiry message, until n-th both candidate nodes
N inquiry messages (N is positive integer) are sent, according to first inquiry message, the second inquiry message and N inquiry messages
Feedback information calculates the caching rate of the content, and circular is as follows：Using the section of the content cached in the network
The node total number amount that point quantity is jumped divided by TTL.
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 |
|---|---|---|
| Stergiou et al. | IoT-based big data secure management in the fog over a 6G wireless network | |
| CN106686060A (en) | Content spread method and system | |
| Huang et al. | A queuing delay utilization scheme for on-path service aggregation in services-oriented computing networks | |
| CN109413211B (en) | Architecture of EOS block chain super node and implementation method thereof | |
| CN108156596B (en) | Method for supporting D2D-cellular heterogeneous network combined user association and content caching | |
| CN110086886B (en) | Dynamic session holding method and device | |
| Sinky et al. | Responsive content-centric delivery in large urban communication networks: A LinkNYC use-case | |
| CN104734962B (en) | A kind of resource search method of non-structural P 2 P network | |
| WO2023108718A1 (en) | Spectrum resource allocation method and system for cloud-edge collaborative optical carrier network | |
| CN105245592B (en) | Mobile network base station cache contents laying method based on adjacent cache cooperation | |
| CN103024085A (en) | System and method for processing P2P (peer-to-peer) node request | |
| CN113407249B (en) | Task unloading method facing to position privacy protection | |
| CN109672698A (en) | Content distribution method, equipment and system | |
| CN108541025B (en) | Wireless heterogeneous network-oriented base station and D2D common caching method | |
| Yen et al. | Cooperative online caching in small cell networks with limited cache size and unknown content popularity | |
| CN105656978B (en) | A kind of resource share method and device | |
| CN108449388A (en) | A kind of multinode idleness of equipment aggregated bandwidth utilizes method and system | |
| CN102377826B (en) | Method for optimal placement of unpopular resource indexes in peer-to-peer network | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| CN104170342A (en) | Content processing method and network side device | |
| CN101394339A (en) | Method, system and apparatus for routing implementation in peer-to-peer network | |
| CN106209952A (en) | Service node distribution method, device, CDN management server and system | |
| CN107094175A (en) | A kind of server disposition structure and interoperability methods for realizing interworking between network | |
| CN106230723A (en) | A kind of message forwarding cache method and device | |
| CN103188278B (en) | Method and system for content data distribution |
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 |