ICN中基于節(jié)點權(quán)重的緩存大小分配方案研究
發(fā)布時間:2018-05-19 04:11
本文選題:網(wǎng)內(nèi)緩存 + 信息中心網(wǎng)絡(luò) ; 參考:《計算機(jī)應(yīng)用研究》2017年01期
【摘要】:為了使路由器的緩存大小配置合理,首先綜合考慮路由器的度數(shù)權(quán)重、緊密度、網(wǎng)絡(luò)的中心度、請求影響度等度量指標(biāo),定義了一個新的度量指標(biāo),稱為節(jié)點權(quán)重;然后提出一種基于節(jié)點權(quán)重的緩存大小分配方案,將網(wǎng)絡(luò)所需的容量按比例分配給路由器。仿真結(jié)果表明,與均勻分配相比,路由器的緩存空間利用率至少提升了8%,命中率至少提高了6%;與基于請求影響度的分配方案相比,路由器的緩存空間利用率至少提升3%,命中率至少提高了3%。
[Abstract]:In order to make the buffer size of router reasonable, a new metric, called node weight, is defined by considering the degree weight, compactness, network centrality and request impact degree of the router. Then, a buffer size allocation scheme based on node weight is proposed, which distributes the network capacity to the router proportionally. The simulation results show that, compared with the uniform allocation, the cache space utilization rate of the router increases at least 8%, the hit rate increases at least 6%, and compared with the allocation scheme based on request impact degree, Router cache space utilization at least 3 increase, hit rate at least 3 increase.
【作者單位】: 重慶郵電大學(xué)測控與信息傳輸研究所;
【基金】:國家自然科學(xué)基金資助項目(61301124) 重慶高校創(chuàng)新團(tuán)隊建設(shè)計劃資助項目 重慶郵電大學(xué)科研基金資助項目(A2012-16)
【分類號】:TP393.05
,
本文編號:1908650
本文鏈接:http://sikaile.net/guanlilunwen/ydhl/1908650.html
最近更新
教材專著