內(nèi)容中心網(wǎng)絡(luò)中面向隱私保護的協(xié)作緩存策略
doi: 10.11999/JEIT140874
基金項目:
國家973計劃項目(2012CB315901, 2013CB329104)，國家自然科學(xué)基金 (61372121)和國家863計劃項目(2011AA01A103)資助課題
A Collaborative Caching Strategy for Privacy Protection in Content Centric Networking
-
摘要: 針對內(nèi)容中心網(wǎng)絡(luò)節(jié)點普遍緩存帶來的隱私泄露問題，在兼顧內(nèi)容分發(fā)性能的基礎(chǔ)上，該文提出一種面向隱私保護的協(xié)作緩存策略。該策略從信息熵的角度提出隱私度量指標(biāo)，以增大攻擊者的不確定度為目標(biāo)，首先對于緩存策略的合理性給予證明；其次，通過構(gòu)建空間匿名區(qū)域，擴大用戶匿名集合，增大緩存內(nèi)容的歸屬不確定性。緩存決策時，針對垂直請求路徑和水平匿名區(qū)域，分別提出沿途熱點緩存和局域hash協(xié)同的存儲策略，減小緩存冗余和隱私信息泄露。仿真結(jié)果表明，該策略可減小內(nèi)容請求時延，提高緩存命中率，在提升內(nèi)容分發(fā)效率的同時增強了用戶隱私保護水平。
-
關(guān)鍵詞:
- 內(nèi)容中心網(wǎng)絡(luò) /
- 協(xié)作緩存 /
- 隱私保護 /
- 內(nèi)容路由
Abstract: How to mitigate the privacy attacks related to the ubiquitous presence of caching poses challenges to the content delivery in Content Centric Networking. On the basis of trade-off between content distribution performance and users privacy, a collaborative caching strategy for privacy protection is proposed. First, the privacy metrics are designed and the rationality of the proposed strategy is demonstrated by applying the concept of information entropy. And then, the anonymity domain is constructed to increase the uncertainty of which nearby consumer recently requested certain cached content. When making the caching decision, in order to eliminate the cache redundancy and privacy leaks, the hottest on-path caching and the collaborative hash caching are proposed for the vertical requesting path and horizontal anonymity domains, respectively. The simulation results show that the strategy can decrease the request latency, increase the cache hit ratio, and enhance the protection of users privacy while improving the efficiency of content distribution. -
計量
- 文章訪問數(shù): 1436
- HTML全文瀏覽量: 184
- PDF下載量: 568
- 被引次數(shù): 0
下載:
