论文部分内容阅读
提出了一种基于流行度的概率存入校验机制(PCS-CP),根据接收内容的流行度,概率抽取内容校验,并只存入校验通过内容,确保节点的有限计算资源尽可能服务于用户关注内容,无须校验网内命中内容,降低了校验开销.由于PCS-CP机制只有与特定缓存策略配合才能最大化效用,进而提出了一种基于缓存更新时间的网内缓存策略,对网内副本冗余进行优化控制,有效提升了PCS-CP机制的校验效果.数值结果表明,与命中校验机制相比,PCS-CP可有效降低网内校验次数,有效防御内容污染攻击.
A PCS-CP based on popularity is proposed. According to the popularity of the received content, the content is extracted by probability and only the content of the verification is stored to ensure that the limited computing resources of the node are as far as possible Service users attention content, without checking the contents of the network hit, reducing the parity overhead.As the PCS-CP mechanism only with a specific cache policy to maximize the effectiveness, and then proposed based on the cache update time of the network cache strategy , To optimize the control of replica redundancy in the network and effectively improve the verification effect of PCS-CP mechanism.The numerical results show that, compared with the hit check mechanism, PCS-CP can effectively reduce the number of in-network check, effective defense content Pollution attack.