【摘要】：為提高NDN(命名數(shù)據(jù)網(wǎng)絡)中的緩存利用率,提出了一種基于蟻群替換算法的鄰居協(xié)作緩存管理(ACNCM)策略。首先將單節(jié)點的緩存替換問題,建模為0/1背包問題,并根據(jù)緩存數(shù)據(jù)的大小、使用頻率以及鄰居副本深度等信息定義本地存儲內(nèi)容的緩存價值,提出基于蟻群算法的緩存替換算法。然后利用鄰域協(xié)作的思想,通過路由節(jié)點之間定期交換自身節(jié)點的緩存信息,對單個節(jié)點替換出去的緩存內(nèi)容,選擇鄰居節(jié)點完成協(xié)作式緩存管理。實驗結(jié)果表明,ACNCM策略在緩存命中率、網(wǎng)絡開銷和平均響應時延方面均優(yōu)于現(xiàn)有方法。
[Abstract]:In order to improve the cache utilization in NDN (named data Network), a neighbor Cooperative Cache Management (ACNCM) strategy based on ant colony replacement algorithm is proposed. First, the single node cache replacement problem is modeled as 0 / 1 knapsack problem, and the cache value of local storage content is defined according to the size of cached data, frequency and depth of neighbor replica. A cache replacement algorithm based on ant colony algorithm is proposed. Then, by using the idea of neighborhood cooperation, the cache information of its own nodes is exchanged periodically between the routing nodes, and the cache content replaced by a single node is selected to complete the cooperative cache management. Experimental results show that the ACNCM strategy is superior to the existing methods in cache hit ratio, network overhead and average response delay.
【作者單位】： 東南大學計算機科學與工程學院;東南大學計算機網(wǎng)絡和信息集成教育部重點實驗室;
【基金】：國家高技術(shù)研究發(fā)展計劃(“863”計劃)基金資助項目(No.2013AA013503) 江蘇省未來網(wǎng)絡前瞻性研究基金資助項目(No.BY2013095-2-06)
【分類號】：TP333;TP18

【相似文獻】

相關期刊論文 前10條

1 孟曉p，

本文編號：2403069