CN105188088B - Caching method and device based on content popularit and node replacement rate - Google Patents
Caching method and device based on content popularit and node replacement rate Download PDFInfo
- Publication number
- CN105188088B CN105188088B CN201510425463.7A CN201510425463A CN105188088B CN 105188088 B CN105188088 B CN 105188088B CN 201510425463 A CN201510425463 A CN 201510425463A CN 105188088 B CN105188088 B CN 105188088B
- Authority
- CN
- China
- Prior art keywords
- node
- content
- data packet
- pointer
- requesting
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of caching method and device based on content popularit and node replacement rate, this method comprises: in the data packet back for requesting service node to requesting node, pointer K is set in the data packet, and interval M is cached to the pointer assignment；Every to pass through a node in the data packet back, the pointer K subtracts 1；It detects whether the data packet reaches requesting node, if reaching, terminates；Otherwise, judge whether the pointer K is 0；According to judging result, the data packet is cached.On the one hand making Hot Contents in a network has more copy, to improve the service quality of requesting node；On the other hand regulate and control the caching of content by the content replacement rate of node, so that node avoids causing system performance to decline in high-frequency content replacement state.
Description
Technical field
The present invention relates to wireless communication technology fields, and in particular to a kind of slow based on content popularit and node replacement rate
Deposit method and device.
Background technique
Mobile ad-hoc network (Mobile Ad Hoc Network, MANET) because its without infrastructure, rapid networking,
The features such as survivability is strong receives more and more attention, and all has broad application prospects in military and civilian field.But
It is that network topology dynamic change caused by MANETE interior joint moves freely and the effective control for lacking infrastructure cause
MANET based on ICP/IP protocol is difficult to set up stable end-to-end link, this not only makes network be difficult to realize efficient number
According to transmission, the practical application of MANET is also counteracted.
Content center network (Content Centric Network, CCN) belongs to the Future Internet system of " revolution formula "
Framework can fundamentally solve the problems, such as that IP network exists in terms of scalability and content distribution validity.In CCN use
Hold name rather than IP address and carry out data transmitting, content itself is allowed to become the key element in network, so that internet is from IP
The network for ignoring content (content-oblivious) becomes the network of content oriented (content-oriented).
Content center mobile ad-hoc network (Content Centric MANET, CCMANET) is by content center network
Thought in (Content Centric Network, CCN) centered on content is applied to mobile ad-hoc network (Mobile
Ad Hoc Network, MANET) in and formed new network framework.In CCMANET, requesting node needs a certain content
Data Shi Huixiang surrounding neighbours node broadcasts interest packet (Interest Packet), when a node receives the interest packet, it
It first checks for the data whether local cache has request and is directly returned to requesting node if being cached with the data；Otherwise,
User's request can be transmitted to next-hop node until reaching a node for being cached with request content or source service node (general designation
For service node).Service node can return content-data packet (Data Packet) to requesting node, path along interest packet path
On any node can decide whether the copy for caching the content according to certain principle, to meet other nodes pair
The subsequent request of the content.CCMANET can overcome many disadvantages in traditional MANET, and bring new characteristic.Such as: no
Need to distribute IP address for each node, the routing based on content name avoids routing circuit, improves the peace in content transmission
Full property etc..
The research in relation to CCMANET both at home and abroad is in the starting stage at present, and gradually becomes a new research hotspot.
No matter to CCN or for MANET, caching is all one of its key technology.Therefore, to combining CCN's and MANET
For CCMANET, caching is necessarily also one of its key technology.Elementary tactics LCE (the Leave Copy of CCMANET
It Everywhere) is to cache the content in each node of data packet return path.This strategy can generate big in a network
Content redundancy backup is measured, the diversity of content is reduced.
Summary of the invention
For the defects in the prior art, the present invention provides a kind of caching based on content popularit and node replacement rate
Method and device reduces the redundancy of data in network, improves the diversity of content.
In a first aspect, the present invention provides a kind of caching method based on content popularit and node replacement rate, comprising:
In the data packet back for requesting service node to requesting node, pointer K is set in the data packet, and right
Pointer assignment caching interval M；
Every to pass through a node in the data packet back, the pointer K subtracts 1；
It detects whether the data packet reaches requesting node, if reaching, terminates；Otherwise, judge the pointer K whether be
0；
According to judging result, the data packet is cached.
Optionally, described according to judging result, cache the data packet, comprising:
When the pointer K is 0, judge whether present node remaining cache space can accommodate new data packets；
When present node remaining cache space can accommodate new data packets, then the data packet described in the nodal cache, simultaneously
Continue to forward the data packet to next node, resets K=M；
Or,
When present node remaining cache space can not accommodate new data packets, the interior of the node and its adjacent node is calculated
Hold replacement rate, and by the data pack buffer on the smallest node of content replacement rate, successively replaces the content replacement rate most
Content on small node, while continuing to forward the data packet to next node, reset K=M.
Optionally, the content successively replaced on the smallest node of content replacement rate, comprising:
The content on the smallest node of content replacement rate is successively replaced according to the sequence of content popularit from low to high.
Optionally, the caching is spaced M are as follows:
Wherein, P is content popularit, refers in the unit time that current serving Node provides the content to other requesting nodes
Number；S is content size, as unit of chunk；A is proportionality coefficient.
Second aspect, the present invention also provides a kind of buffer storage based on content popularit and node replacement rate, comprising:
Module is returned, in the data packet back for requesting service node to requesting node, in the data packet
Pointer K is set, and interval M is cached to the pointer assignment；
Processing module is returned, in the data packet back, every to pass through a node, the pointer K to subtract 1；
Detection module reaches requesting node in the data packet for detecting whether the data packet reaches requesting node
When, terminate the passback of the data packet；
Judgment module, for judging the finger when the detection module detects the data packet and do not reach requesting node
Whether needle K is 0；
Cache module, for caching the data packet according to judging result.
Optionally, the cache module, is used for:
When the pointer K is non-zero value, the data packet is forwarded to next node.
Optionally, the cache module, is used for:
When the pointer K is 0, judge whether present node remaining cache space can accommodate new data packets；
When present node remaining cache space can accommodate new data packets, then the data packet described in the nodal cache, simultaneously
Continue to forward the data packet to next node, resets K=M；
Or,
When present node remaining cache space can not accommodate new data packets, the interior of the node and its adjacent node is calculated
Hold replacement rate, and by the data pack buffer on the smallest node of content replacement rate, successively replaces the content replacement rate most
Content on small node, while continuing to forward the data packet to next node, reset K=M.
Optionally, the cache module, is used for:
The content on the smallest node of content replacement rate is successively replaced according to the sequence of content popularit from low to high.
Optionally, the caching is spaced M are as follows:
Wherein, P is content popularit, refers in the unit time that current serving Node provides the content to other requesting nodes
Number；S is content size, as unit of chunk；A is proportionality coefficient.
As shown from the above technical solution, a kind of caching side based on content popularit and node replacement rate provided by the invention
Method and device carry out assignment, setting caching interval, finally according to pointer by the way that pointer is arranged in the packet, and to the pointer
Numerical value and the data packet be all arrival requesting nodes, to cache the data packet, it is excessive to reduce certain node loads, content
Substitute excessively frequent problem.
Detailed description of the invention
Fig. 1 is a kind of stream for caching method based on content popularit and node replacement rate that one embodiment of the invention provides
Journey schematic diagram；
Fig. 2 be another embodiment of the present invention provides a kind of caching method based on content popularit and node replacement rate
Flow diagram；
Fig. 3 is a kind of knot for buffer storage based on content popularit and node replacement rate that one embodiment of the invention provides
Structure schematic diagram.
Specific embodiment
With reference to the accompanying drawing, the specific embodiment of invention is further described.Following embodiment is only used for more clear
Illustrate to Chu technical solution of the present invention, and not intended to limit the protection scope of the present invention.
Fig. 1 shows a kind of caching method based on content popularit and node replacement rate of one embodiment of the invention offer
Flow diagram, as shown in Figure 1, this method comprises the following steps:
101, in the data packet back for requesting service node to requesting node, pointer K is set in the data packet,
And interval M is cached to the pointer assignment.
It will be appreciated that service node is to return request content data packet to requesting node along request packet forward-path.
102, every to pass through a node in the data packet back, the pointer K subtracts 1；
103, it detects whether the data packet reaches requesting node, if reaching, terminates；Otherwise, judging the pointer K is
No is 0；
104, according to judging result, the data packet is cached.
The above method carries out assignment, setting caching interval, last root by the way that pointer is arranged in the packet, and to the pointer
It is all to reach requesting node to reduce certain node load mistakes to cache the data packet according to the numerical value of pointer and the data packet
Greatly, content substitutes excessively frequent problem.
The above method is described in detail below by specific embodiment.
Fig. 2 shows a kind of caching methods based on content popularit and node replacement rate that one embodiment of the invention provides
Flow diagram, as shown in Fig. 2, this method comprises the following steps:
201, in the data packet back for requesting service node to requesting node, pointer K is set in the data packet,
And interval M is cached to the pointer assignment.
Interval is cached in order to rationally determine, on the one hand to increase the number of copies of high content popularit in network, it is more to improve
Number requesting node requests the service quality of high content popularit；On the other hand the number of copies of big file content is reduced, to improve
The diversity of Web content.Therefore, caching interval calculation method provided by the invention are as follows:
Wherein, P is content popularit, refers in the unit time that current serving Node provides the content to other requesting nodes
Number；S is content size (as unit of chunk)；A is proportionality coefficient.
202, every to pass through a node in the data packet back, the pointer K subtracts 1；
203, it detects whether the data packet reaches requesting node, if reaching, terminates；Otherwise, step 204 is executed.
204, judge whether the pointer K is 0, if so, thening follow the steps 205, otherwise, execute step 202.
205, judge whether present node remaining cache space can accommodate new data packets, if so, step 206 is executed, it is no
Then follow the steps 207-208.
206, the data packet described in the nodal cache, while continuing to forward the data packet to next node, reset K=M.
207, the content replacement rate of the node and its adjacent node is calculated.
208, by the data pack buffer on the smallest node of content replacement rate, the content replacement rate is successively replaced most
Content on small node, while continuing to forward the data packet to next node, reset K=M.
Specifically, successively being replaced on the smallest node of content replacement rate according to the sequence of content popularit from low to high
Content.
For the loading condition and buffer status for accurately measuring node, the content center network based on node betweenness and replacement rate
Cache policy in netting, calculate node caches replacement rate Re (v) with the following method:
Wherein S (fi) it is that node v is replaced content fiSize (unit is chunk), C (v) is the cache size of node v,
M is the content number that unit time interior nodes v is replaced.
The above method can not only guarantee the service quality of high popularity content, additionally it is possible to improve the multiplicity of content in network
Property, effectively improve the utilization rate of nodes storage resource.
Determine which node on returned content path is slow by comprehensively considering content popularit and node replacement rate
Content-data is deposited, on the one hand making Hot Contents in a network has more copy, to improve the service quality of requesting node；
On the other hand regulate and control the caching of content by the content replacement rate of node, so that node avoids replacing in high-frequency content
State and cause system performance to decline.
Fig. 3 shows a kind of buffer storage based on content popularit and node replacement rate provided in an embodiment of the present invention
Structural schematic diagram, as shown in figure 3, the device includes:
Module 31 is returned, in the data packet back for requesting service node to requesting node, in the data packet
Middle setting pointer K, and interval M is cached to the pointer assignment；
Processing module 32 is returned, in the data packet back, every to pass through a node, the pointer K to subtract 1；
Detection module 33 reaches request section in the data packet for detecting whether the data packet reaches requesting node
When point, terminate the passback of the data packet；
Judgment module 34, for when the detection module detects the data packet and do not reach requesting node, described in judgement
Whether pointer K is 0；
Cache module 35, for caching the data packet according to judging result.
In a preferred embodiment of the present embodiment, the cache module 35 is used for:
When the pointer K is non-zero value, the data packet is forwarded to next node.
In a preferred embodiment of the present embodiment, the cache module 35 is used for:
When the pointer K is 0, judge whether present node remaining cache space can accommodate new data packets；
When present node remaining cache space can accommodate new data packets, then the data packet described in the nodal cache, simultaneously
Continue to forward the data packet to next node, and resets K=M；
Or,
When present node remaining cache space can not accommodate new data packets, the interior of the node and its adjacent node is calculated
Hold replacement rate, and by the data pack buffer on the smallest node of content replacement rate, successively replaces the content replacement rate most
Content on small node, while continuing to forward the data packet to next node, and K=M.
In a preferred embodiment of the present embodiment, the cache module 35 is used for:
The content on the smallest node of content replacement rate is successively replaced according to the sequence of content popularit from low to high.
The M of caching interval described in above-described embodiment are as follows:
Wherein, P is content popularit, refers in the unit time that current serving Node provides the content to other requesting nodes
Number；S is content size, as unit of chunk；A is proportionality coefficient.
Above-mentioned apparatus and the above method are one-to-one relationships, the present embodiment no longer to the implementation detail of above-mentioned apparatus into
Row is described in detail.
In specification of the invention, numerous specific details are set forth.It is to be appreciated, however, that the embodiment of the present invention can be with
It practices without these specific details.In some instances, well known method, structure and skill is not been shown in detail
Art, so as not to obscure the understanding of this specification.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme should all cover within the scope of the claims and the description of the invention.
Claims (4)
1. a kind of caching method based on content popularit and node replacement rate characterized by comprising
In the data packet back for requesting service node to requesting node, pointer K is set in the data packet, and to described
Pointer assignment caching interval M；
Every to pass through a node in the data packet back, the pointer K subtracts 1；
It detects whether the data packet reaches requesting node, if reaching, terminates；Otherwise, judge whether the pointer K is 0；
According to judging result, the data packet is cached；
Wherein, described according to judging result, cache the data packet, comprising:
When the pointer K is non-zero value, the data packet is forwarded to next node；
Wherein, described according to judging result, cache the data packet, comprising:
When the pointer K is 0, judge whether present node remaining cache space can accommodate new data packets；
When present node remaining cache space can accommodate new data packets, then the data packet described in the nodal cache, continues simultaneously
The data packet is forwarded to next node, resets K=M；
Or,
When present node remaining cache space can not accommodate new data packets, the content for calculating the node and its adjacent node is replaced
Rate is changed, and by the data pack buffer on the smallest node of content replacement rate, it is the smallest successively to replace the content replacement rate
Content on node, while continuing to forward the data packet to next node, reset K=M；
Wherein, the caching is spaced M are as follows:
Wherein, P is content popularit, refers to that current serving Node in the unit time provides time of the content to other requesting nodes
Number；S is content size, as unit of chunk；A is proportionality coefficient.
2. the method according to claim 1, wherein described successively replace the smallest node of content replacement rate
On content, comprising:
The content on the smallest node of content replacement rate is successively replaced according to the sequence of content popularit from low to high.
3. a kind of buffer storage based on content popularit and node replacement rate characterized by comprising
Module is returned, for being arranged in the data packet in the data packet back for requesting service node to requesting node
Pointer K, and interval M is cached to the pointer assignment；
Processing module is returned, in the data packet back, every to pass through a node, the pointer K to subtract 1；
Detection module, for detecting whether the data packet reaches requesting node, when the data packet reaches requesting node, knot
The passback of Shu Suoshu data packet；
Judgment module, for judging that the pointer K is when the detection module detects the data packet and do not reach requesting node
No is 0；
Cache module, for caching the data packet according to judging result；
Wherein；The cache module, is used for:
When the pointer K is non-zero value, the data packet is forwarded to next node；
Wherein, the cache module, is used for:
When the pointer K is 0, judge whether present node remaining cache space can accommodate new data packets；
When present node remaining cache space can accommodate new data packets, then the data packet described in the nodal cache, continues simultaneously
The data packet is forwarded to next node, resets K=M；
Or,
When present node remaining cache space can not accommodate new data packets, the content for calculating the node and its adjacent node is replaced
Rate is changed, and by the data pack buffer on the smallest node of content replacement rate, it is the smallest successively to replace the content replacement rate
Content on node, while continuing to forward the data packet to next node, reset K=M；
Wherein, the caching is spaced M are as follows:
Wherein, P is content popularit, refers to that current serving Node in the unit time provides time of the content to other requesting nodes
Number；S is content size, as unit of chunk；A is proportionality coefficient.
4. device according to claim 3, which is characterized in that the cache module is used for:
The content on the smallest node of content replacement rate is successively replaced according to the sequence of content popularit from low to high.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510425463.7A CN105188088B (en) | 2015-07-17 | 2015-07-17 | Caching method and device based on content popularit and node replacement rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510425463.7A CN105188088B (en) | 2015-07-17 | 2015-07-17 | Caching method and device based on content popularit and node replacement rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105188088A CN105188088A (en) | 2015-12-23 |
| CN105188088B true CN105188088B (en) | 2019-07-12 |
Family
ID=54909876
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510425463.7A Expired - Fee Related CN105188088B (en) | 2015-07-17 | 2015-07-17 | Caching method and device based on content popularit and node replacement rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105188088B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105577537A (en) * | 2015-12-25 | 2016-05-11 | 中国科学院信息工程研究所 | Multipath forwarding method and system of history record based information centric network |
| CN107070995A (en) * | 2017-03-16 | 2017-08-18 | 中国科学院信息工程研究所 | The caching method and device of a kind of content center network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118013A (en) * | 2013-01-16 | 2013-05-22 | 西安电子科技大学 | Method of sending data package and incidentally sending reverse interest package in content center network |
| CN103501315A (en) * | 2013-09-06 | 2014-01-08 | 西安交通大学 | Cache method based on relative content aggregation in content-oriented network |
| CN103581019A (en) * | 2013-10-10 | 2014-02-12 | 北京交通大学 | Information center network mobility management method based on content popularity |
| CN104253855A (en) * | 2014-08-07 | 2014-12-31 | 哈尔滨工程大学 | Content classification based category popularity cache replacement method in oriented content-centric networking |
| CN104753797A (en) * | 2015-04-09 | 2015-07-01 | 清华大学深圳研究生院 | Content center network dynamic routing method based on selective caching |
-
2015
- 2015-07-17 CN CN201510425463.7A patent/CN105188088B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118013A (en) * | 2013-01-16 | 2013-05-22 | 西安电子科技大学 | Method of sending data package and incidentally sending reverse interest package in content center network |
| CN103501315A (en) * | 2013-09-06 | 2014-01-08 | 西安交通大学 | Cache method based on relative content aggregation in content-oriented network |
| CN103581019A (en) * | 2013-10-10 | 2014-02-12 | 北京交通大学 | Information center network mobility management method based on content popularity |
| CN104253855A (en) * | 2014-08-07 | 2014-12-31 | 哈尔滨工程大学 | Content classification based category popularity cache replacement method in oriented content-centric networking |
| CN104753797A (en) * | 2015-04-09 | 2015-07-01 | 清华大学深圳研究生院 | Content center network dynamic routing method based on selective caching |
Non-Patent Citations (2)
| Title |
|---|
| 一种基于逗留时间的新型内容中心网络缓存策略;王国卿;《计算机学报》;20150531;全文 * |
| 内容中心网络中面向隐私保护的协作缓存策略;葛国栋;《电子与信息学报》;20150531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105188088A (en) | 2015-12-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ioannidis et al. | Jointly optimal routing and caching for arbitrary network topologies | |
| Kim et al. | Performance analysis of in-network caching for content-centric networking | |
| Zhang et al. | A survey of caching mechanisms in information-centric networking | |
| EP2813060B1 (en) | A method for collaborative caching for content-oriented networks | |
| CN106982248B (en) | caching method and device for content-centric network | |
| CN104038425B (en) | The method and apparatus for forwarding ether network packet | |
| CN103905332B (en) | A kind of method and apparatus for determining cache policy | |
| Guo et al. | Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks | |
| Le et al. | Social caching and content retrieval in disruption tolerant networks (DTNs) | |
| CN105357281B (en) | A kind of Mobile Access Network distributed content cache access control method and system | |
| CN110198341A (en) | A kind of collaboration caching method and system based on content popularit and node center degree | |
| Wang et al. | Energy-efficient ICN routing mechanism with QoS support | |
| CN107343304A (en) | The cooperation caching method of content center network | |
| Yamamoto | A survey of caching networks in content oriented networks | |
| Huang et al. | Multipath ring routing in wireless sensor networks | |
| CN108769252A (en) | A kind of ICN network pre-cache methods based on request content relevance | |
| Zhang et al. | A hybrid ICN cache coordination scheme based on role division between cache nodes | |
| CN105188088B (en) | Caching method and device based on content popularit and node replacement rate | |
| Banerjee et al. | Characteristic time routing in information centric networks | |
| CN103997461B (en) | Method for positioning cache of content centric network based on ant colony algorithm | |
| CN106210116B (en) | A kind of differentiation storage method and device based on content center network | |
| Dang et al. | Spray and forward: Efficient routing based on the Markov location prediction model for DTNs | |
| US10862858B2 (en) | Information centric approach in achieving anycast in machine type communications | |
| CN108183867A (en) | Information centre's network node buffer replacing method | |
| CN102647364B (en) | Method, device and system for Mesh network routing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190712 Termination date: 20210717 |