【摘要】：隨著互聯(lián)網(wǎng)寬帶技術(shù)、IPV6、3G等技術(shù)的飛速發(fā)展，流媒體已成為Internet承載的重要任務(wù)。對等網(wǎng)絡(luò)流媒體系統(tǒng)的低消耗和高可擴展性很好的解決了傳統(tǒng)流媒體系統(tǒng)中服務(wù)器和網(wǎng)絡(luò)的高壓力問題，使得為用戶提供高質(zhì)量網(wǎng)絡(luò)視頻服務(wù)成為可能。在隨機的拓撲結(jié)構(gòu)中，由于鄰居選擇的隨機性和不確定性，使得網(wǎng)絡(luò)系統(tǒng)中存在主干網(wǎng)絡(luò)壓力大、啟動延遲和播放延遲長以及幀丟失率高等問題。 針對隨機對等網(wǎng)絡(luò)中主干網(wǎng)絡(luò)壓力大、啟動延遲和播放延遲長以及幀丟失率高等問題，本文首先提出了一種基于RTT(Round-Trip Time,RTT)優(yōu)先位圖匹配結(jié)合的鄰居選擇算法。該算法利用Tracker服務(wù)器存儲整個網(wǎng)絡(luò)中所有節(jié)點之間的RTT信息和位圖(bitmap)信息，當(dāng)節(jié)點向請求鄰居列表時，Tracker服務(wù)器通過節(jié)點的RTT信息和位圖信息及鄰居篩選函數(shù)為節(jié)點生成最佳鄰居列表。通過OMNET++平臺仿真實驗顯示，與隨機鄰居選擇算法相比，基于RTT優(yōu)先位圖匹配結(jié)合的P2P鄰居選擇算法具有較小的啟動延遲和播放延遲，同時很好地降低了幀丟失率和系統(tǒng)平均跳數(shù)。 同時，本文應(yīng)用節(jié)點之間的RTT信息，，對CoolStreaming算法進行優(yōu)化，提出一種基于RTT優(yōu)化的CoolStreaming優(yōu)化算法。該算法在節(jié)點選擇新的父節(jié)點時加入RTT考慮，如果滿足CoolStreaming算法原有的限制條件的伙伴節(jié)點個數(shù)大于1，則節(jié)點獲取與這些伙伴節(jié)點之間的RTT，選擇與請求節(jié)點之間RTT最小的伙伴節(jié)點作為新的父節(jié)點，請求服務(wù)。通過OMNET++平臺仿真實驗顯示，與隨機鄰居選擇算法和CoolStreaming算法相比，基于RTT優(yōu)化的CoolStreaming算法雖然在啟動延遲上沒有很好的提高，但是在幀丟失率等方面，取得了很明顯的改善，大大降低了幀丟失率和平均跳數(shù)。 最后，本文提出一種基于用戶等級的P2P流媒體激勵機制。通過用戶等級將節(jié)點分類，當(dāng)節(jié)點加入時，根據(jù)用戶等級構(gòu)建分層P2P拓撲結(jié)構(gòu)，將用戶等級高的用戶放在離源服務(wù)器較近的層，使得其獲得較好的服務(wù)質(zhì)量，從而激勵整個系統(tǒng)中的節(jié)點。通過OMNET++平臺仿真實驗顯示，基于用戶等級的P2P流媒體激勵機制中用戶等級高的節(jié)點的啟動延遲和播放延遲較低；同時與隨機鄰居選擇算法，具有較小的啟動延遲和播放延遲。
[Abstract]:With the rapid development of Internet broadband technology and IPV6,3G technology, streaming media has become an important task for Internet. The low consumption and high scalability of peer-to-peer streaming media system solve the problem of high pressure of server and network in traditional streaming media system, which makes it possible to provide high quality network video service for users. In the random topology, due to the randomness and uncertainty of neighbor selection, there are some problems in the network system, such as high backbone network pressure, long startup delay and playback delay, and high frame loss rate. In this paper, a neighbor selection algorithm based on RTT (Round-Trip Time,RTT) priority bitmap matching is proposed to solve the problems of high backbone network pressure, long startup delay and playback delay and high frame loss rate in random peer-to-peer networks. The algorithm uses Tracker server to store RTT information and bitmap (bitmap) information between all nodes in the whole network. The Tracker server generates the best neighbor list for the node through the RTT information, bitmap information and neighbor filter function of the node. The simulation results of OMNET platform show that compared with the random neighbor selection algorithm, the P2P neighbor selection algorithm based on RTT priority bitmap matching has smaller startup delay and playback delay. At the same time, the frame loss rate and the average hops of the system are well reduced. At the same time, using the RTT information between nodes, this paper optimizes the CoolStreaming algorithm and proposes a CoolStreaming optimization algorithm based on RTT optimization. The algorithm adds RTT to the selection of new parent nodes. If the number of partner nodes satisfying the original restriction of the CoolStreaming algorithm is greater than 1, then the node acquires the RTT, between these partner nodes. Select the smallest partner node of RTT between the requesting node as the new parent node to request the service. The simulation results of OMNET platform show that compared with the random neighbor selection algorithm and the CoolStreaming algorithm, the CoolStreaming algorithm based on RTT has not been improved in the starting delay, but the frame loss rate has been improved obviously. The frame loss rate and average hops are greatly reduced. Finally, this paper proposes a P2P streaming media incentive mechanism based on user level. The nodes are classified by user level. When nodes are added, the hierarchical P2P topology is constructed according to the user level, and the users with high user level are placed in the nearest layer to the source server, so that they can get better quality of service. Thus motivating the nodes in the whole system. The simulation experiments on OMNET platform show that the node with high user level has lower startup delay and playback delay in P2P streaming media incentive mechanism based on user level, and with random neighbor selection algorithm, it has small startup delay and playback delay.
【學(xué)位授予單位】：吉林大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

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

1 胡進鋒;洪春輝;鄭緯民;;一種面向?qū)ο蟮腎nternet存儲服務(wù)系統(tǒng)Granary[J];計算機研究與發(fā)展;2007年06期

2 郭朝陽,代亞非,韓華;燕星系統(tǒng)的設(shè)計及其實現(xiàn)中的技術(shù)問題[J];計算機工程與應(yīng)用;2003年09期

3 王曉潔;;混合式P2P網(wǎng)絡(luò)關(guān)鍵節(jié)點問題的研究[J];臨沂師范學(xué)院學(xué)報;2008年03期

4 張茂偉;孫玉峰;;Skype協(xié)議分析[J];山東通信技術(shù);2007年02期

5 張志明;周晉;陳震;李軍;;基于網(wǎng)絡(luò)編碼的對等網(wǎng)流媒體傳輸模型和算法[J];軟件學(xué)報;2012年03期

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

1 韓志杰;基于P2P的流媒體若干關(guān)鍵技術(shù)研究[D];蘇州大學(xué);2009年

2 王嵩;P2P媒體服務(wù)系統(tǒng)研究[D];中國科學(xué)技術(shù)大學(xué);2010年

本文編號：2418888