CN106453518A - Energy efficient content centric network distribution type caching method - Google Patents
Energy efficient content centric network distribution type caching method Download PDFInfo
- Publication number
- CN106453518A CN106453518A CN201610836120.4A CN201610836120A CN106453518A CN 106453518 A CN106453518 A CN 106453518A CN 201610836120 A CN201610836120 A CN 201610836120A CN 106453518 A CN106453518 A CN 106453518A
- Authority
- CN
- China
- Prior art keywords
- node
- content
- model
- excitation
- energy consumption
- 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.)
- Pending
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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an energy efficient content centric network distribution type caching method, comprising the following steps: designing a content caching energy consumption model and a transmission energy consumption model; extracting the factors needed for a game theory model; constructing a non-cooperative game model; designing incentive mechanism for each network node to encourage the nodes to cache more popular network content; according to the node incentives, constructing a utility function with incentives; combining the non-cooperative game model and the utility function with incentives; establishing an energy efficient CCN distribution type caching algorithm model; and proving the existence of Nash equilibrium solution for non-cooperative game; and solving the solution of model. With the adoption of the technical schemes of the invention, it is possible to reduce network energy consumption more effectively.
Description
Technical field
The invention belongs to content center network technical field, particularly relate to the content center network distribution of a kind of Energy Efficient
Formula caching method.
Background technology
With the surge of network traffics, internet communication is more concerned with Web content itself, and the position that non-content is in a network
Put.But, the internet being currently based on end-to-end communication cannot effectively support that Web content transmits, and it reduces existing network
Performance.By being analyzed network traffic flow, there is substantial amounts of redundant transmission, wherein, audio frequency and video, figure in discovery Web content
The application of the content distribution type such as piece, microblogging repeats transmission problem and is particularly acute.Content be close to the users deployment be effectively solution content weight
Multiple transmission, the effective means improving Web content distribution efficiency.Cost as how minimum rationally caches mass network content pair
It is an important and challenging topic for Many researchers.
Compared with application layer solution, content center network (Content-Centric Networking, CCN) uses
The thought of " network internal caching ", the problem solving Web content redundant transmission from Internet angle, and then overcome application layer
Solution and business close-coupled, cannot perception bearer network information, lack extensibility, operation support system imperfection etc. and ask
Topic, fundamentally solves network traffics proliferation issues.In current CCN cache algorithm, network energy consumption optimization aim progressively by
Consider.
Tradition CCN cache replacement policy typically uses CCN to carry ALWAYS cache decision strategy and flows through to cache each
The content of node, and it is slow to use LRU (Least Recently Used, LRU) cache replacement algorithm to update
Deposit content.The method has 3 deficiencies：(1) cache decision do not account for when whether storing content the otherness of content popularit with
Internodal otherness, the problem also not accounting for collaborative caching between node, causes the unreasonable placement of Web content；(2) when depositing
When storage space is expired, caching only considers the impact of time factor when replacing content so that cache replacement algorithm exists bigger
Limitation, it is difficult to be widely used；(3) cache algorithm design process does not accounts for energy consumption the shadow bringing is designed to cache algorithm
Ring, it is impossible to effectively solve the energy consumption problem that current network is paid close attention to.
Content of the invention
For the deficiency of above-mentioned tradition cache algorithm, the present invention provides the CCN distributed caching method of a kind of Energy Efficient,
On the basis of using for reference existing cache algorithm, it is considered to the impact on cache algorithm for the energy consumption, and utilize the non-conjunction with incentive mechanism
As betting model analyze CCN network node selfishness caching behavior, it is achieved the distributed network cache algorithm of Energy Efficient with
Web content transmits.
For solving the problems referred to above, the present invention adopts the following technical scheme that：
The content center network distributed caching method of a kind of Energy Efficient, comprises the steps：
(1) energy consumption model is designed
Content, in transmitting procedure, relates to two kinds of energy consumption models：Content caching energy consumption modelWith transmission energy consumption model Represent in the energy consumption needed for time t interior nodes i cache contents k,Represent node i when node j request content k
Required transmission energy consumption；
(2) non-cooperative game model is built
WithRepresenting non-cooperative game, wherein N={1,2 ..., 64} is game participant,It is to describe
Storage states to Web content for 64 nodes, energy utility functionRepresent node i with regard to interior
The cost of energy of appearance k, wherein, if node i reproducting content k, then Ii=1, otherwise, Ii=0；
(3) design node excitation
If node i caches certain content, other nodes, when node i asks this content, need to provide excitation to mend to node i
Help, if RiIt is the excitation sum that node i is received with regard to cache contents k, thenIf node i receive with regard to interior
Hold excitation sum R of kiEncourage boundary t more than or equal to certaini, then node i cache contents k；
(4) utility function with excitation is built
If node viCache contents k, then node i is to node viExcitation b is providedi；If node i cache contents k, then
Receiving excitation sum is Ri, for content k, what node i provided is actuated toThe energy utility function of node i isWherein, viIt is the recipient that node i provides excitation；
(5) the CCN distributed caching algorithm model of Energy Efficient is set up
Non-cooperative game model in integrating step (2) and the band incentive utility function in step (4), set up Energy Efficient
Content center network distributed caching algorithm model, with regard to content k, if the caching energy consumption of node iWith the excitation obtaining
Difference obtain transmission energy consumption model needed for content k less than from other nodesThen node i cache contents k, otherwise, node i is not
Cache contents k, and from other nodes request content k, provide excitation to compensate for this node simultaneously；
(6) distributed solution is obtained
The excitation function that will obtain in the non-cooperative game model obtaining in step (2) and step (4), is input to step
(5), in the CCN distributed caching algorithm model of the Energy Efficient set up, energy in game theory theoretical proof step (5) is used
There is Nash Equilibrium Solution in effective content center network distributed caching algorithm model, and obtains final distributed solution.
As preferably,wcaIt is the storage efficiency of node, skIt is the size of content k； It is the request rate to content k for the node i, dijIt is node i and node j
Between distance,It is the power density of node,It is ROADM (Reconfigurable
Optical Add-Drop Multiplexer, ROADM) power density.
The main thought of the inventive method is：Design content caching energy consumption and transmission energy consumption model；Extract game theoretical model
The required factor, builds non-cooperative game model；It for encouraging node many buffer network popular content, is each network node design
Incentive mechanism；According to node activations, build the utility function with excitation；In conjunction with non-cooperative game model and the effectiveness letter with excitation
Number, sets up the CCN distributed caching algorithm model of Energy Efficient；Prove non-cooperative game Nash Equilibrium (Nash
Equilibrium) existence of solution, and the distributed solution of solving model.
Compared with prior art, the present invention has following obvious advantage and beneficial effect：
(1) present invention proposes the CCN distributed caching algorithm model of a kind of Energy Efficient, fast convergence rate, and universality is good,
Can effectively reduce network energy consumption.
(2) present invention uses for reference the advantage of tradition cache algorithm, introduces this optimization aim of network energy consumption, utilizes with excitation
Non-cooperative game theory builds cache algorithm model, finally carries out distributed solving.Compare tradition cache algorithm, side of the present invention
Method can more effectively reduce network energy consumption.Experiment shows, uses the inventive method to carry out analysis of simulation experiment, and discovery energy has
The average energy consumption saving rate of the CCN distributed caching algorithm of effect is 25%, improves 22% than traditional cache algorithm, and has relatively
Fast convergence rate and preferable universality.
Brief description
Fig. 1 is the content center network distributed caching method flow chart of the Energy Efficient of the present invention.
Detailed description of the invention
The present invention will be further described with detailed description of the invention below in conjunction with the accompanying drawings.
The embodiment of the present invention provides the content center network distributed caching method of a kind of Energy Efficient, as it is shown in figure 1, bag
Include following steps：
(1) energy consumption model is designed
Content, in transmitting procedure, relates to content caching energy consumption modelWith transmission energy consumption modelWherein,wcaIt is the storage efficiency of node, skIt is the size of content k. It is the request rate to content k for the node i, dijIt is the distance between node i and node j,It is the power density of node,
It is the power of ROADM (Reconfigurable Optical Add-Drop Multiplexer, ROADM)
Density, is the power density of Wave division multiplexing (Wavelength Division Multiflexing, WDM).
(2) non-cooperative game model is built
WithRepresenting non-cooperative game, wherein N={1,2 ..., 64} is game participant,It is to describe
Storage states to Web content for 64 nodes, energy utility functionRepresent node i with regard to interior
Hold the cost of energy of k.Wherein, if node i reproducting content k, then Ii=1, otherwise, Ii=0.
(3) design node excitation
During certain content of nodal cache, self need to consume caching energy consumption.For encouraging network node buffer network more
Hot content, during the content of other this nodes of node visit, it is desirable to provide certain excitation.The excitation receiving when node more than or
Encourage boundary, then this content of nodal cache equal to certain.For example, if node i provides an excitation b to node ji, and save
Point j caches this content, then node i must provide excitation b to node ji.If node j does not cache this content, node i without
This excitation need to be provided.
If node i caches certain content, other nodes, when node i asks this content, need to provide necessarily to node i
Excitation subsidy.RiIt is the excitation sum that node i is received with regard to cache contents k, thenIf node i receives
Excitation sum R with regard to content kiEncourage boundary t more than or equal to certaini, then node i cache contents k.
(4) utility function with excitation is built
If node viCache contents k, then node i is to node viExcitation b is providedi.If node i cache contents k, then
Receive excitation Ri.Therefore, for content k, what node i provided is actuated toThe energy utility function of node i isWherein, viIt is the recipient that node i provides excitation.
(5) the content center network distributed caching algorithm model of Energy Efficient is set up
Non-cooperative game model in integrating step (2) and the band incentive utility function in step (4), build with excitation
Non-cooperative game model, i.e. sets up the content center network distributed caching algorithm model of Energy Efficient.With regard to content k, if
The caching energy consumption of node iObtain transmission energy consumption model needed for content k with the difference of the excitation obtaining less than from other nodes
Then node i cache contents k.Otherwise, node i not cache contents k, and from other nodes request content k, provide for this node simultaneously
Certain excitation compensates.
(6) distributed solution is obtained
The excitation function that will obtain in the non-cooperative game model obtaining in step (2) and step (4), is input to step
(5), in the CCN distributed caching algorithm model of the Energy Efficient set up, energy in game theory theoretical proof step (5) is used
There is Nash Equilibrium Solution in effective content center network distributed caching algorithm model, and obtains final distributed solution.Dividing
In cloth solution procedure, if nodal cache content, although certain caching energy consumption can be consumed, but transmission energy consumption can be reduced,
And other nodes are when this node obtains content, need to provide certain excitation, therefore, cache node consumption to cache node
Caching energy consumption with neighbouring, cache node is accessed that node is public to be shared.In order at utmost reduce network energy consumption, routed path
On each node compare local cache content required caching energy consumption with from transmitting the big of energy consumption needed for other node request contents
Little.If caching energy consumption is less than transmission energy consumption, this content of nodal cache, vice versa.
In order to verify effectiveness of the invention, and the quality of performance compared with tradition cache algorithm, carry out three groups pairs
Than experiment.
Table 1 the inventive method and the comparative result of tradition cache algorithm energy consumption
As can be seen from Table 1, the average energy consumption saving rate using the inventive method design cache algorithm is 25%, than tradition
The performance of cache algorithm improves 22%, significantly reduces network energy consumption.
Table 2 the inventive method and the comparative result of tradition cache algorithm universality
As can be seen from Table 2, use the inventive method design cache algorithm Power-Law, Transit-Stub,
There is under Waxman typical network topology preferable universality.
Additionally, by the convergence rate observing the inventive method under different parameters, discovery the inventive method convergence rate is relatively
Hurry up.
The content center network distributed caching method of the Energy Efficient of the present invention, design content caching energy consumption and transmission energy
Consumption model；Extract the factor needed for game theoretical model, build non-cooperative game model；In encouraging the many buffer network of node popular
Hold, be each network node design incentive mechanism；According to node activations, build the utility function with excitation；Win in conjunction with non-cooperation
Play chess model and the utility function with excitation, set up the CCN distributed caching algorithm model of Energy Efficient；Prove that non-cooperative game is received
Assorted equilibrium (Nash equilibrium) existence of solution, and the distributed solution of solving model.The present invention uses for reference tradition cache algorithm
Advantage, introduce this optimization aim of network energy consumption, utilize band encourage non-cooperative game theory build cache algorithm model,
Finally carry out distributed solving.Comparing tradition cache algorithm, the inventive method can more effectively reduce network energy consumption.Experiment table
Bright, use the inventive method to carry out analysis of simulation experiment, the average energy consumption joint of the CCN distributed caching algorithm of discovery Energy Efficient
Province's rate is 25%, improves 22% than traditional cache algorithm, and has convergence rate and preferable universality faster.
Claims (2)
1. the content center network distributed caching method of an Energy Efficient, it is characterised in that comprise the steps：
(1) energy consumption model is designed
Content, in transmitting procedure, relates to two kinds of energy consumption models：Content caching energy consumption modelWith transmission energy consumption modelRepresent in the energy consumption needed for time t interior nodes i cache contents k,Represent node i when node j request content k
Required transmission energy consumption；
(2) non-cooperative game model is built
WithRepresenting non-cooperative game, wherein N={1,2 ..., 64} is game participant,Depict 64
The storage state to Web content for the individual node, energy utility functionRepresent node i with regard to content k
Cost of energy, wherein, if node i reproducting content k, then Ii=1, otherwise, Ii=0；
(3) design node excitation
If node i caches certain content, other nodes, when node i asks this content, need to provide excitation subsidy to node i,
If RiIt is the excitation sum that node i is received with regard to cache contents k, thenIf node i receive with regard to content k
Excitation sum RiEncourage boundary t more than or equal to certaini, then node i cache contents k；
(4) utility function with excitation is built
If node viCache contents k, then node i is to node viExcitation b is providedi；If node i cache contents k, then receive
Excitation sum is Ri, for content k, what node i provided is actuated toThe energy utility function of node i isWherein, viIt is the recipient that node i provides excitation；
(5) the CCN distributed caching algorithm model of Energy Efficient is set up
Non-cooperative game model in integrating step (2) and the band incentive utility function in step (4), set up the interior of Energy Efficient
Hold central site network distributed caching algorithm model, with regard to content k, if the caching energy consumption of node iDifference with the excitation obtaining
Obtain transmission energy consumption model needed for content k less than from other nodesThen node i cache contents k, otherwise, node i does not caches
Content k, and from other nodes request content k, provide excitation to compensate for this node simultaneously；
(6) distributed solution is obtained
The excitation function that will obtain in the non-cooperative game model obtaining in step (2) and step (4), is input to step (5) institute
In the CCN distributed caching algorithm model of the Energy Efficient set up, use Energy Efficient in game theory theoretical proof step (5)
There is Nash Equilibrium Solution in content center network distributed caching algorithm model, and obtains final distributed solution.
2. the content center network distributed caching method of Energy Efficient as claimed in claim 1, it is characterised in thatwcaIt is the storage efficiency of node, skIt is the size of content k； It is the request rate to content k for the node i, dijIt is the distance between node i and node j,It is the power density of node,
It is the power of ROADM (Reconfigurable Optical Add-Drop Multiplexer, ROADM)
Density.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610836120.4A CN106453518A (en) | 2016-09-20 | 2016-09-20 | Energy efficient content centric network distribution type caching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610836120.4A CN106453518A (en) | 2016-09-20 | 2016-09-20 | Energy efficient content centric network distribution type caching method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106453518A true CN106453518A (en) | 2017-02-22 |
Family
ID=58167457
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610836120.4A Pending CN106453518A (en) | 2016-09-20 | 2016-09-20 | Energy efficient content centric network distribution type caching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106453518A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106998353A (en) * | 2017-02-27 | 2017-08-01 | 上海大学 | A kind of optimal cached configuration method of file in content center network |
| CN108900618A (en) * | 2018-07-04 | 2018-11-27 | 重庆邮电大学 | Content buffering method in a kind of information centre's network virtualization |
| CN109639844A (en) * | 2019-02-26 | 2019-04-16 | 北京隆普智能科技有限公司 | A kind of base station and the content buffering method based on localized epidemics' degree |
| CN110062037A (en) * | 2019-04-08 | 2019-07-26 | 北京工业大学 | Content distribution method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143199A (en) * | 2010-10-19 | 2011-08-03 | 华为技术有限公司 | Content acquisition method, node and content network |
| US20140269414A1 (en) * | 2013-03-15 | 2014-09-18 | Elwha LLC, a limited liability corporation of the State of Delaware | Frequency accommodation |
-
2016
- 2016-09-20 CN CN201610836120.4A patent/CN106453518A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102143199A (en) * | 2010-10-19 | 2011-08-03 | 华为技术有限公司 | Content acquisition method, node and content network |
| US20140269414A1 (en) * | 2013-03-15 | 2014-09-18 | Elwha LLC, a limited liability corporation of the State of Delaware | Frequency accommodation |
Non-Patent Citations (2)
| Title |
|---|
| 方超 等: "《A Game Theortic Approach for Energy-Efficient In-Network Caching in Content-Centric Networks》", 《中国通信》 * |
| 方超: "《信息中心网络绿色节能机制研究》", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106998353A (en) * | 2017-02-27 | 2017-08-01 | 上海大学 | A kind of optimal cached configuration method of file in content center network |
| CN106998353B (en) * | 2017-02-27 | 2020-07-31 | 上海大学 | Optimal caching configuration method for files in content-centric networking |
| CN108900618A (en) * | 2018-07-04 | 2018-11-27 | 重庆邮电大学 | Content buffering method in a kind of information centre's network virtualization |
| CN109639844A (en) * | 2019-02-26 | 2019-04-16 | 北京隆普智能科技有限公司 | A kind of base station and the content buffering method based on localized epidemics' degree |
| CN110062037A (en) * | 2019-04-08 | 2019-07-26 | 北京工业大学 | Content distribution method and device |
| CN110062037B (en) * | 2019-04-08 | 2021-08-20 | 北京工业大学 | Content distribution method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106453518A (en) | Energy efficient content centric network distribution type caching method | |
| CN103475719B (en) | The content distribution method that in a kind of CDN-P2P UNE, cross-domain flow rate minimizes | |
| CN104168620B (en) | Method for routing foundation in wireless multi-hop return network | |
| CN102271379B (en) | Energy-saving routing method of nodes of internet of things based on context-aware technology | |
| CN106131182A (en) | A kind of cooperation caching method based on Popularity prediction in name data network | |
| CN114884895B (en) | Intelligent flow scheduling method based on deep reinforcement learning | |
| CN105847149B (en) | Wireless Delay Tolerant Network method for routing based on multitiered network | |
| CN110198341A (en) | A kind of collaboration caching method and system based on content popularit and node center degree | |
| Fang et al. | Energy-efficient distributed in-network caching for content-centric networks | |
| CN107105043A (en) | A kind of content center network caching method based on software defined network | |
| CN101551781B (en) | Method of magnetic disc cache replacement in P2P video on demand system | |
| CN110061881A (en) | A kind of energy consumption perception virtual network mapping algorithm based on Internet of Things | |
| CN106506373A (en) | A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory | |
| Wang et al. | Incentive-aware blockchain-assisted intelligent edge caching and computation offloading for IoT | |
| CN103152788A (en) | Game-based VMIMO (Virtual Multiple Input Multiple Output) cooperative routing method | |
| CN106572168A (en) | Content value caching-based content center network collaborative caching method and system | |
| CN207304583U (en) | A kind of edge network architecture of Internet of things based on software defined network | |
| CN110324175B (en) | Network energy-saving method and system based on edge cache | |
| Wu et al. | An energy efficient cluster-head rotation and relay node selection scheme for farmland heterogeneous wireless sensor networks | |
| Jalali et al. | A fuzzy reputation system in vehicular ad hoc networks | |
| CN103166861B (en) | A kind of layered multicast maximum throughput metering method solving optical-fiber network | |
| CN107018181A (en) | P2P network establishing methods based on flow medium live system | |
| Bianco et al. | On the energy consumption computation in content delivery networks | |
| CN106612298B (en) | A kind of content distribution method and system based on large-scale network node | |
| CN109862121B (en) | Cache placement method in information center network based on Dijkstra algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170222 |
|
| RJ01 | Rejection of invention patent application after publication |