CN105188088A - Content popularity and node replacement rate-based caching method and device - Google Patents
Content popularity and node replacement rate-based caching method and device Download PDFInfo
- Publication number
- CN105188088A CN105188088A CN201510425463.7A CN201510425463A CN105188088A CN 105188088 A CN105188088 A CN 105188088A CN 201510425463 A CN201510425463 A CN 201510425463A CN 105188088 A CN105188088 A CN 105188088A
- Authority
- CN
- China
- Prior art keywords
- node
- content
- packet
- pointer
- replacement rate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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 content popularity and node replacement rate-based caching method and device. The method includes the following steps that: when a data packet requested by a service node is transmitted back to a request node, a pointer K is arranged in the data packet, and a caching interval M is assigned for the pointer; when the data packet is transmitted back, the pointer K is decreased by one when the data packet passes through one node every time; whether the data packet arrives at the request node is detected, if the data packet arrives at the request node, the method terminates, otherwise, whether the pointer K is 0 is judged; and the data packet is cached according to judgment results. With the content popularity and node replacement rate-based caching method and device adopted, on the one hand, hot content can have more duplicates in a network, so that the service quality of the request node can be improved, and on the other hand, the caching of the content can be adjusted and controlled according to the content replacement rate of the node, and therefore, the performance degradation of a system caused by the high-frequency content replacement status of the node can be avoided.
Description
Technical field
The present invention relates to wireless communication technology field, be specifically related to caching method and the device of a kind of content-based popularity and node replacement rate.
Background technology
Because of it, without the need to infrastructure, rapid networking, survivability be strong etc., feature receives increasing concern to mobile ad-hoc network (MobileAdHocNetwork, MANET), and all has broad application prospects in military and civilian field.But, MANETE interior joint moves freely the network topology dynamic change caused and the effective control lacking infrastructure, the MANET based on ICP/IP protocol is caused to be difficult to set up stable end-to-end link, this not only makes network be difficult to realize efficient transfer of data, also counteracts that the practical application of MANET.
Content center network (ContentCentricNetwork, CCN) belongs to the Future-oriented Internet Architecture of " revolution formula ", fundamentally can solve IP network Problems existing in extensibility and contents distribution validity.CCN uses content name instead of IP address to carry out data transmission, allow content itself become key element in network, make internet become the network of content oriented (content-oriented) from the network that IP ignores content (content-oblivious).
Content center mobile ad-hoc network (ContentCentricMANET, CCMANET) be by content center network (ContentCentricNetwork, CCN) thought in centered by content is applied to the new network framework formed in mobile ad-hoc network (MobileAdHocNetwork, MANET).In CCMANET, requesting node needs to broadcast interest bag (InterestPacket) by neighbor node towards periphery during a certain content-data, when a node receives this interest bag, first it check whether local cache has the data of request, if be cached with this data, then directly return to requesting node; Otherwise user's request can be transmitted to next-hop node until arrive node or the source service node (being referred to as service node) that is cached with request content.Service node can along interest bag path passback content-data bag (DataPacket) to requesting node, any node on path can according to certain principle, determine the copy the need of this content of buffer memory, to meet the subsequent request of other nodes to this content.CCMANET can overcome the many shortcomings in traditional MANET, and brings new characteristic.Such as: do not need for each peer distribution IP address, the route of content-based name avoids route loop, improves the fail safe etc. in content delivery.
At present both at home and abroad about the research of CCMANET is in the starting stage, and progressively become a new study hotspot.No matter to CCN or concerning MANET, buffer memory is all one of its key technology.Therefore, concerning the CCMANET combining CCN and MANET, buffer memory is inevitable is also one of its key technology.The elementary tactics LCE (LeaveCopyEverywhere) of CCMANET is each this content of node buffer memory at packet return path.This strategy can produce a large amount of content redundancy backup in a network, reduces the diversity of content.
Summary of the invention
For defect of the prior art, the invention provides caching method and the device of a kind of content-based popularity and node replacement rate, decrease the redundancy of data in network, improve the diversity of content.
First aspect, the invention provides the caching method of a kind of content-based popularity and node replacement rate, comprising:
By the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M;
When described data packet back, often through a node, described pointer K subtracts 1;
Detect described packet and whether arrive requesting node, if arrive, then terminate; Otherwise, judge whether described pointer K is 0;
According to judged result, packet described in buffer memory.
Optionally, described according to judged result, packet described in buffer memory, comprising:
When described pointer K is 0, judge whether present node remaining cache space can hold new data packets;
When present node remaining cache space can hold new data packets, then packet described in this nodal cache, continues to forward described packet to next node simultaneously, resets K=M;
Or,
When present node remaining cache space can not hold new data packets, calculate the content replacement rate of this node and adjacent node thereof, and by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, reset K=M.
Optionally, described content of replacing successively on the minimum node of described content replacement rate, comprising:
The content on the minimum node of described content replacement rate is replaced successively according to content popularit order from low to high.
Optionally, described buffer memory interval M is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size, in units of chunk; A is proportionality coefficient.
Second aspect, present invention also offers the buffer storage of a kind of content-based popularity and node replacement rate, comprising:
Passback module, for by the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M;
Passback processing module, for when described data packet back, often through a node, described pointer K subtracts 1;
Whether detection module, arrive requesting node for detecting described packet, when described packet arrives requesting node, terminates the passback of described packet;
Judge module, for detect at described detection module described packet do not arrive requesting node time, judge whether described pointer K is 0;
Cache module, for according to judged result, packet described in buffer memory.
Optionally, described cache module, for:
When described pointer K is non-zero value, described packet is forwarded to next node.
Optionally, described cache module, for:
When described pointer K is 0, judge whether present node remaining cache space can hold new data packets;
When present node remaining cache space can hold new data packets, then packet described in this nodal cache, continues to forward described packet to next node simultaneously, resets K=M;
Or,
When present node remaining cache space can not hold new data packets, calculate the content replacement rate of this node and adjacent node thereof, and by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, reset K=M.
Optionally, described cache module, for:
The content on the minimum node of described content replacement rate is replaced successively according to content popularit order from low to high.
Optionally, described buffer memory interval M is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size, in units of chunk; A is proportionality coefficient.
As shown from the above technical solution, the caching method of a kind of content-based popularity provided by the invention and node replacement rate and device, by arranging pointer in the packet, and assignment is carried out to this pointer, buffer memory interval is set, is finally all arrive requesting node according to the numerical value of pointer and this packet, carrys out this packet of buffer memory, reduce some node load excessive, content substitutes problem too frequently.
In specification of the present invention, describe a large amount of detail.But can understand, embodiments of the invention can be put into practice when not having these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.
Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme, it all should be encompassed in the middle of the scope of claim of the present invention and specification.
Accompanying drawing explanation
The schematic flow sheet of the caching method of a kind of content-based popularity that Fig. 1 provides for one embodiment of the invention and node replacement rate;
The schematic flow sheet of the caching method of a kind of content-based popularity that Fig. 2 provides for another embodiment of the present invention and node replacement rate;
The structural representation of the buffer storage of a kind of content-based popularity that Fig. 3 provides for one embodiment of the invention and node replacement rate.
Embodiment
Below in conjunction with accompanying drawing, the embodiment of invention is further described.Following examples only for technical scheme of the present invention is clearly described, and can not limit the scope of the invention with this.
Fig. 1 shows the schematic flow sheet of the caching method of a kind of content-based popularity that one embodiment of the invention provides and node replacement rate, and as shown in Figure 1, the method comprises the steps:
101, by the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M.
Will be understood that, service node is along request Packet forwarding path to requesting node passback request content packet.
102, when described data packet back, often through a node, described pointer K subtracts 1;
103, detect described packet and whether arrive requesting node, if arrive, then terminate; Otherwise, judge whether described pointer K is 0;
104, according to judged result, packet described in buffer memory.
Said method by arranging pointer in the packet, and carries out assignment to this pointer, arranges buffer memory interval, the last numerical value according to pointer and this packet all arrive requesting node, carry out this packet of buffer memory, reduce some node load excessive, content substitutes problem too frequently.
Below by specific embodiment, said method is described in detail.
Fig. 2 shows the schematic flow sheet of the caching method of a kind of content-based popularity that one embodiment of the invention provides and node replacement rate, and as shown in Figure 2, the method comprises the steps:
201, by the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M.
In order to rationally determine buffer memory interval, the number of copies of high content popularit in network to be increased on the one hand, to improve the service quality of most requesting node request high content popularit; The number of copies of large files content to be reduced on the other hand, to improve the diversity of Web content.Therefore, buffer memory interval calculation method provided by the invention is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size (in units of chunk); A is proportionality coefficient.
202, when described data packet back, often through a node, described pointer K subtracts 1;
203, detect described packet and whether arrive requesting node, if arrive, then terminate; Otherwise, perform step 204.
204, judge whether described pointer K is 0, if so, then perform step 205, otherwise, perform step 202.
205, judge whether present node remaining cache space can hold new data packets, if so, perform step 206, otherwise perform step 207-208.
206, packet described in this nodal cache, continues to forward described packet to next node simultaneously, resets K=M.
207, the content replacement rate of this node and adjacent node thereof is calculated.
208, by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, reset K=M.
Concrete, replace the content on the minimum node of described content replacement rate successively according to content popularit order from low to high.
For accurately weighing loading condition and the buffer status of node, based on cache policy in the content center network net of node betweenness and replacement rate, adopt computing node buffer memory replacement rate Re (v) with the following method:
Wherein S (f
i) be that node v is replaced content f
isize (unit is chunk), C (v) is the cache size of node v, and m is the content number that unit interval interior nodes v is replaced.
Said method can not only ensure the service quality of high popularity content, can also improve the diversity of content in network, effectively improves the utilance of nodes storage resources.
By considering content popularit and node replacement rate decides which the nodal cache content-data on returned content path, Hot Contents is made to have more copy in a network, to improve the service quality of requesting node on the one hand; Regulated and controled the buffer memory of content on the other hand by the content replacement rate of node, make node avoid being in high-frequency content and replace state and cause systematic function to decline.
Fig. 3 shows the structural representation of the buffer storage of a kind of content-based popularity that the embodiment of the present invention provides and node replacement rate, and as shown in Figure 3, this device comprises:
Passback module 31, for by the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M;
Passback processing module 32, for when described data packet back, often through a node, described pointer K subtracts 1;
Whether detection module 33, arrive requesting node for detecting described packet, when described packet arrives requesting node, terminates the passback of described packet;
Judge module 34, for detect at described detection module described packet do not arrive requesting node time, judge whether described pointer K is 0;
Cache module 35, for according to judged result, packet described in buffer memory.
In a preferred embodiment of the present embodiment, described cache module 35, for:
When described pointer K is non-zero value, described packet is forwarded to next node.
In a preferred embodiment of the present embodiment, described cache module 35, for:
When described pointer K is 0, judge whether present node remaining cache space can hold new data packets;
When present node remaining cache space can hold new data packets, then packet described in this nodal cache, continues to forward described packet to next node simultaneously, and resets K=M;
Or,
When present node remaining cache space can not hold new data packets, calculate the content replacement rate of this node and adjacent node thereof, and by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, and K=M.
In a preferred embodiment of the present embodiment, described cache module 35, for:
The content on the minimum node of described content replacement rate is replaced successively according to content popularit order from low to high.
The interval M of buffer memory described in above-described embodiment is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size, in units of chunk; A is proportionality coefficient.
Said apparatus and said method are relations one to one, and the present embodiment is no longer described in detail to the implementation detail of said apparatus.
Claims (10)
1. a caching method for content-based popularity and node replacement rate, is characterized in that, comprising:
By the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M;
When described data packet back, often through a node, described pointer K subtracts 1;
Detect described packet and whether arrive requesting node, if arrive, then terminate; Otherwise, judge whether described pointer K is 0;
According to judged result, packet described in buffer memory.
2. method according to claim 1, is characterized in that, described according to judged result, and packet described in buffer memory, comprising:
When described pointer K is non-zero value, described packet is forwarded to next node.
3. method according to claim 1, is characterized in that, described according to judged result, and packet described in buffer memory, comprising:
When described pointer K is 0, judge whether present node remaining cache space can hold new data packets;
When present node remaining cache space can hold new data packets, then packet described in this nodal cache, continues to forward described packet to next node simultaneously, resets K=M;
Or,
When present node remaining cache space can not hold new data packets, calculate the content replacement rate of this node and adjacent node thereof, and by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, reset K=M.
4. method according to claim 3, is characterized in that, described content of replacing successively on the minimum node of described content replacement rate, comprising:
The content on the minimum node of described content replacement rate is replaced successively according to content popularit order from low to high.
5. the method according to any one of claim 1-4, is characterized in that, described buffer memory interval M is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size, in units of chunk; A is proportionality coefficient.
6. a buffer storage for content-based popularity and node replacement rate, is characterized in that, comprising:
Passback module, for by the data packet back of service node request to requesting node time, pointer K is set in described packet, and to described pointer assignment buffer memory interval M;
Passback processing module, for when described data packet back, often through a node, described pointer K subtracts 1;
Whether detection module, arrive requesting node for detecting described packet, when described packet arrives requesting node, terminates the passback of described packet;
Judge module, for detect at described detection module described packet do not arrive requesting node time, judge whether described pointer K is 0;
Cache module, for according to judged result, packet described in buffer memory.
7. device according to claim 6, is characterized in that, described cache module, for:
When described pointer K is non-zero value, described packet is forwarded to next node.
8. device according to claim 6, is characterized in that, described cache module, for:
When described pointer K is 0, judge whether present node remaining cache space can hold new data packets;
When present node remaining cache space can hold new data packets, then packet described in this nodal cache, continues to forward described packet to next node simultaneously, resets K=M;
Or,
When present node remaining cache space can not hold new data packets, calculate the content replacement rate of this node and adjacent node thereof, and by described data pack buffer on the minimum node of content replacement rate, replace the content on the minimum node of described content replacement rate successively, continue to forward described packet to next node simultaneously, reset K=M.
9. device according to claim 8, is characterized in that, described cache module, for:
The content on the minimum node of described content replacement rate is replaced successively according to content popularit order from low to high.
10. the device according to any one of claim 6-9, is characterized in that, described buffer memory interval M is:
Wherein, P is content popularit, refers to that in the unit interval, current serving Node provides the number of times of this content to other requesting nodes; S is content size, in units of chunk; A is proportionality coefficient.
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 true CN105188088A (en) | 2015-12-23 |
| CN105188088B 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) |
Cited By (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 |
|---|
| 王国卿: "一种基于逗留时间的新型内容中心网络缓存策略", 《计算机学报》 * |
| 葛国栋: "内容中心网络中面向隐私保护的协作缓存策略", 《电子与信息学报》 * |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105188088B (en) | 2019-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101562861B (en) | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network | |
| CN101854697B (en) | Multi-constraint quality-of-service control routing method and system for wireless mesh network | |
| CN102197627A (en) | Improved convergence of multicast traffic | |
| CN105763451A (en) | Ant colony algorithm-based QoS fault-tolerant route selection method in Internet of Vehicles | |
| CN103096410A (en) | Data transmission method of wireless meter reading system | |
| CN100461763C (en) | Radio senser network up and down isomeric routing method | |
| CN104349418B (en) | Data through street is by transmission method towards in the wireless sensor network of accident | |
| CN103856399A (en) | Ad Hoc backup route algorithm based on stability | |
| CN105188088A (en) | Content popularity and node replacement rate-based caching method and device | |
| CN103997461B (en) | Method for positioning cache of content centric network based on ant colony algorithm | |
| CN105634964B (en) | A kind of mobile ad-hoc network and its multicast route method | |
| CN106792969A (en) | A kind of hybrid wireless sensor network routing method of Energy Efficient | |
| CN102420766B (en) | Routing determination method and routing device | |
| Yu et al. | Research of multi-path routing based on network coding in space information networks | |
| CN107948939A (en) | Wireless NDN data processing methods, apparatus and system | |
| CN103685260A (en) | Overlaying multicast zone file transmitting method and system | |
| Xia et al. | An improved AODV routing protocol based on the congestion control and routing repair mechanism | |
| CN104185241B (en) | Suitable for the method for routing of tethered satellite network | |
| Rusheng et al. | REliable energy aware routing protocol in wireless sensor networks | |
| CN106992930A (en) | A kind of opportunistic network routing method based on approach frequency | |
| CN102413537B (en) | Routing method for load balancing between multiple sink nodes of wireless sensor network | |
| CN104618945A (en) | Link quality updating based route failure recovery method in wireless local area network (WLAN) | |
| Li et al. | k-Anycast data acquisition in multi-hop IoV | |
| Kumar et al. | An enhancement of dynamic source routing by efficient load balancing in wireless ad hoc networks | |
| JP2014039157A (en) | Data transfer method and radio network system |
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 |
Granted publication date: 20190712 Termination date: 20210717 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |