CN109040163A - Name data network secret protection cache decision method based on k anonymity - Google Patents
Name data network secret protection cache decision method based on k anonymity Download PDFInfo
- Publication number
- CN109040163A CN109040163A CN201810381113.9A CN201810381113A CN109040163A CN 109040163 A CN109040163 A CN 109040163A CN 201810381113 A CN201810381113 A CN 201810381113A CN 109040163 A CN109040163 A CN 109040163A
- Authority
- CN
- China
- Prior art keywords
- content
- router
- cst
- interface
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0421—Anonymous communication, i.e. the party's identifiers are hidden from the other party or parties, e.g. using an anonymizer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- 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
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
Abstract
The present invention relates to the name data network secret protection cache decision methods based on k anonymity, only carry out cache decision in the node that user issues request, which neighbor node be cached to by the caching replacement rate decision of node.Attacker allows to know that nearest someone accessed the content; but due to having carried out the cache cooperation in region; attacker can not be inferred to which router access is the content pass through by which user recently; therefore it can be capable of the privacy of effective protection requestor to avoid the privacy information of attacker probe requests thereby person.In addition; extended one's service anonymous locality protection caching privacy by way of neighbours' cooperation caching, and router does not need to execute the building in anonymous region, do not need to carry out the data search in anonymous region; the realization difficulty for reducing anonymous region reduces the time delay that local users obtain data.
Description
Technical field
The present invention relates to the technical fields of name data network secret protection, more particularly to the name number based on k anonymity
Cache decision method is protected according to the network privacy.
Background technique
Being constantly progressive and develop with Internet information technique, the major function of internet has changed into highly effective and safe
The acquisition and distribution of content.And the initial network based on ICP/IP protocol, there are IPv4 address shortages, cyberspace vulnerability
It is more, the defects such as network service quality is low.There are one the serious wastings of resources for the internet of the TCP/IP network system, that is, deposits
The problem of a large amount of duplicate contents transmit.In order to solve the essential problem of TCP/IP network, a kind of revolutionary future network body
Architecture --- information centre's network (Information-Centric Network, ICN) (Vasilakos A V, Li Z,
Simon G, et al.Information centric network:research challenges and
Opportunities [J] .Journal of Network and Computer Applications, 2015,52:1-10.)
It is suggested, to meet, Future Internet high efficiency, extensive, safety content obtains and the growth requirement of transmission.And several
In representative ICN associated frame scheme, name data network (Named-Data Networking, NDN) (Zhang L,
Estrin D,Burke J,et al.Named data networking(ndn)project[J].Relatório Técnico
NDN-0001, Xerox Palo Alto Research Center-PARC, 2010.) because of advance, the side of its project theory
The feasibility and substantial progress of case, the mainstream being increasingly becoming in ICN architectural framework.
Have to reduce using network internal storage and nets interior redundant transmission, realizes content is shared, improves content distribution speed etc.
Advantage.When the data packet of network internal caching responds request rather than is responded by data producer, that is,
Cache hit has occurred, cache hit means to reduce the use of bandwidth.I.e. reasonable network internal cache policy can be very big
Ground reduces network bandwidth and reduces the load of original server.However, the cache contents of network internal may leak it is some hidden
Private sensitive information.Attacker may obtain the time of request content by measurement, can speculate whether certain contents are accessed,
Or thus position etc. of the speculative request person in network topology.Thus for naming data network, it is excellent to play caching in net
The key of gesture is to prevent caching leakage privacy information under lesser expense, promote caching performance.And the caching everywhere defaulted
(Leave Copy Everywhere,LCE)(Wang W,Sun Y,Guo Y,et al.CRCache:Exploiting the
correlation between content popularity and network topology information for
ICN caching[C]//IEEE International Conference on Communications(ICC).Sydney:
IEEE, 2014:3191-3196.) strategy be easy to cause caching redundancy, i.e., and identical object has copy in multiple nodes, this leads
The waste of serious memory space is caused, while attacker can easily pass through caching to deduce communication trace of neighbor user etc. hidden
Personal letter breath.
For the deficiency of name data network LCE caching method, in order to reduce redundancy, network performance is promoted, is studied at present
Some cache policies have been proposed in personnel.Laoutaris, Eum, Wang et al. propose the decision based on random cache, this
A little cache decisions can reduce caching redundancy to a certain extent, but randomness and blindness are stronger；Psaras et al. passes through
Calculate node hop count and buffer memory capacity carry out cache decision (Psaras I, Chai W K, Pavlou G.Probabilistic
in-network caching for information-centric networks[C].ACM Proceedings of the
second edition of the ICN workshop on Information-centric networking(ICN),
2012:55-60.).Cui shows east et al. and proposes BetwRep method (Cui Xiandong, Liu Jiang, Huang Tao wait to be based on node betweenness and replacing
Change cache policy [J] electronics and information journal, 2014,36 (1): 1-7. in the content center network net of rate), it is situated between based on node
Several and cache contents replacement rates are as the decision metric on return path.Both methods does not account for point of content requests
Cloth feature.Hu et al. proposes PRL method (Hu X, Gong J, Cheng G, et al.Enhancing in-network
caching by coupling cache placement,replacement and location[C].IEEE,2015:
5672-5678.), router calculates caching income according to the request rate of content, hop count information and content replacement rate, is transmitting
The node of Income Maximum is selected in path as cache node.This method can dramatically increase network load.And Ge Guodong et al.
(Ge Guodong, Guo Yunfei, Liu Caixia wait the cooperation caching in content center network towards secret protection to the CCSPP method of proposition
Tactful [J] electronics and information journal, 2015,37 (5): 1220-1226.) comprehensively consider the secret protection cached, it constructs
Anonymous region selects maximum hotspot request region to be cached when content returns.But the difficulty for constructing anonymous region is high, and
Introduce additional lookup time delay.In view of current cache policy secret protection degree is insufficient, there are security risk and performance are more low
Problem proposes the present invention.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of name data network based on k anonymity is hidden
Private protection cache decision method, prevents attacker from detecting the cache contents in router, avoids it to infer and know that neighbours use
The privacy informations such as the access content at family；Meanwhile under the premise of protecting router cache privacy information, realizing has k anonymity total
Data cached, raising Buffer Utilization is enjoyed, the router hops that reduction user's request content is passed through reduce averagely asking for content
Seeking time；And when data packet returns, cache decision only is carried out in the node that user issues request, increases cache contents in network
Diversity, reduce a large amount of caching redundancies, improve partial cache hit rate.
To achieve the above object, technical solution provided by the present invention are as follows:
Name data network router node in increase content status table (Content State Table, CST) and
With neighbor information table (Neighborhood State Table, NST), the request of content when for counting interest packet arrival node
The request user of user volume and encryption collection；
When router node receives interest packet, according to the content C in content status table CSTxWith the user U of encryptiony,
Modify the request user volume of content；
When the corresponding data packet backtracking of interest packet, only cached certainly in the router node that cache hit occurs
Plan, and its anonymous set for increasing access using k anonymity characteristic, carry out neighbours' cooperation caching.
Further, when the router node receives interest packet, specific processing step is as follows:
S1-1, it searches in content status table CST with the presence or absence of content Cx, if it does not exist, then go to step S1-4；If depositing
Whether there is user U in the user's collection uSet for then searching content status table CSTyIf not having, toward content CxUser collect uSet
Add Uy, number of users adds 1；If so, then passing directly to step S1-2；
S1-2, judge content C in CST tablexThe value of corresponding Interface: it if Interface is sky, thens follow the steps
S1-5；If Interface is equal to 0, by the content returned data packet in CS to user, process terminates；If Interface is not
Sky is also not zero, and thens follow the steps S1-3；
S1-3, content C in CST table is pressedxCorresponding interface is forwarded to neighbor router, and process terminates；
S1-4, a content C is added to CSTxRecord, user UyUser's collection is added, request user volume adds 1；
S1-5, content C is searched in PITx, find then content CxIt reaches interface and is added to PIT, and abandon the interest
Packet, process terminate；Otherwise content C is searched in FIBx；
S1-6, content C is found in FIBx；It is then forwarded by the interface list found, and adds the interest packet in PIT
New entry；It is not found in FIB, shows that network can not respond the request, abandon the interest packet.
Further, when the corresponding data packet backtracking of interest packet, router node receives the cache decision of data packet
Steps are as follows:
S2-1、CxData packet return on the way, arrival have user issue request CxNode Ri, search whether CS has Cx
Data packet, the data packet is directly abandoned if having, C is not searched in CSTx；
If S2-2, finding C in CSTx, then follow the steps S2-3；If not finding C in CSTx, then follow the steps S2-4；
S2-3, judge whether Interface is empty and the number of users of the request of router interface quantity or CST table
Whether num of User is more than or equal to threshold value k；
If Interface is that the number of users num of User of empty and router interface quantity or CST table request is big
In being equal to threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router is updated to
This router Ri；
If Interface be the number of users num of User of empty and router interface quantity or CST table request not
More than or equal to threshold value k, then the caching the smallest neighbor node R of replacement rate is selected according to NSTi, data packet copy is forwarded and is cached
To Ri, neighbours' interface of selection is updated to CST；
If Interface is not the number of users num of User of empty and router interface quantity or CST table request
More than or equal to threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router updates
For this router Ri；
If Interface is not the number of users num of User of empty and router interface quantity or CST table request
No more than threshold value k is equal to, directly execution step S2-4；
S2-4, C is searched in PIT tablex, do not find, abandon the data packet, find then by C in PITxCorresponding interface forwarding
Data packet.
Further, it names the router node in data network to be equipped with neighbours and updates message (Neighbor update
Packages, NUP), local information periodically is noticed to neighbor router for router, neighbours is received and updates message NUP
Router node the letter reported in content update the content status table CST and neighbor information table NST of NUP is then updated according to neighbours
Breath, the specific steps are as follows:
S3-1, router RiThe periodically caching replacement rate in the unit of account time
Wherein, S (fk) indicate node RiIt is replaced content fkSize, C (Ri) indicate node RiCache size, m indicate
Unit time interior nodes RiThe content number being replaced；If Re (Ri)=0 indicates that nodal cache is less than or reaches without new content；
S3-2, router RiPeriodically local information is noticed to neighbor router；
After S3-3, neighbor router receive update message, neighbor information table NST updates corresponding router according to message content
Nodal cache replacement rate, if content status table CST contains the cache contents replaced, content status table CST, which is deleted, to be corresponded to
Tuple.
Compared with prior art, the principle and advantage of this programme is as follows:
1. meeting is on all nodes on data packet return path due to the cache decision LCE of name data network default
Content caching is carried out, this can greatly waste the memory space of network, cause cache contents redundancy.This programme is responded in data and is saved
When point data packet backtracking that interest packet is corresponding, cache decision only is carried out in the node that user issues request, it in this way can be with
While keeping higher cache hit rate, the redundancy of cache contents is effectively reduced, improves the diversity of data in netting, reduces
The renewal frequency of cache contents in node.
2. attacker can be by the two-way time of measurement specific content, to speculate whether neighbor user is requested recently
The content, it might even be possible to deduce the topology location of user in a network.Therefore for naming the caching privacy of data network to protect
It protects of crucial importance.This programme reveals the associated privacy information of requestor, the corresponding data packet backtracking of interest packet in order to prevent
When, cache decision only is carried out in the node that user issues request, which neighbour is cached to by the caching replacement rate decision of node
Occupy node.Attacker allows to know that nearest someone accessed the content, but due to having carried out the cache cooperation in region, attacks
The person of hitting can not be inferred to the content recently by which user by which router access, therefore can detect to avoid attacker
The privacy information of requestor is capable of the privacy of effective protection requestor.
The anonymous locality protection caching privacy 3. this programme is extended one's service by way of neighbours' cooperation caching, compare Pueraria lobota state
Et al. the CCSPP scheme that proposes, router do not need to execute the building in anonymous region, do not need to carry out the number in anonymous region
It is investigated that looking for, the realization difficulty in anonymous region is reduced, reduces the time delay that local users obtain data.Ge Guodong etc. simultaneously
The scheme that people proposes is realizing the utilization that caching is although realized while privacy of user protection, but on the road that data packet returns
On diameter, content is only stored in the highest anonymous region of hot spot, if it is other anonymous regions on same path user to same
There is very big probability to need to request to content publisher again when data make requests.And this programme is then on the road that data packet returns
The node that all users issue request on diameter carries out cache decision, improves Buffer Utilization and cache hit rate.
Detailed description of the invention
Fig. 1 is name data network topology figure；
Fig. 2 is interest packet forwarding process figure of the present invention；
Fig. 3 is the cache decision flow chart of data packet of the present invention.
Specific embodiment
Before illustrating specific embodiment, the meaning of each symbol, phrase used in the present invention is provided first:
The meaning of each symbol is as follows:
Ri: router node i, the unique identity of node；
Cx: content x；
Uy: the mark of the user y of encryption；
CS: the content storage of router, Content Store；
Re(Ri): the caching replacement rate of router node i；
CST: content status table, Content State Table；
NST: neighbor state table, Neighborhood State Table；
PIT: interest table undetermined, Pending Interest Table；
FIB: forwarding information table, Forwarding Information Base；
NUP: neighbours update message, Neighbor update packages；
Num of User/uReq: all requested content CiNumber of users；
Interface: indicating the interface with neighbor router, wherein 0 indicates local router；
User Set/uSet: Yong Huji, content CiThe set of the encryption user label of corresponding requestor；
K: judge whether the threshold value cached in present node；
The present invention is further explained in the light of specific embodiments:
Name data network secret protection cache decision method described in the present embodiment based on k anonymity:
Now set router R0CST it is as shown in table 1, NST is as shown in table 2.CST maintains local node or neighbor node
The state of content, user integrate as content CxCorresponding requestor, the user volume of request are all requested content CxNumber of users
Amount, interface 0 indicate that content is stored in local router, and 1-n indicates the interface with neighbor router.Interface and neighbor router are
Illustrate that the data packet of request does not reach this node also when empty.The network topological diagram that the present embodiment uses is as shown in Figure 1.
1 content status table of table (Content State Table, CST)
2 neighbor state table of table (Neighborhood State Table, NST)
As shown in Fig. 2, processing step of the node when receiving interest packet is as follows:
S1-1, it searches in content status table CST with the presence or absence of content Cx, if it does not exist, then go to step S1-4；If depositing
Whether there is user U in the user's collection uSet for then searching content status table CSTyIf not having, toward content CxUser collect uSet
Add Uy, number of users adds 1；If so, then going to step S1-2；
S1-2, judge content C in CST tablexThe value of corresponding Interface: it if Interface is sky, thens follow the steps
S1-5；By the content returned data packet in CS to user if Interface is equal to 0, process terminates；If Interface is not
Sky is also not zero, and thens follow the steps S1-3；
S1-3, content C in CST table is pressedxCorresponding interface is forwarded to neighbor router, and (router does not have interface in this strategy
0, interface 0 refers to content caching in local), process terminates；
S1-4, a content C is added to CSTxRecord, user UyUser's collection is added, request user volume adds 1；
S1-5, content C is searched in PITx, find then content CxIt reaches interface and is added to PIT, and abandon the interest
Packet；Otherwise content C is searched in FIBx；
S1-6, content C is found in FIBx；It is then forwarded by the interface list found, and adds the interest packet in PIT
New entry；It is not found in FIB, shows that network can not respond the request, abandon the interest packet.
As shown in figure 3, when the corresponding data packet backtracking of interest packet, router node receives the caching after data packet and determines
Steps are as follows for plan:
S2-1、CxData packet return on the way, arrival have user issue request CxNode Ri, search whether CS has Cx
Data packet, the data packet is directly abandoned if having, C is not searched in CSTx；
If S2-2, finding C in CSTx, then follow the steps S2-3；If not finding C in CSTx, then follow the steps S2-4；
S2-3, judge whether Interface is empty and the number of users of the request of router interface quantity or CST table
Whether num of User is more than or equal to threshold value k；
If Interface is that the number of users num of User of empty and router interface quantity or CST table request is big
In being equal to threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router is updated to
This router Ri；
If Interface be the number of users num of User of empty and router interface quantity or CST table request not
More than or equal to threshold value k, then the caching the smallest neighbor node R of replacement rate is selected according to NSTi, data packet copy is forwarded and is cached
To Ri, neighbours' interface of selection is updated to CST；
If Interface is not the number of users num of User of empty and router interface quantity or CST table request
More than or equal to threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router updates
For this router Ri, update corresponding neighbours' interface in CST；
If Interface is not the number of users num of User of empty and router interface quantity or CST table request
No more than threshold value k is equal to, directly execution step S2-4；
S2-4, C is searched in PIT tablex, do not find, abandon the data packet, find then by C in PITxCorresponding interface forwarding
Data packet.
The decision process of cache policy is illustrated below according to the data of table 1, table 2:
Assuming that k=30, user passes through router R5Request data D1, the data packet D of present content supplier's return1?
Node R on the way3It was found that there is user to issue request, the num of User=10 of CST then finds Re (R in NST because being less than ki)
It is worth the smallest node R2, data packet D1Copy from router R3Interface 2 be forwarded to neighbor router carry out cooperation caching,
R simultaneously3Continue D1Back to R5。
Message NUP is updated by neighbours, router periodically notices local information to neighbor router, and specific steps are such as
Under:
S3-1, router RiThe periodically caching replacement rate in the unit of account time
Wherein, S (fk) indicate node RiIt is replaced content fkSize, C (Ri) indicate node RiCache size, m indicate
Unit time interior nodes RiThe content number being replaced；If Re (Ri)=0 indicates that nodal cache is less than or reaches without new content；
S3-2, router RiLocal information periodically is noticed to neighbor router, structure is as shown in table 3；
After S3-3, neighbor router receive update message, neighbor information table NST updates corresponding router according to message content
Nodal cache replacement rate, if content status table CST contains the cache contents replaced, content status table CST, which is deleted, to be corresponded to
Tuple.
3 neighbours of table update message (Neighbor update packages, NUP)
| Router mark Ri |
| Cache replacement rate Re (Ri) |
| Message creation time |
| The cache contents C replacedi |
The present embodiment is only issued in user and is requested in data responsive node data packet backtracking that interest packet is corresponding
Node carry out cache decision, make that the redundancy of cache contents is effectively reduced while keeping higher cache hit rate, raising
The diversity of data in netting, reduces the renewal frequency of cache contents in node.In addition, the corresponding data packet backtracking of interest packet
When, cache decision only is carried out in the node that user issues request, which neighbour is cached to by the caching replacement rate decision of node
Occupy node.Attacker allows to know that nearest someone accessed the content, but due to having carried out the cache cooperation in region, attacks
The person of hitting can not be inferred to the content recently by which user by which router access, therefore can detect to avoid attacker
The privacy information of requestor is capable of the privacy of effective protection requestor.In addition, it is extended one's service by way of neighbours' cooperation caching
Anonymous locality protection caches privacy, and router does not need to execute the building in anonymous region, do not need to carry out the number in anonymous region
It is investigated that looking for, the realization difficulty in anonymous region is reduced, reduces the time delay that local users obtain data.
The examples of implementation of the above are only the preferred embodiments of the invention, and implementation model of the invention is not limited with this
It encloses, therefore all shapes according to the present invention, changes made by principle, should all be included within the scope of protection of the present invention.
Claims (4)
1. the name data network secret protection cache decision method based on k anonymity, which is characterized in that in name data network
Increase in router node content status table CST and with neighbor information table NST, for counting content when interest packet reaches node
Request the request user of user volume and encryption collection；
When router node receives interest packet, according to the content C in content status table CSTxWith the user U of encryptiony, modification
The request user volume of content；
When the corresponding data packet backtracking of interest packet, cache decision only is carried out in the node that user issues request, and utilize k
Anonymous characteristic is gathered to increase the anonymous of access, carries out neighbours' cooperation caching.
2. the name data network secret protection cache decision method according to claim 1 based on k anonymity, feature exist
In when the router node receives interest packet, specific processing step is as follows:
S1-1, it searches in content status table CST with the presence or absence of content Cx, if it does not exist, then go to step S1-4；If it exists, then it looks into
The user of content status table CST is looked for collect in uSet whether have user UyIf not having, toward content CxUser collect uSet add Uy,
Number of users adds 1；If so, then passing directly to step S1-2；
S1-2, judge content C in CST tablexThe value of corresponding Interface: if Interface is sky, S1-5 is thened follow the steps；
If Interface is equal to 0, by the content returned data packet in CS to user, process terminates；If Interface is not empty
It is not zero, thens follow the steps S1-3；
S1-3, content C in CST table is pressedxCorresponding interface is forwarded to neighbor router, and process terminates；
S1-4, a content C is added to CSTxRecord, user UyUser's collection is added, request user volume adds 1；
S1-5, content C is searched in PITx, find then content CxIt reaches interface and is added to PIT, and abandon the interest packet, flow
Journey terminates；Otherwise content C is searched in FIBx；
S1-6, content C is found in FIBx；It is then forwarded by the interface list found, and adds the new of the interest packet in PIT
Entry；It is not found in FIB, shows that network can not respond the request, abandon the interest packet.
3. the name data network secret protection cache decision method according to claim 1 based on k anonymity, feature exist
When, interest packet corresponding data packet backtracking, router node receives the cache decision of data packet, and steps are as follows:
S2-1、CxData packet return on the way, arrival have user issue request CxNode Ri, search whether CS has CxData
Packet, the data packet is directly abandoned if having, C is not searched in CSTx；
If S2-2, finding C in CSTx, then follow the steps S2-3；If not finding C in CSTx, then follow the steps S2-4；
S2-3, judge whether Interface is empty and the number of users num of of the request of router interface quantity or CST table
Whether User is more than or equal to threshold value k；
If Interface is that the number of users num of User of empty and router interface quantity or CST table request is greater than etc.
In threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router is updated to this road
By device Ri；
If Interface is that the number of users num of User of empty and router interface quantity or CST table request is not more than
Equal to threshold value k, then the caching the smallest neighbor node R of replacement rate is selected according to NSTi, data packet copy is forwarded and is cached to Ri,
Neighbours' interface of selection is updated to CST；
If Interface is not that the number of users num of User of empty and router interface quantity or CST table request is greater than
Equal to threshold value k, then data packet copy is buffered in this router Ri, the interface of CST table is updated to 0, and neighbor router is updated to this
Router Ri；
If Interface is not that the number of users num of User of empty and router interface quantity or CST table request is little
In being equal to threshold value k, directly execution step S2-4；
S2-4, C is searched in PIT tablex, do not find, abandon the data packet, find then by C in PITxCorresponding interface forwards data
Packet.
4. the name data network secret protection cache decision method according to claim 1 based on k anonymity, feature exist
In the router node in name data network is equipped with neighbours and updates message NUP, periodically routes to neighbours for router
Device notices local information, and the router node for receiving neighbours' update message NUP then updates in the content update for reporting NUP according to neighbours
Hold the information in state table CST and neighbor information table NST, the specific steps are as follows:
S3-1, router RiThe periodically caching replacement rate in the unit of account time
Wherein, S (fk) indicate node RiIt is replaced content fkSize, C (Ri) indicate node RiCache size, m indicate unit
Time interior nodes RiThe content number being replaced；If Re (Ri)=0 indicates that nodal cache is less than or reaches without new content；
S3-2, router RiPeriodically local information is noticed to neighbor router；
After S3-3, neighbor router receive update message, neighbor information table NST updates the section of corresponding router according to message content
Point cache replacement rate, if content status table CST contains the cache contents replaced, content status table CST deletes corresponding member
Group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810381113.9A CN109040163B (en) | 2018-04-25 | 2018-04-25 | Named data network privacy protection caching decision method based on k anonymity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810381113.9A CN109040163B (en) | 2018-04-25 | 2018-04-25 | Named data network privacy protection caching decision method based on k anonymity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109040163A true CN109040163A (en) | 2018-12-18 |
| CN109040163B CN109040163B (en) | 2021-03-30 |
Family
ID=64630219
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810381113.9A Active CN109040163B (en) | 2018-04-25 | 2018-04-25 | Named data network privacy protection caching decision method based on k anonymity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109040163B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111625565A (en) * | 2020-05-22 | 2020-09-04 | 哈尔滨工程大学 | Multi-attribute cooperative caching method for information center network cache privacy protection |
| CN111917658A (en) * | 2020-07-01 | 2020-11-10 | 大连理工大学 | Privacy protection cooperative caching method based on grouping under named data network |
| CN112612727A (en) * | 2020-12-08 | 2021-04-06 | 海光信息技术股份有限公司 | Cache line replacement method and device and electronic equipment |
| CN114844670A (en) * | 2022-03-22 | 2022-08-02 | 电子科技大学 | IP address hiding method based on named network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103905538A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Neighbor cooperation cache replacement method in content center network |
| CN106790638A (en) * | 2017-01-10 | 2017-05-31 | 北京邮电大学 | Data transmission method and system based on active cache in name data network |
| WO2017165246A1 (en) * | 2016-03-25 | 2017-09-28 | Cisco Technology, Inc. | System and method for routing packets in a content centric network using anonymous datagrams |
| WO2017192569A1 (en) * | 2016-05-04 | 2017-11-09 | Cisco Technology, Inc. | System and method for routing packets in a stateless content centric network |
-
2018
- 2018-04-25 CN CN201810381113.9A patent/CN109040163B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103905538A (en) * | 2014-03-22 | 2014-07-02 | 哈尔滨工程大学 | Neighbor cooperation cache replacement method in content center network |
| WO2017165246A1 (en) * | 2016-03-25 | 2017-09-28 | Cisco Technology, Inc. | System and method for routing packets in a content centric network using anonymous datagrams |
| WO2017192569A1 (en) * | 2016-05-04 | 2017-11-09 | Cisco Technology, Inc. | System and method for routing packets in a stateless content centric network |
| CN106790638A (en) * | 2017-01-10 | 2017-05-31 | 北京邮电大学 | Data transmission method and system based on active cache in name data network |
Non-Patent Citations (2)
| Title |
|---|
| J. J. GARCIA-LUNA-ACEVES等: "Content-centric networking using anonymous datagrams", 《2016 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS》 * |
| 葛国栋: "内容中心网络中面向隐私保护的协作缓存策略", 《电子与信息学报》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111625565A (en) * | 2020-05-22 | 2020-09-04 | 哈尔滨工程大学 | Multi-attribute cooperative caching method for information center network cache privacy protection |
| CN111625565B (en) * | 2020-05-22 | 2022-09-02 | 哈尔滨工程大学 | Multi-attribute cooperative caching method for information center network cache privacy protection |
| CN111917658A (en) * | 2020-07-01 | 2020-11-10 | 大连理工大学 | Privacy protection cooperative caching method based on grouping under named data network |
| CN111917658B (en) * | 2020-07-01 | 2022-02-25 | 大连理工大学 | Privacy protection cooperative caching method based on grouping under named data network |
| CN112612727A (en) * | 2020-12-08 | 2021-04-06 | 海光信息技术股份有限公司 | Cache line replacement method and device and electronic equipment |
| CN114844670A (en) * | 2022-03-22 | 2022-08-02 | 电子科技大学 | IP address hiding method based on named network |
| CN114844670B (en) * | 2022-03-22 | 2023-03-10 | 电子科技大学 | IP address hiding method based on named network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109040163B (en) | 2021-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | A survey of caching mechanisms in information-centric networking | |
| CN109040163A (en) | Name data network secret protection cache decision method based on k anonymity | |
| Hail et al. | Caching in named data networking for the wireless internet of things | |
| Xylomenos et al. | A survey of information-centric networking research | |
| Chow et al. | GroCoca: Group-based peer-to-peer cooperative caching in mobile environment | |
| Seetharam | On caching and routing in information-centric networks | |
| Le et al. | Social caching and content retrieval in disruption tolerant networks (DTNs) | |
| An et al. | An in-network caching scheme based on energy efficiency for content-centric networks | |
| Dutta et al. | Caching scheme for information‐centric networks with balanced content distribution | |
| CN109788319B (en) | Data caching method | |
| Amadeo et al. | Beyond edge caching: Freshness and popularity aware iot data caching via ndn at internet-scale | |
| Zhang et al. | Combining popularity and locality to enhance in-network caching performance and mitigate pollution attacks in content-centric networking | |
| CN105208553B (en) | The guard method and system of CCMANET requesting node retrieval privacy | |
| Zhang et al. | Cache-aware named-data forwarding in internet of things | |
| CN108769252A (en) | A kind of ICN network pre-cache methods based on request content relevance | |
| Alahmri et al. | Efficient pooling and collaborative cache management for NDN/IoT networks | |
| Dron et al. | Information-maximizing caching in ad hoc networks with named data networking | |
| Yang et al. | Providing cache consistency guarantee for ICN-based IoT based on push mechanism | |
| Qin et al. | A probability-based caching strategy with consistent hash in named data networking | |
| Zhu et al. | Popularity-based neighborhood collaborative caching for information-centric networks | |
| CN107302571B (en) | The routing of information centre's network and buffer memory management method based on drosophila algorithm | |
| Zhou et al. | Popularity and age based cache scheme for content-centric network | |
| Shibuya et al. | Cache decision policy for breadcrumbs in CCN | |
| Gu et al. | Node value and content popularity-based caching strategy for massive VANETs | |
| Chow et al. | Peer-to-peer cooperative caching in a hybrid data delivery environment |
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 |