【摘要】：基于對(duì)等網(wǎng)絡(luò)(P2P)的內(nèi)容請(qǐng)求由于其靈活性、分發(fā)負(fù)載小、有效性高等眾多優(yōu)點(diǎn)而被廣泛使用。但是,由于網(wǎng)絡(luò)和系統(tǒng)環(huán)境變化,仍存在一些問(wèn)題,如服務(wù)有效性、穩(wěn)定性和自適應(yīng)性等。這些問(wèn)題的解決,可以進(jìn)一步提高系統(tǒng)性能和服務(wù)質(zhì)量,改善用戶(hù)的觀看體驗(yàn)。當(dāng)前P2P網(wǎng)絡(luò)系統(tǒng),主要分為有結(jié)構(gòu)、無(wú)結(jié)構(gòu)和混合型三種。其中混合型兼具結(jié)構(gòu)和無(wú)結(jié)構(gòu)模型優(yōu)點(diǎn),查詢(xún)有效性高且系統(tǒng)穩(wěn)定性強(qiáng)。本文基于混合型P2P網(wǎng)絡(luò),并結(jié)合內(nèi)容分發(fā)策略設(shè)計(jì)了一種流媒體服務(wù)系統(tǒng)結(jié)構(gòu),通過(guò)設(shè)立局部對(duì)等網(wǎng)絡(luò)自治域以提高系統(tǒng)服務(wù)性能,減少骨干網(wǎng)的流量負(fù)載。在基于P2P網(wǎng)絡(luò)的系統(tǒng)中,為適合網(wǎng)絡(luò)傳輸,對(duì)內(nèi)容進(jìn)行分片。常用的內(nèi)容分片算法有等大小算法、等時(shí)長(zhǎng)算法和變大小算法,它們?cè)诓煌木W(wǎng)絡(luò)環(huán)境下性能差異較大,并且不能適應(yīng)網(wǎng)絡(luò)變化。為此,本文提出一種自適應(yīng)分片算法,來(lái)增強(qiáng)系統(tǒng)服務(wù)穩(wěn)定性。該算法根據(jù)網(wǎng)絡(luò)傳輸速率、丟包率、文件分布和不同節(jié)點(diǎn)的處理性能,來(lái)設(shè)計(jì)分片大小。實(shí)驗(yàn)結(jié)果表明,在大多數(shù)網(wǎng)絡(luò)環(huán)境下,這種自適應(yīng)分片算法比其它分片算法性能更好。現(xiàn)有分片調(diào)度算法有基于時(shí)間的順序調(diào)度、稀有分片優(yōu)先調(diào)度和基于權(quán)值的分片調(diào)度等,這些算法沒(méi)有綜合考慮視頻的播放緊急程度、稀缺分片、用戶(hù)與視頻交互等因素。為了進(jìn)一步提高系統(tǒng)服務(wù)性能,本文提出一種基于標(biāo)簽優(yōu)先級(jí)的分片調(diào)度算法,根據(jù)視頻當(dāng)前播放時(shí)間點(diǎn),將需要下載的分片根據(jù)優(yōu)先級(jí)順序打上不同標(biāo)簽:緊急分片、錨點(diǎn)分片、稀缺分片、普通分片和失效分片。當(dāng)優(yōu)先級(jí)一致,則根據(jù)時(shí)間先后來(lái)排序。實(shí)驗(yàn)結(jié)果表明,相對(duì)于基于時(shí)間順序、稀缺分片優(yōu)先和基于權(quán)值的調(diào)度算法,該算法性能提高顯著。最后,在安卓系統(tǒng)的機(jī)頂盒上,對(duì)該系統(tǒng)中核心的內(nèi)容分片和分片調(diào)度模塊進(jìn)行了驗(yàn)證。
[Abstract]:Peer-to-Peer (P2P) based content requests are widely used because of their flexibility, low distribution load and high efficiency. However, due to the network and system environment changes, there are still some problems, such as service effectiveness, stability and adaptability. The solution of these problems can further improve the system performance and service quality, and improve the user's viewing experience. At present, P2P network system is mainly divided into three types: structured, unstructured and hybrid. The hybrid model has the advantages of both structural and unstructured models, high query efficiency and strong system stability. This paper designs a streaming media service system structure based on hybrid P2P network and content distribution strategy. By setting up local peer-to-peer network autonomous domain to improve the system service performance and reduce the traffic load of backbone network. In the system based on P2P network, the content is partitioned to fit the network transmission. The commonly used content slicing algorithms include equal size algorithm, equal time length algorithm and variable size algorithm, which have different performance in different network environments, and can not adapt to network changes. Therefore, an adaptive slicing algorithm is proposed to enhance the system service stability. The chip size is designed according to the network transmission rate, packet loss rate, file distribution and processing performance of different nodes. The experimental results show that this adaptive slicing algorithm performs better than other algorithms in most network environments. The existing piecewise scheduling algorithms include sequential scheduling based on time, rare piecewise priority scheduling and weighted piecewise scheduling. These algorithms do not take into account the emergency degree of video playback, the scarcity of slicing, the interaction between users and video, and so on. In order to further improve the performance of the system, this paper proposes a slicing scheduling algorithm based on label priority. According to the current playback time point of the video, the segments that need to be downloaded are tagged according to the priority order: emergency slicing. Anchor points, scarce, ordinary, and failure segments. When the priority is the same, it is sorted according to the order of time. The experimental results show that the performance of the proposed algorithm is significantly improved compared with the scheduling algorithm based on the time sequence, the scarcity slicing priority and the weight based algorithm. Finally, in the Android set-top box, the core of the system content slicing and partitioning scheduling module is verified.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 曾曉娟;;關(guān)于P2P流媒體技術(shù)[J];辦公自動(dòng)化;2015年21期

