本文關(guān)鍵詞： 流媒體 分段方式 超幾何分布 靜態(tài)調(diào)度 緩存替換策略　出處：《北京交通大學(xué)》2015年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：流媒體系統(tǒng)在實(shí)際中應(yīng)用廣泛,但大量圖形數(shù)據(jù)在網(wǎng)絡(luò)傳輸時(shí)出現(xiàn)響應(yīng)速度慢、網(wǎng)絡(luò)擁塞嚴(yán)重、緩存利用率低等問(wèn)題。尤其在硬件帶寬較低情況下,如服務(wù)器網(wǎng)卡讀寫(xiě)能力不足、PCI時(shí)鐘頻率低、總線位寬數(shù)低于64位等情況下。本文針對(duì)該類(lèi)問(wèn)題提出一種基于預(yù)期使用價(jià)值的緩存替換策略,并以基于斐波那契數(shù)列劃分的變動(dòng)分段方式為基礎(chǔ)實(shí)現(xiàn)流轉(zhuǎn)化。 本論文主要分為三個(gè)部分： 第一,從流媒體關(guān)鍵技術(shù)出發(fā),通過(guò)對(duì)其在不同傳輸協(xié)議、不同編碼方式下數(shù)據(jù)段平均接收分段數(shù)、平均下載時(shí)間進(jìn)行統(tǒng)計(jì),分析調(diào)度策略在流媒體數(shù)據(jù)傳輸中的重要性。通過(guò)評(píng)估C/S網(wǎng)絡(luò)結(jié)構(gòu)得出其作為緩存替換策略測(cè)試平臺(tái)的合理性。此外,本文也闡述了靜態(tài)調(diào)度算法的分段方式在調(diào)度策略中和緩存替換策略成果及其在點(diǎn)播系統(tǒng)中的重要意義。 第二,本文為預(yù)期使用價(jià)值算法的實(shí)現(xiàn)提出一種將斐波那契數(shù)列相結(jié)合的數(shù)據(jù)分段方式,并通過(guò)Ns2仿真軟件對(duì)新的數(shù)據(jù)分段方式進(jìn)行模擬統(tǒng)計(jì)。分析中發(fā)現(xiàn)新算法在減小對(duì)磁盤(pán)資源的占用和降低延時(shí)方面都比其余算法具有更好的效果。然后從用戶點(diǎn)播體驗(yàn)和用戶行為特征入手提出基于預(yù)期使用價(jià)值的緩存替換策略。 第三,針對(duì)基于預(yù)期使用價(jià)值算法,通過(guò)二次編碼Ns2仿真環(huán)境的底層C++代碼來(lái)拓展Ns2仿真環(huán)境功能模塊,對(duì)編譯分級(jí)結(jié)構(gòu)中TclObject基類(lèi)添加派生類(lèi)。通過(guò)建立啞鈴型網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu),分別對(duì)服務(wù)器響應(yīng)延時(shí)、客戶端請(qǐng)求延時(shí)、目標(biāo)節(jié)點(diǎn)延時(shí)、網(wǎng)絡(luò)吞吐量等指標(biāo)進(jìn)行測(cè)試,得出ULH算法優(yōu)于傳統(tǒng)的LRU、LFU算法。最后將全部策略嵌入到實(shí)際網(wǎng)絡(luò)平臺(tái)中,對(duì)流媒體播放效果進(jìn)行實(shí)驗(yàn),得到了較好的圖像傳輸效果。
[Abstract]:Streaming media system is widely used in practice, but a large number of graphics data in the network transmission problems such as slow response speed, serious network congestion, low cache utilization, especially in the case of low hardware bandwidth. For example, the server network card is not able to read and write, the PCI clock frequency is low, the bus bit width is less than 64 bits, and so on. This paper proposes a cache replacement strategy based on the expected use value for this kind of problems. And based on the Fibonacci series division of the variable segmentation as the basis for the realization of flow transformation. This thesis is divided into three parts:. First, according to the key technology of streaming media, the average number of data segments received and the average download time under different transmission protocols and different encoding methods are counted. The importance of scheduling strategy in streaming media data transmission is analyzed, and the rationality of C- / S network structure as a test platform for cache replacement policy is obtained by evaluating the structure of C- / S network. This paper also describes the achievements of static scheduling algorithms in scheduling policies and cache replacement policies and its significance in on-demand systems. Secondly, this paper proposes a data segmentation method which combines Fibonacci series for the realization of the expected use value algorithm. Through the Ns2 simulation software, the new data segmentation method is simulated and counted. It is found that the new algorithm is more effective than the other algorithms in reducing the cost of disk resources and the delay. Based on the characteristics of broadcast experience and user behavior, a cache replacement strategy based on expected use value is proposed. Thirdly, based on the expected use value algorithm, the function module of the Ns2 simulation environment is extended by the lower C code of the secondary coding Ns2 simulation environment. By establishing the dumbbell network topology structure, we test the server response delay, the client request delay, the target node delay, the network throughput and so on. It is concluded that the ULH algorithm is superior to the traditional LRUL-LFU algorithm. Finally, all the strategies are embedded into the actual network platform, and the streaming media playback effect is tested, and the better image transmission effect is obtained.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TP333

【參考文獻(xiàn)】

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

1 蔡青松,李子木,胡建平;Internet上的流媒體特性及用戶訪問(wèn)行為研究[J];北京航空航天大學(xué)學(xué)報(bào);2005年01期

2 陳琳;雙雪芹;;TCP網(wǎng)絡(luò)擁塞控制算法比較研究[J];長(zhǎng)江大學(xué)學(xué)報(bào)(自然科學(xué)版)理工卷;2010年01期

3 吳小明;;結(jié)合CDN與P2P技術(shù)的流媒體代理緩存研究[J];大眾科技;2009年02期

4 朱允敏;張麗偉;王生原;董淵;張素琴;;面向多核處理器的低級(jí)并行程序驗(yàn)證[J];電子學(xué)報(bào);2009年S1期

5 楊際祥;譚國(guó)真;王榮生;;多核軟件的幾個(gè)關(guān)鍵問(wèn)題及其研究進(jìn)展[J];電子學(xué)報(bào);2010年09期

6 晏沛湘;楊先炬;張民選;;一種面向CMP的可變相聯(lián)度混合Cache結(jié)構(gòu)[J];電子學(xué)報(bào);2011年03期

7 黃道穎,李祖鵬,莊雷,黃建華,張安琳;分布式Peer-to-Peer網(wǎng)絡(luò)Gnutella模型研究[J];計(jì)算機(jī)工程與應(yīng)用;2003年05期

8 趙家森;計(jì)算Fibonacci數(shù)的對(duì)分迭代算法[J];計(jì)算機(jī)工程與應(yīng)用;2003年22期

9 張牧;李君;;TCP擁塞控制算法的仿真研究[J];計(jì)算機(jī)工程與應(yīng)用;2008年21期

10 馬杰;樊建平;;具有高緩存寫(xiě)入效率的流媒體分段緩存方法[J];計(jì)算機(jī)學(xué)報(bào);2007年04期

，

本文編號(hào)：1547989