本文關(guān)鍵詞：信息中心網(wǎng)絡(luò)服務(wù)緩存方法研究　出處：《北京交通大學(xué)》2016年博士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 信息中心網(wǎng)絡(luò) 域內(nèi)緩存 信息命名 緩存協(xié)作 命名粒度 魯棒性

【摘要】：傳統(tǒng)以主機(jī)網(wǎng)絡(luò)地址為中心的互聯(lián)網(wǎng)通信模式在網(wǎng)絡(luò)可擴(kuò)展性、安全性、可控可管性和移動(dòng)性等方面存在嚴(yán)重問題,無法適應(yīng)經(jīng)濟(jì)和社會(huì)發(fā)展對(duì)信息網(wǎng)絡(luò)的需求。因此,旨在滿足用戶對(duì)服務(wù)內(nèi)容需求、提高網(wǎng)絡(luò)傳輸效率的信息中心網(wǎng)絡(luò)在近年來得到了業(yè)界的廣泛關(guān)注。信息中心網(wǎng)絡(luò)通過為信息命名,使得信息在網(wǎng)絡(luò)中任意位置(節(jié)點(diǎn))存儲(chǔ)而不改變名字,從而便于用戶獲取內(nèi)容,提升用戶體驗(yàn)和網(wǎng)絡(luò)效率。本文針對(duì)信息中心網(wǎng)絡(luò)的服務(wù)緩存方法進(jìn)行研究,旨在提高信息中心網(wǎng)絡(luò)緩存效率。論文主要工作和創(chuàng)新點(diǎn)如下：1)為了確定信息中心網(wǎng)絡(luò)中的內(nèi)容命名粒度,分析了信息中心網(wǎng)絡(luò)內(nèi)容命名粒度對(duì)域內(nèi)緩存性能的影響。本文首先給出了內(nèi)容命名粒度的概念,分析了內(nèi)容命名粒度與分塊緩存的優(yōu)點(diǎn),及對(duì)網(wǎng)絡(luò)可擴(kuò)展性的影響。在此基礎(chǔ)上,通過仿真分析了內(nèi)容命名粒度在不同網(wǎng)絡(luò)拓?fù)�、用戶�?qǐng)求模型和緩存空間大小等關(guān)鍵參數(shù)條件下,不同緩存策略對(duì)緩存命中率、用戶請(qǐng)求時(shí)延和用戶請(qǐng)求跳數(shù)的影響。結(jié)果表明,內(nèi)容命名粒度在由大變小的過程中,緩存效率逐漸提高,但隨著粒度變小效率的增加幅度也逐漸減小,同時(shí)會(huì)帶來較大的網(wǎng)絡(luò)可擴(kuò)展性問題。基于文中所采用的網(wǎng)絡(luò)參數(shù),內(nèi)容命名粒度在區(qū)間[1OMB-100MB]內(nèi)可以獲得較好的緩存效率,同時(shí)保證對(duì)網(wǎng)絡(luò)可擴(kuò)展性影響不大。2)為了更好的適應(yīng)視頻等大容量流媒體服務(wù)的分發(fā)和傳輸,本文提出了一種基于內(nèi)容分塊流行度的流媒體服務(wù)緩存方法。通過分析用戶對(duì)大容量流媒體視頻的請(qǐng)求模式,即同一內(nèi)容的不同分塊具有不同流行度的特性,進(jìn)而得出用戶對(duì)流媒體服務(wù)的請(qǐng)求模型。根據(jù)這一模型并結(jié)合同一內(nèi)容不同分塊可以在不同節(jié)點(diǎn)緩存的特性,提出了一種根據(jù)內(nèi)容分塊流行度分級(jí)并將緩存節(jié)點(diǎn)根據(jù)位置進(jìn)行分級(jí)的緩存策略,通過在用戶請(qǐng)求包和數(shù)據(jù)包中攜帶緩存標(biāo)簽的方式實(shí)現(xiàn)隱式協(xié)作緩存。仿真結(jié)果表明,本方法相比于其他域內(nèi)緩存方法,可以更好的利用內(nèi)容分塊流行度的特性,具有更高的網(wǎng)絡(luò)緩存命中率,更低的內(nèi)容請(qǐng)求時(shí)延以及內(nèi)容請(qǐng)求跳數(shù),從而可以提升用戶對(duì)網(wǎng)絡(luò)流媒體服務(wù)的體驗(yàn)。3)現(xiàn)有信息中心網(wǎng)絡(luò)域內(nèi)緩存協(xié)作方案大多沒有考慮到網(wǎng)絡(luò)中緩存節(jié)點(diǎn)緩存失效或者不可達(dá)的情況。因此這些方案的緩存性能在緩存節(jié)點(diǎn)失效時(shí)將會(huì)受到較大影響。本文根據(jù)該問題提出了一種基于內(nèi)容分塊流行度并具有良好魯棒性的域內(nèi)緩存協(xié)作方法RINA。在RINA中,緩存節(jié)點(diǎn)被分為兩類,備份緩存節(jié)點(diǎn)和普通緩存節(jié)點(diǎn)。為了提供良好的魯棒性,RINA在備份緩存節(jié)點(diǎn)和普通緩存節(jié)點(diǎn)同時(shí)緩存了網(wǎng)絡(luò)中最流行的內(nèi)容分塊,所以當(dāng)網(wǎng)絡(luò)中任何節(jié)點(diǎn)失效時(shí),都不會(huì)對(duì)網(wǎng)絡(luò)的緩存性能(如緩存命中率)造成較大的影響。本章通過大量仿真,將RINA與其他現(xiàn)有的緩存方案進(jìn)行了比較。仿真結(jié)果表明,相比于其他緩存方案,不論是單個(gè)緩存節(jié)點(diǎn)失效還是多個(gè)緩存節(jié)點(diǎn)失效,RINA在提供較好緩存性能的同時(shí)保證緩存魯棒性。
[Abstract]:The traditional mode of Internet communication to host network address as the center of the scalability in network security, there are serious problems in terms of controllable and mobility, unable to adapt to the demand of economic and social development of the information network. Therefore, in order to meet the user demand for the service content, improve the efficiency of the network information center network has been the wide attention in recent years. The information center through the network for information makes the information in the network name, any position (node) storage without changing the name, which is convenient for users to access content, enhance the user experience and network efficiency. This paper makes a research on the service cache method for network information center, information center network to improve the cache efficiency. The main work and innovation are as follows: 1) to determine the content of network information center named granularity, analyzes the network information in the heart Effect of particle size on the domain name containing the cache performance. This paper first gives the concept of content named particle size, particle size and content analysis of advantages of named block cache, and network scalability. On this basis, through the simulation and analysis of the content of different size in the name of network topology, user requests the key parameters of the model and the cache size under the conditions of different cache hit rate of the cache, the user request delay and user request influence hops. The results showed that the content in the process of naming the size changed from big to small, the cache efficiency gradually increased, but with smaller particle size efficiency increase is gradually reduced, at the same time will bring great the network scalability problem. The network parameters used in this paper is based on the content of naming can obtain better efficiency of the cache size in the interval [1OMB-100MB], and ensure the network scalability. Not influence.2) in order to better adapt to the large capacity video streaming service distribution and transmission, this paper proposes a content based block of the popularity of streaming media service cache method. Through the analysis of user request patterns of streaming media video on large capacity, that is the same content and different blocks with different characteristics of popularity and then request model of streaming media service users. Based on this model and combined with the characteristics of the same content and different blocks in different node cache, a content block according to the popularity and grading the cache node according to the location of the hierarchical caching strategy, implementation of implicit cooperative caching by carrying a cache tag the user request packets and data packets in the way. The simulation results show that this method compared to other domain caching method, can use better characteristics of popularity, with a higher The network cache hit rate, lower content request delay and content request hops, which can enhance the user experience of the streaming media service network.3) existing information center network domain cooperative caching scheme has not considered to the network cache node cache invalidation or unreachable. Therefore the performance of these schemes in the cache cache node failure will be severely affected. This paper proposes a method based on block content popularity and has good robustness in domain of cooperative caching method RINA. in RINA according to this problem, the cache node is divided into two categories, the backup cache node and cache node. In order to provide good robustness, RINA in the backup cache the cache nodes and ordinary nodes at the same time the cache is the most popular network content in the block, so when any node in the network fails, not on the network cache performance (e.g. The cache hit rate) has a greater impact. This chapter through a lot of simulation, RINA and other existing caching schemes are compared. The simulation results show that compared to the other cache scheme, both multiple cache node failure single cache node failure, ensure the robustness of the RINA cache in providing better cache performance at the same time.

