CN106686060B - A kind of method and system of content diffusion - Google Patents
A kind of method and system of content diffusion Download PDFInfo
- Publication number
- CN106686060B CN106686060B CN201611104729.9A CN201611104729A CN106686060B CN 106686060 B CN106686060 B CN 106686060B CN 201611104729 A CN201611104729 A CN 201611104729A CN 106686060 B CN106686060 B CN 106686060B
- Authority
- CN
- China
- Prior art keywords
- node
- content
- candidate
- nodes
- caching
- 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.)
- Active
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
Abstract
The present invention relates to a kind of method and system of content diffusion, this method is applied in the system being made of multiple nodes, wherein each node includes candidate node list the following steps are included: when any node receives content in multiple nodes, and the caching gain of all both candidate nodes in candidate node list is calculated according to content temperature；Any node maximizes caching gain according to selection in the caching gain of all both candidate nodes, will maximize the corresponding both candidate nodes of caching gain and is determined as both candidate nodes to be spread；The content received is forwarded to the both candidate nodes to be spread by any node.The system, including receiving module, computing module, selecting module, sending module and candidate node list.The present invention considers the characteristics of node capacity difference and content caching difference, node is grouped and is safeguarded according to network link status and content caching similitude, when there is content requests, fully consider the factors such as rarity of content, it is cached between service and the node that may have similar interests having the ability externally to provide, improves caching validity.
Description
Technical field
The present invention relates to internet areas, and in particular to it is a kind of based on caching gain calculate content diffusion method and be
System.
Background technique
Currently in internet, video and content service occupy the major part of network flow.Internet service is mentioned
For quotient, in order to ensure service quality, it will usually by technologies such as content distributing network and cloud services by large-scale user
Request reduce the pressure of service centre with decentralized processing, one side nearby, on the other hand reduce the waiting time of user, mention
High user 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 the nearest principle of the same operator or position, assign suitable service node.However, such structure is still
There are some problems, such as: the positional distance user of data center is still farther out, it is difficult to really embody " nearest "；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 utilized rationally,
And the total resources disposed is limited, the problem of service bottleneck can constantly occurs.
In view of the above-mentioned problems, it is desirable that reasonably user resources in network can be utilized, so as to improve content
The quality of service improves user experience.
Summary of the invention
Under the structure being the theme the purpose of the present invention is being to overcome the problems, such as traditional content service with content distributing network.
To achieve the above object, a kind of content method of diffusion provided by the invention and system, and in particular to one kind is based on slow
Depositing the method and system that the content that gain calculates is spread is the content diffusion using user resources, so that service hit rate is improved,
Promote user experience.On the one hand, the present invention provides a kind of methods of content diffusion, applied to the system being made of multiple nodes
In, wherein each node includes candidate node list；Characterized by 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
Gain is cached, the corresponding both candidate nodes of caching gain will be maximized and be determined as both candidate nodes to be spread；Any section in multiple nodes
The content received is forwarded to both candidate nodes to be spread by point.
Wherein, candidate node list includes: first node list and second node list, first node list be with compared with
The neighboring node list of good link connection transition, second node list are the similar node list with similar contents.
Specifically, it is wrapped in the step of calculating the caching gain of all both candidate nodes in candidate node list according to content temperature
It includes: being 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 issued to multiple nodes according to the accessed probability of content, content is calculated more according to the feedback information of inquiry message
Caching rate in candidate node list in a node；If caching rate is less than or equal to preset value T, calculate according to the following formula
The caching gain of all both candidate nodes in candidate node list, specific formula is as follows:
gf=G (popf,V,V')
Wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization
It is indicated by vector V '.
Any node issues inquiry message to multiple nodes according to the accessed probability of content in multiple nodes, according to inquiry
It includes: multiple nodes that the feedback information of information, which calculates the step of caching rate of the content in the candidate node list in multiple nodes,
Middle any node issues the first inquiry message according to the first both candidate nodes of accessed probability any node into multiple nodes, the
One both candidate nodes issue the second inquiry message to the second both candidate nodes, until n-th both candidate nodes issue 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 message
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, it the present invention provides a kind of system of content diffusion, is made of multiple nodes, each node includes to connect
Receive module, computing module, selecting module, sending module and candidate node list；Wherein,
Receiving module receives content for any node in multiple nodes.
Computing module, for being calculated and being waited according to content temperature according to when any node receives content in multiple nodes
Select the caching gain of all both candidate nodes in node listing.
Selecting module is maximized for any node in multiple nodes according to selection in the caching gain of all both candidate nodes
Gain is cached, the corresponding both candidate nodes of caching gain will be maximized and be determined as both candidate nodes to be spread.
The content received is forwarded to both candidate nodes to be spread for any node in multiple nodes by sending module.
Specifically, candidate node list includes: first node list and second node list, first node list be with
The neighboring node list of preferable link connection transition, second node list are the similar node list with similar contents.
Computing module is specifically used for, and is calculated according to content temperature and obtains the accessed general of content cache contents in a network
Rate；Any node issues inquiry message to multiple nodes according to the accessed probability of content in multiple nodes, according to inquiry message
Feedback information calculate caching rate of the content in the candidate node list in multiple nodes；If caching rate is less than or equal to preset value
T then calculates the caching gain of all both candidate nodes in the candidate node list according to the following formula, specific formula is as follows:
gf=G (popf,V,V')
Wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization
It is indicated by vector V '.Wherein, any node is any into the multiple node according to the accessed probability in multiple nodes
First both candidate nodes of node issue the first inquiry message, and the first both candidate nodes issue the second inquiry letter to the second both candidate nodes
Breath is believed until n-th both candidate nodes issue N inquiry message (N is positive integer) according to the first inquiry message, the second inquiry
The feedback information of breath and N inquiry message calculates the caching rate of the content, and circular is as follows: utilizing the network
In the node total number amount jumped divided by TTL of the number of nodes of content that has cached.
The beneficial effects of the present invention are: the present invention considers the characteristics of node capacity difference and content caching difference, by node
It is grouped and safeguards according to network link status and content caching similitude, when there is content requests, fully consider content
The factors such as rarity are cached between service and the node that may have similar interests having the ability externally to provide, improve caching
Validity.
Detailed description of the invention
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 of the present invention will be described in further detail.
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention make into
It is described in detail to one step, it is clear that described embodiments are only a part of the embodiments of the present invention, rather than whole implementation
Example.Based on the embodiments of the present invention, obtained by those of ordinary skill in the art without making creative efforts
Every other embodiment, shall fall within the protection scope of the present 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, applied in the system being made of multiple nodes, wherein each node includes candidate node list, both candidate nodes are arranged
Table includes: first node list and second node list, and first node list is neighbours' section with preferable link connection transition
Point list, second node list are the similar node list with similar contents.
Method includes the following steps: being calculated when any node receives content in multiple nodes 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
Have in the step of caching gain of both candidate nodes includes: to be calculated to obtain content cache contents in a network according to content temperature
Accessed probability；Any node issues inquiry message to multiple nodes according to the accessed probability of content in multiple nodes, according to
The feedback information of inquiry message calculates caching rate of the content in the candidate node list in multiple nodes；If caching rate be less than etc.
In preset value T, then the caching gain of all both candidate nodes in candidate node list is calculated according to the following formula, specific formula is such as
Under:
gf=G (popf,V,V')
Wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization
It is indicated by vector V '.
Wherein, any node according to the accessed probability of content issues inquiry message, root to multiple nodes in multiple nodes
The step of calculating caching rate of the content in the candidate node list in multiple nodes according to the feedback information of inquiry message includes: more
Any node issues the first inquiry according to the first both candidate nodes of accessed probability any node into multiple nodes in a node
Information, the first both candidate nodes issue the second inquiry message to the second both candidate nodes, ask until n-th both candidate nodes issue N
It asks information (N is positive integer), is calculated according to the feedback information of the first inquiry message, the second inquiry message and N inquiry message
The caching rate of content, circular are as follows: being jumped using the number of nodes of the content cached in the network divided by TTL
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, is calculated according to content temperature and obtain the accessed of content cache contents in a network
Probability.
Step S202: any node is according to the first time for being accessed probability any node into multiple nodes in multiple nodes
Node is selected to issue the first inquiry message, the first both candidate nodes issue the second inquiry message to the second both candidate nodes, until n-th
Both candidate nodes issue N inquiry message (N is positive integer), are inquired and are believed according to the first inquiry message, the second inquiry message and N
The feedback information of breath calculates the caching rate of content, and circular is as follows: utilizing 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: it if caching rate is less than or equal to preset value T, calculates in candidate node list according to the following formula
The caching gain of all both candidate nodes, specific formula is as follows:
gf=G (popf,V,V')
Wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization
It is indicated by vector 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 be determined as both candidate nodes to be spread.
Step S205: where the caching gain that each both candidate nodes are calculated according to caching gain calculating method, based on maximum
The target for changing gain selects suitable diffusion node to carry out content diffusion.
Caching gain can be calculated by content and network characterization, and calculation method includes but is not limited to:
F is to cache contents, probfIt is that content is calculated according to content temperature in global accessed probability；F' be
When inadequate buffer space, according to the content displaced of caching Substitution Rules.B for wanted cache node available bandwidth.
Each node p safeguards two node listings as diffusion both candidate nodes: the neighbours with preferable link connection state
Node listing and the node listing according to similar in the nodal distance of definition.
Wherein, the neighbor choice method in neighboring node list be according to the network distances of node p and other nodes or
Serviceability is selected, such as bandwidth is larger, one or more the less combination of the smaller, packet loss of delay, it is selected go out
Neighboring node list is expressed as PN={ pn1,...,pnM, the interstitial content for the neighboring node list that M is selected pair.
Nodal distance can be defined according to actual needs, comprising: content similarities, position proximity, content variety,
Behavioral similarity, and one of or a variety of combination.Node p also needs maintenance one to be calculated according to nodal distance definition
Close node listing PS={ ps1,...,psN}。
The content received is forwarded to both candidate nodes to be spread by any node in multiple nodes.Wherein wait spread candidate section
Point also need maintenance node residue can spatial cache, the information such as 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 process.
If caching rate is greater than preset value T, for indiffusion content, so terminating 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 provides
A kind of system of content diffusion, is made of multiple nodes, and each node includes receiving module 101, computing module 102, selection
Module 103, sending module 104 and candidate node list.
Wherein, candidate node list includes: first node list 105 and second node list 106, first node list
105 be the neighboring node list with preferable link connection transition, and second node 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 provides
A kind of system of content diffusion, is made of multiple nodes, and each node includes receiving module 101, computing module 102, selection
Module 103, sending module 104 and candidate node list；Wherein,
Receiving module 101 receives content for any node in multiple nodes.
Computing module 102, for being calculated according to content temperature according to when any node receives content in multiple nodes
The caching gain of all both candidate nodes in candidate node list.It has been cached in a network according to content temperature calculating acquisition content interior
The accessed probability held；Any node issues inquiry message to multiple nodes according to the accessed probability of content in multiple nodes,
Caching rate of the content in the candidate node list in multiple nodes is calculated according to the feedback information of inquiry message；If caching rate is small
In being equal to preset value T, then the caching gain of all both candidate nodes in the candidate node list is calculated according to the following formula, have
Body formula is as follows:
gf=G (popf,V,V')
Wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization
It is indicated by vector V '.Wherein, any node is any into the multiple node according to the accessed probability in multiple nodes
First both candidate nodes of node issue the first inquiry message, and the first both candidate nodes issue the second inquiry letter to the second both candidate nodes
Breath is believed until n-th both candidate nodes issue N inquiry message (N is positive integer) according to the first inquiry message, the second inquiry
The feedback information of breath and N inquiry message calculates the caching rate of the content, and circular is as follows: utilizing the network
In the node total number amount jumped divided by TTL of the number of nodes of content that has cached.
Selecting module 103 selects most for any node in multiple nodes according in the caching gain of all both candidate nodes
Bigization caches gain, will maximize the corresponding both candidate nodes of caching gain and is determined as both candidate nodes to be spread.
The content received is forwarded to both candidate nodes to be spread for any node in multiple nodes by sending module 104.
Specifically, candidate node list includes: first node list 105 and second node list 106, first node list
105 be the neighboring node list with preferable link connection transition, and second node list 106 is the similar section with similar contents
Point list.
The beneficial effects of the present invention are: the present invention considers the characteristics of node capacity difference and content caching difference, by node
It is grouped and safeguards according to network link status and content caching similitude, when there is content requests, fully consider content
The factors such as rarity are cached between service and the node that may have similar interests having the ability externally to provide, improve caching
Validity.
Above-described specific embodiment has carried out further the purpose of the present invention, technical scheme and beneficial effects
It is described in detail, it should be understood that being not intended to limit the present invention the foregoing is merely a specific embodiment of the invention
Protection scope, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should all include
Within protection scope of the present invention.
Claims (6)
1. a kind of method of content diffusion, applied in the system being made of multiple nodes, wherein each node includes candidate section
Point list；Characterized by comprising the following steps:
When any node receives content in the multiple node, institute in the candidate node list is calculated according to content temperature
There is the caching gain of both candidate nodes；Wherein, it is calculated according to content temperature and obtains the content quilt of cache contents in a network
Access probability；In the multiple node any node according to the accessed probability of the content any section into the multiple node
The both candidate nodes of point issue inquiry message, calculate the content in the multiple node according to the feedback information of the inquiry message
In candidate node list in caching rate；If the caching rate is less than or equal to preset value T, institute is calculated according to the following formula
The caching gain for stating all both candidate nodes in candidate node list, specific formula is as follows: gf=G (popf, V, V ') wherein, f be to
Cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network characterization passes through vector V ' indicates；
Any node maximizes caching gain according to selection in the caching gain of all both candidate nodes in the multiple node,
The corresponding both candidate nodes of maximization caching gain are determined as both candidate nodes to be spread；
The content received is forwarded to the both candidate nodes to be spread by any node in the multiple node.
2. the method according to claim 1, wherein the candidate node list include: first node list and
Second node list, the first node list are the neighboring node list with preferable link connection transition, second section
Point list is the similar node list with similar contents.
3. the method according to claim 1, wherein any node is according to the content in the multiple node
Accessed probability issues inquiry message to the multiple node, 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 multiple node includes:
In the multiple node any node according to the accessed probability into the multiple node any node first wait
Node is selected to issue the first inquiry message, first both candidate nodes issue the second inquiry message to the second both candidate nodes, until
N-th both candidate nodes issue N inquiry message, according to first inquiry message, the second inquiry message and N inquiry message
Feedback information calculate the caching rate of the content, circular is as follows: utilizing the content cached in the network
The node total number amount that number of nodes is jumped divided by TTL；
N is positive integer.
4. a kind of system of content diffusion, is made of, it is characterised in that: each node includes receiving module multiple nodes
101, computing module 102, selecting module 103, sending module 104 and candidate node list；Wherein,
Receiving module 101 receives content for any node in multiple nodes；
Computing module 102, for basis when any node receives content in multiple nodes, according to the calculating of content temperature
The caching gain of all both candidate nodes in candidate node list；Wherein, it is calculated according to content temperature and obtains the content in network
In cache contents accessed probability；Any node is according to the accessed probability of the content to described in the multiple node
The both candidate nodes of any node issue inquiry message in multiple nodes, are calculated in described according to the feedback information of the inquiry message
Hold the caching rate in the candidate node list in the multiple node；If the caching rate is less than or equal to preset value T, basis
Following formula calculates the caching gain of all both candidate nodes in the candidate node list, specific formula is as follows: gf=G
(popf, V, V ') wherein, f is to cache contents, popfFor the accessed temperature of content f, the correlated characteristic of node be V, network it is special
Sign is indicated by vector V '；
Selecting module 103, for being selected 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 maximization caching gain are determined as both candidate nodes to be spread；
The content received is forwarded to the candidate to be spread for any node in the multiple node by sending module 104
Node.
5. system according to claim 4, which is characterized in that the candidate node list includes: first node list 105
With second node list 106, the first node list 105 is the neighboring node list with preferable link connection transition, institute
Stating second node list 106 is the similar node list with similar contents.
6. system according to claim 4, which is characterized in that the computing module 102 is specifically used for, the multiple node
Middle any node issues first according to the first both candidate nodes of accessed probability any node into the multiple node and askes
Ask that information, first both candidate nodes issue the second inquiry message to the second both candidate nodes, until n-th both candidate nodes issue
N inquiry message calculates institute according to the feedback information of first inquiry message, the second inquiry message and N inquiry message
The caching rate of content is stated, circular is as follows: being jumped using the number of nodes of the content cached in the network divided by TTL
Node total number amount；
N is positive integer.
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 CN106686060A (en) | 2017-05-17 |
| CN106686060B true 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) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018236723A1 (en) * | 2017-06-19 | 2018-12-27 | Northeastern University | Joint routing and caching method for content delivery with optimality guarantees for arbitrary networks |
| 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 |
| CN110839166B (en) * | 2019-11-19 | 2022-01-25 | 中国联合网络通信集团有限公司 | Data sharing method and device |
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 |
|---|
| 《A potential energy based clustering algorithm of nodes for network media services》;Jiali You等;《2013 15th International Conference on Advanced Communications Technology (ICACT)》;20130328;全文 * |
| 《基于P2P_CDN的流媒体缓存机制研究与实现》;梁程加;《中国优秀硕士学位论文全文数据库·信息科技辑》;20110312;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106686060A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106686060B (en) | A kind of method and system of content diffusion | |
| Tran et al. | Cooperative hierarchical caching in 5G cloud radio access networks | |
| Dai et al. | A view synthesis-based 360° VR caching system over MEC-enabled C-RAN | |
| Sinky et al. | Responsive content-centric delivery in large urban communication networks: A LinkNYC use-case | |
| CN106101232A (en) | Load-balancing method and device | |
| CN107483286B (en) | Method for merging and deploying service function chain based on cloud-fog environment | |
| CN104507124A (en) | Management method for base station cache and user access processing method | |
| CN103338252A (en) | Distributed database concurrence storage virtual request mechanism | |
| CN104994515B (en) | A kind of gateway deployment method under information physical emerging system | |
| Choi et al. | Scalable service placement in the fog computing environment for the IoT-based smart city | |
| CN109672698A (en) | Content distribution method, equipment and system | |
| Sinky et al. | Adaptive edge-centric cloud content placement for responsive smart cities | |
| Zheng et al. | 5G network-oriented hierarchical distributed cloud computing system resource optimization scheduling and allocation | |
| CN110248206A (en) | A kind of resource allocation methods, device and electronic equipment for edge network system | |
| Raman et al. | Wi-stitch: Content delivery in converged edge networks | |
| CN108449388A (en) | A kind of multinode idleness of equipment aggregated bandwidth utilizes method and system | |
| CN105656978B (en) | A kind of resource share method and device | |
| Aloqaily et al. | Blockchain and fl-based network resource management for interactive immersive services | |
| Peng et al. | Value‐aware cache replacement in edge networks for Internet of Things | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| KR20130057232A (en) | Contents delivery network system having edge node and method for caching and managing contents | |
| CN108377473A (en) | File content distribution method in D2D is wireless buffer network and device | |
| CN113709853A (en) | Network content transmission method and device oriented to cloud edge collaboration and storage medium | |
| Sun et al. | A proactive on-demand content placement strategy in edge intelligent gateways | |
| CN112822726B (en) | Modeling and decision-making method for Fog-RAN network cache placement problem |
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 | ||
| 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 |