【摘要】：隨著計(jì)算機(jī)網(wǎng)絡(luò)規(guī)模的擴(kuò)張和用戶對(duì)內(nèi)容需求的不斷增長(zhǎng),在網(wǎng)絡(luò)中傳遞的內(nèi)容對(duì)象數(shù)量日益增多。傳統(tǒng)的“以主機(jī)為中心”的網(wǎng)絡(luò)體系在安全性、移動(dòng)性和內(nèi)容傳遞效率上存在的缺陷日益突出,已經(jīng)無法適應(yīng)不斷增長(zhǎng)的信息訪問需求。信息中心網(wǎng)絡(luò)(Information-Centric Network,ICN)這種以信息為中心的網(wǎng)絡(luò)架構(gòu)應(yīng)運(yùn)而生。網(wǎng)絡(luò)內(nèi)嵌緩存是信息中心網(wǎng)絡(luò)的一個(gè)重要優(yōu)勢(shì),高效地管理網(wǎng)絡(luò)緩存對(duì)于網(wǎng)絡(luò)性能的提升有著重要的意義。信息中心網(wǎng)絡(luò)的緩存管理分為協(xié)作式和非協(xié)作式,協(xié)作式的緩存管理需要網(wǎng)絡(luò)中節(jié)點(diǎn)之間的高度配合。軟件定義網(wǎng)絡(luò)(Softeware Defined Network,SDN)作為重要的下一代網(wǎng)絡(luò)架構(gòu),通過控制平面和數(shù)據(jù)平面的分離,實(shí)現(xiàn)了對(duì)網(wǎng)絡(luò)的集中管控。將軟件定義網(wǎng)絡(luò)融入到信息中心網(wǎng)絡(luò)的設(shè)計(jì)中,可以從全網(wǎng)的角度實(shí)現(xiàn)緩存管理。本文介紹了軟件定義信息中心網(wǎng)絡(luò)的實(shí)現(xiàn)方案,并在此基礎(chǔ)上設(shè)計(jì)了協(xié)作式的緩存管理架構(gòu)。通常,緩存管理需要將網(wǎng)絡(luò)中內(nèi)容流行度信息作為關(guān)鍵的輸入之一,因而高性能的內(nèi)容流行度統(tǒng)計(jì)方法對(duì)于緩存管理非常重要。本文提出了PopFilter內(nèi)容流行度統(tǒng)計(jì)方法,實(shí)現(xiàn)了對(duì)內(nèi)容請(qǐng)求的線速處理,降低了內(nèi)容請(qǐng)求頻次統(tǒng)計(jì)過程的復(fù)雜度,并將統(tǒng)計(jì)結(jié)果的解碼處理工作交給運(yùn)算能力強(qiáng)大的控制器,合理分配了交換機(jī)和控制器的運(yùn)算能力。此外,與傳統(tǒng)的內(nèi)容流行度統(tǒng)計(jì)方法相比,該方法擁有更高的準(zhǔn)確性。在本文的研究中,基于全網(wǎng)的協(xié)作式緩存管理以最小化網(wǎng)絡(luò)中內(nèi)容請(qǐng)求的代價(jià)為目標(biāo)。首先在內(nèi)容路由固定的前提下,本文引入了內(nèi)容緩存本地收益的概念,其定義綜合考慮了內(nèi)容請(qǐng)求代價(jià)和內(nèi)容的流行度。本文提出了基于內(nèi)容緩存本地收益的緩存管理方法,仿真結(jié)果表明該方法可以在很大程度上減少網(wǎng)絡(luò)中內(nèi)容請(qǐng)求的代價(jià)。然后在此基礎(chǔ)之上,本文提出一種更加靈活的緩存管理方法,即在內(nèi)容路由可變的情況下,綜合考慮內(nèi)容路由和內(nèi)容緩存的聯(lián)合優(yōu)化問題,并基于遺傳算法來求解該問題,仿真表明內(nèi)容路由和緩存的聯(lián)合優(yōu)化在減少網(wǎng)絡(luò)中內(nèi)容請(qǐng)求代價(jià)的問題上能取得更好的解決效果。
[Abstract]:With the expansion of computer network scale and the increasing demand for content, the number of content objects transferred in the network is increasing day by day. The traditional "host-centered" network system has more and more shortcomings in security, mobility and content delivery efficiency, which can not meet the increasing information access needs. Information Center Network (Information-Centric Network,ICN), an information-centric network architecture, emerged as the times require. Network inlay cache is an important advantage of information center network. It is very important to manage the network cache efficiently for the improvement of network performance. The cache management of information center network can be divided into cooperative and non-cooperative. The cooperative cache management needs a high degree of cooperation between nodes in the network. As an important next generation network architecture, the software defined network (Softeware Defined Network,SDN) realizes centralized control of the network by separating the control plane from the data plane. By integrating the software definition network into the design of the information center network, the cache management can be realized from the point of view of the whole network. This paper introduces the implementation of software defined information center network, and designs a cooperative cache management architecture. In general, cache management needs to take the content popularity information as one of the key inputs, so high performance content popularity statistics method is very important for cache management. In this paper, the method of PopFilter content popularity statistics is proposed, which realizes the line speed processing of content request, reduces the complexity of the process of content request frequency statistics, and hands over the decoding work of the statistical result to a controller with powerful operation ability. The operation power of switch and controller is allocated reasonably. In addition, compared with the traditional method of content popularity statistics, this method has higher accuracy. In this paper, the goal of collaborative cache management based on whole network is to minimize the cost of content request in the network. Firstly, under the premise of fixed content routing, this paper introduces the concept of local income of content cache, whose definition takes into account the cost of content request and the popularity of content. In this paper, a cache management method based on local revenue of content cache is proposed. The simulation results show that the method can greatly reduce the cost of content request in the network. Then, this paper proposes a more flexible cache management method, that is, considering the joint optimization of content routing and content cache in the case of variable content routing, and solving the problem based on genetic algorithm. Simulation results show that the joint optimization of content routing and caching can achieve a better solution to the problem of reducing the cost of content request in the network.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP393.0

