本文選題：內(nèi)容中心網(wǎng)絡(luò) + 緩存決策�。� 參考：《計(jì)算機(jī)工程》2017年04期

【摘要】：內(nèi)容中心網(wǎng)絡(luò)(CCN)默認(rèn)采用的處理緩存方式存在嚴(yán)重的緩存冗余,而基于介數(shù)的緩存決策雖然降低了緩存冗余,但其計(jì)算復(fù)雜度較高,不適合部署在CCN網(wǎng)絡(luò)層。為此,提出基于K核分解的緩存決策策略。給出基于K核分解方法的K核值指標(biāo)定義,將數(shù)據(jù)對(duì)象緩存到請(qǐng)求路徑上K核值最高的節(jié)點(diǎn),并給出當(dāng)K核值相同時(shí)依據(jù)剩余緩存空間和請(qǐng)求跳數(shù)的決策策略。仿真實(shí)驗(yàn)結(jié)果表明,基于K核分層的緩存決策策略具有較快的收斂速度,在緩存系統(tǒng)穩(wěn)定時(shí)有更高的緩存命中率和更快的緩存響應(yīng)速度。
[Abstract]:CCNs have serious cache redundancy by default, while the buffer decision based on medium reduces the cache redundancy, but its computational complexity is high, so it is not suitable for deployment in CCN network layer. Therefore, a cache decision strategy based on K kernel decomposition is proposed. The definition of K kernel index based on K kernel decomposition method is given, and the data object is cached to the node with the highest K kernel value in the request path, and the decision strategy based on the residual cache space and the number of request hops is given when the K core value is the same. The simulation results show that the buffer decision strategy based on K-core layer has faster convergence speed, higher cache hit ratio and faster cache response speed when the buffer system is stable.
【作者單位】： 中國(guó)科學(xué)技術(shù)大學(xué)信息科學(xué)技術(shù)學(xué)院;
【分類號(hào)】：TP333;O157.5

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前2條

1 田曉靜;影響在線購(gòu)買決策績(jī)效的網(wǎng)絡(luò)信息環(huán)境因素研究[D];浙江大學(xué);2012年

2 張娛;多目標(biāo)復(fù)雜網(wǎng)絡(luò)社團(tuán)檢測(cè)算法和決策策略研究[D];安徽大學(xué);2015年

，

本文編號(hào)：1808105