本文選題：命名數(shù)據(jù)網(wǎng)絡 + 內容污染��； 參考：《北京郵電大學學報》2017年03期

【摘要】：提出了一種基于流行度的概率存入校驗機制(PCS-CP),根據(jù)接收內容的流行度,概率抽取內容校驗,并只存入校驗通過內容,確保節(jié)點的有限計算資源盡可能服務于用戶關注內容,無須校驗網(wǎng)內命中內容,降低了校驗開銷.由于PCS-CP機制只有與特定緩存策略配合才能最大化效用,進而提出了一種基于緩存更新時間的網(wǎng)內緩存策略,對網(wǎng)內副本冗余進行優(yōu)化控制,有效提升了PCS-CP機制的校驗效果.數(shù)值結果表明,與命中校驗機制相比,PCS-CP可有效降低網(wǎng)內校驗次數(shù),有效防御內容污染攻擊.
[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.
【作者單位】： 江蘇大學計算機科學與通信工程學院;
【基金】：國家自然科學基金項目(41474095)
【分類號】：TP393.08
，

本文編號：1788704