【參考文獻(xiàn)】

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

1 張宏宇;牛翠翠;吳震;;NDN中路由機(jī)制研究綜述[J];現(xiàn)代電信科技;2014年11期

2 董利利;王勇;董永強(qiáng);楊鵬;;NDN中基于蟻群替換算法的鄰居協(xié)作緩存管理策略[J];電信科學(xué);2014年09期

3 吳超;張堯?qū)W;周悅芝;傅曉明;;信息中心網(wǎng)絡(luò)發(fā)展研究綜述[J];計(jì)算機(jī)學(xué)報(bào);2015年03期

4 劉外喜;余順爭(zhēng);蔡君;高鷹;;ICN中的一種協(xié)作緩存機(jī)制[J];軟件學(xué)報(bào);2013年08期

5 夏春梅;徐明偉;;信息中心網(wǎng)絡(luò)研究綜述[J];計(jì)算機(jī)科學(xué)與探索;2013年06期

6 陳松;王珊;周明天;;基于實(shí)時(shí)分析的網(wǎng)絡(luò)測(cè)量抽樣統(tǒng)計(jì)模型[J];電子學(xué)報(bào);2010年05期

7 曹盼盼;閻春寧;;人類通信模式的冪律分布和Zipf定律[J];復(fù)雜系統(tǒng)與復(fù)雜性科學(xué);2009年04期

8 周靈;;Waxman-Salama模型網(wǎng)絡(luò)拓?fù)渖伤惴ㄔO(shè)計(jì)與實(shí)現(xiàn)[J];湖南理工學(xué)院學(xué)報(bào)(自然科學(xué)版);2008年02期

9 周文莉;吳曉非;;P2P技術(shù)綜述[J];計(jì)算機(jī)工程與設(shè)計(jì);2006年01期

10 宋家友,桑紅濤;CDN技術(shù)的發(fā)展及應(yīng)用[J];電視技術(shù);2005年06期

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

1 任婧;內(nèi)容中心網(wǎng)絡(luò)架構(gòu)及相關(guān)技術(shù)研究[D];電子科技大學(xué);2015年

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

1 袁建明;基于SDN的ICN網(wǎng)絡(luò)設(shè)計(jì)[D];云南財(cái)經(jīng)大學(xué);2015年

2 童彤;內(nèi)容中心網(wǎng)絡(luò)緩存管理及配置方法研究[D];電子科技大學(xué);2015年

3 曾瀟;下一代以內(nèi)容為中心網(wǎng)絡(luò)架構(gòu)的探討與研究[D];北京郵電大學(xué);2014年

4 胡敏覺;云計(jì)算技術(shù)在景區(qū)商務(wù)智能中的應(yīng)用研究[D];合肥工業(yè)大學(xué);2013年

，

本文編號(hào)：2291998