【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP393.02;TP333

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 劉喬壽;周建二;張普寧;;機(jī)會(huì)網(wǎng)絡(luò)中基于消息副本數(shù)量的自適應(yīng)緩存管理策略[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年04期

2 吳大鵬;張普寧;王汝言;;帶有消息投遞概率估計(jì)的機(jī)會(huì)網(wǎng)絡(luò)自適應(yīng)緩存管理策略[J];電子與信息學(xué)報(bào);2014年02期

3 溫蜀山,李樂民,孫海榮;用于緩存管理的最高速流早期丟棄策略[J];電子學(xué)報(bào);2002年10期

4 葉棟,王兵,丁煒;高效通用緩存管理的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)工程與應(yīng)用;2002年03期

5 李廣德;;機(jī)會(huì)網(wǎng)絡(luò)中基于優(yōu)先級(jí)的緩存管理策略研究[J];廣東通信技術(shù);2013年01期

6 楊進(jìn)才,劉云生,王敬華;一個(gè)移動(dòng)計(jì)算環(huán)境中的緩存管理協(xié)議[J];計(jì)算機(jī)工程;2005年05期

7 黃沛昱;應(yīng)俊;;消息替換風(fēng)險(xiǎn)動(dòng)態(tài)感知的緩存管理策略[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年02期

8 白小明;邱桃榮;;基于有限緩存輸入隊(duì)列交換機(jī)的緩存管理策略[J];計(jì)算機(jī)工程與應(yīng)用;2008年11期

9 李平;楊婷婷;韓俊剛;;網(wǎng)絡(luò)交換中的緩存管理研究與實(shí)現(xiàn)[J];微電子學(xué)與計(jì)算機(jī);2012年01期

10 劉喬壽;白娜;王燕燕;張洪沛;;機(jī)會(huì)網(wǎng)絡(luò)緩存管理機(jī)制性能分析與比較[J];數(shù)字通信;2014年02期

相關(guān)會(huì)議論文 前2條

1 司成祥;孟曉p，

本文編號(hào)：1435938