本文選題：命名數(shù)據(jù)網(wǎng)絡(luò) + 內(nèi)容污染　； 參考：《北京郵電大學(xué)學(xué)報(bào)》2017年03期

【摘要】：提出了一種基于流行度的概率存入校驗(yàn)機(jī)制(PCS-CP),根據(jù)接收內(nèi)容的流行度,概率抽取內(nèi)容校驗(yàn),并只存入校驗(yàn)通過內(nèi)容,確保節(jié)點(diǎn)的有限計(jì)算資源盡可能服務(wù)于用戶關(guān)注內(nèi)容,無須校驗(yàn)網(wǎng)內(nèi)命中內(nèi)容,降低了校驗(yàn)開銷.由于PCS-CP機(jī)制只有與特定緩存策略配合才能最大化效用,進(jìn)而提出了一種基于緩存更新時間的網(wǎng)內(nèi)緩存策略,對網(wǎng)內(nèi)副本冗余進(jìn)行優(yōu)化控制,有效提升了PCS-CP機(jī)制的校驗(yàn)效果.數(shù)值結(jié)果表明,與命中校驗(yàn)機(jī)制相比,PCS-CP可有效降低網(wǎng)內(nèi)校驗(yàn)次數(shù),有效防御內(nèi)容污染攻擊.
[Abstract]:In this paper, a probabilistic checkout mechanism based on popularity is proposed. According to the popularity of the received content, the probabilistic content is extracted and checked, and only the content is stored, so as to ensure that the limited computing resources of the node serve the user's attention as much as possible. There is no need to check the content of the hit in the network, reducing the cost of verification. Since the PCS-CP mechanism can only maximize the effectiveness with a specific cache policy, this paper proposes a cache policy based on cache update time, which optimizes the redundancy of replicas in the network and effectively improves the verification effect of the PCS-CP mechanism. The numerical results show that PCS-CP can effectively reduce the number of checks in the network and effectively defend against the attack of content pollution compared with the hit check mechanism.
【作者單位】： 江蘇大學(xué)計(jì)算機(jī)科學(xué)與通信工程學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(41474095)
【分類號】：TP393.08
，

本文編號：1788704