2 麻青松;;試論三網(wǎng)融合技術(shù)[J];中小企業(yè)管理與科技(下旬刊);2013年07期

3 張玉潔;何明;孟祥武;;基于用戶(hù)需求的內(nèi)容分發(fā)點(diǎn)對(duì)點(diǎn)網(wǎng)絡(luò)系統(tǒng)研究[J];軟件學(xué)報(bào);2014年01期

4 張明軍;彭婭;俞文靜;;P2P流媒體服務(wù)方案及其關(guān)鍵技術(shù)研究[J];計(jì)算機(jī)工程;2013年01期

5 崔建群;賴(lài)敏財(cái);蔣文斌;陳傳河;;OverSim:可擴(kuò)展的應(yīng)用層組播網(wǎng)絡(luò)仿真框架[J];計(jì)算機(jī)工程與科學(xué);2012年10期

6 徐進(jìn);李曉峰;傅志中;鮮海瀅;;應(yīng)用網(wǎng)絡(luò)編碼的P2P流媒體技術(shù)研究進(jìn)展[J];計(jì)算機(jī)科學(xué);2012年03期

7 伍國(guó)良;;流媒體技術(shù)淺析[J];今日科苑;2009年04期

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

1 陳磊;智能電視終端資源管理及服務(wù)性能優(yōu)化的研究[D];中國(guó)科學(xué)技術(shù)大學(xué);2013年

2 彭浩;復(fù)雜對(duì)等網(wǎng)絡(luò)系統(tǒng)中安全機(jī)制的研究[D];上海交通大學(xué);2012年

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

1 劉笑;基于Hadoop的視頻點(diǎn)播關(guān)鍵技術(shù)研究[D];電子科技大學(xué);2015年

2 張希;異構(gòu)環(huán)境中SVC-P2P-VoD分片調(diào)度研究[D];重慶大學(xué);2014年

3 費(fèi)斌;基于物聯(lián)網(wǎng)的P2P通信技術(shù)研究[D];武漢理工大學(xué);2013年

4 姚彬;P2P流媒體系統(tǒng)數(shù)據(jù)調(diào)度和傳輸層優(yōu)化技術(shù)研究[D];浙江大學(xué);2013年

5 丁富強(qiáng);P2PVoD客戶(hù)端系統(tǒng)的研究與實(shí)現(xiàn)[D];鄭州大學(xué);2012年

6 程輝;邊緣網(wǎng)絡(luò)流媒體傳輸模型與質(zhì)量監(jiān)測(cè)的研究與應(yīng)用[D];國(guó)防科學(xué)技術(shù)大學(xué);2012年

7 侯軍偉;基于用戶(hù)行為能力的P2P流媒體節(jié)點(diǎn)選擇策略研究[D];中國(guó)海洋大學(xué);2011年

8 程曉晨;移動(dòng)流媒體帶寬分配及數(shù)據(jù)調(diào)度策略研究[D];華中科技大學(xué);2011年

，

本文編號(hào)：2279114