本文選題：P2P技術(shù)　切入點(diǎn)：移動(dòng)代理　出處：《蘇州大學(xué)》2014年碩士論文

【摘要】：自從1999年Napster軟件出現(xiàn)以后，P2P技術(shù)以其強(qiáng)大的支持網(wǎng)絡(luò)的可擴(kuò)展性而迅速受到廣大研究者的關(guān)注。從2000年開始，，學(xué)術(shù)界持續(xù)關(guān)注P2P技術(shù)并進(jìn)行了深入研究。到2007年，P2P技術(shù)的主要問題和核心機(jī)制等都基本得到解決，廣大研究者達(dá)成共識(shí)，對(duì)P2P下一步的研究重點(diǎn)應(yīng)轉(zhuǎn)向如何利用P2P技術(shù)滿足不同的應(yīng)用以最大限度地發(fā)揮P2P技術(shù)的優(yōu)點(diǎn)。 根據(jù)研究現(xiàn)狀和已有的研究方法，本文首先給出了一種支持模糊查詢的P2P網(wǎng)絡(luò)模型AS-Chord。為了充分利用節(jié)點(diǎn)的異質(zhì)性，AS-Chord將網(wǎng)絡(luò)節(jié)點(diǎn)劃分成兩類。通過結(jié)合移動(dòng)代理，AS-Chord中每個(gè)能力相對(duì)較強(qiáng)的節(jié)點(diǎn)存儲(chǔ)一類資源索引，從而支持了模糊查詢。另外，本文還給出了一種基于PULL模型的分布式求解流媒體最大傳輸速率方法。該方法使用平均帶寬分配和上傳鄰居隨機(jī)選擇算法，首先進(jìn)行模型分析，然后通過MATLAB實(shí)驗(yàn)求解出在任意流媒體網(wǎng)絡(luò)節(jié)點(diǎn)選擇不同個(gè)數(shù)上傳鄰居進(jìn)行上傳帶寬請(qǐng)求時(shí)，節(jié)點(diǎn)得到的上傳帶寬小于期望得到的上傳帶寬的概率，從而根據(jù)要求確定任意節(jié)點(diǎn)選擇上傳鄰居的個(gè)數(shù)。最后通過模擬實(shí)驗(yàn)統(tǒng)計(jì)了相關(guān)網(wǎng)絡(luò)參數(shù)并給出了基于移動(dòng)代理的改進(jìn)方案。該方案在很大程度上提升了流媒體最大傳輸速率，同時(shí)保持了較小的上傳鄰居選擇個(gè)數(shù)。 模擬實(shí)驗(yàn)結(jié)果表明，一方面AS-Chord中的移動(dòng)代理可有效地將資源索引放置到合適的超級(jí)節(jié)點(diǎn)上，使得同一個(gè)超級(jí)節(jié)點(diǎn)上的資源索引相似。另一方面，在求解流媒體最大傳輸速率時(shí)，移動(dòng)代理可有效地幫助上傳帶寬冗余的節(jié)點(diǎn)和獲取上傳帶寬較少的節(jié)點(diǎn)建立連接，提升后者得到的上傳帶寬，從而提升流媒體最大傳輸速率。因此，結(jié)合移動(dòng)代理和P2P技術(shù)的優(yōu)點(diǎn)，可在某些特定方面提升分布式應(yīng)用的性能。
[Abstract]:Since the emergence of Napster software in 1999, P2P technology has attracted the attention of researchers because of its strong scalability. By 2007, the main problems and core mechanisms of P2P technology had been basically solved, and the majority of researchers reached a consensus. The next step of P2P research should focus on how to use P2P technology to meet different applications in order to maximize the advantages of P2P technology. According to the current research situation and existing research methods, This paper presents a P2P network model AS-Chord. in order to make full use of the heterogeneity of nodes, AS-Chord divides the network nodes into two categories. In order to store a class of resource indexes by combining each node with relatively strong capability in mobile agent AS-Chord, this paper presents a P2P network model named AS-Chord-Chord, which supports fuzzy query, in order to make full use of the heterogeneity of nodes. In addition, this paper presents a distributed method based on PULL model to solve the maximum transmission rate of streaming media. This method uses the average bandwidth allocation and upload neighbor random selection algorithm to analyze the model at first. Then the MATLAB experiment is used to solve the probability that when any streaming media network node selects different number of upload neighbors to request the upload bandwidth, the upload bandwidth obtained by the node is less than the expected upload bandwidth. According to the requirement, the number of uploading neighbors of any node is determined. Finally, the related network parameters are counted through simulation experiments and an improved scheme based on mobile agent is given. This scheme improves the maximum transmission rate of streaming media to a great extent. At the same time, the number of uploading neighbors is kept small. The simulation results show that, on the one hand, the mobile agent in AS-Chord can effectively place the resource index on the appropriate super node, which makes the resource index on the same super node similar. In solving the maximum transmission rate of streaming media, the mobile agent can effectively help the nodes with redundant upload bandwidth and those nodes with less upload bandwidth to establish connections and enhance the upload bandwidth obtained by the latter. Therefore, combining the advantages of mobile agent and P2P technology, we can improve the performance of distributed applications in some specific aspects.
【學(xué)位授予單位】：蘇州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 吳國(guó)福;竇強(qiáng);溫俊;宋磊;竇文華;;P2P流媒體系統(tǒng)最大數(shù)據(jù)傳輸速率研究[J];電子學(xué)報(bào);2012年03期

2 朱淼良,邱瑜;移動(dòng)代理系統(tǒng)綜述[J];計(jì)算機(jī)研究與發(fā)展;2001年01期

3 夏啟志;謝高崗;閔應(yīng)驊;李忠誠(chéng);;IS-P2P:一種基于索引的結(jié)構(gòu)化P2P網(wǎng)絡(luò)模型[J];計(jì)算機(jī)學(xué)報(bào);2006年04期

4 付志鵬;王懷民;史殿習(xí);鄒鵬;;對(duì)等網(wǎng)絡(luò)的抖動(dòng)特性研究綜述[J];計(jì)算機(jī)學(xué)報(bào);2011年09期

5 沈海飛;樊建席;劉文軍;王永偉;;多種資源下結(jié)構(gòu)化P2P網(wǎng)絡(luò)的負(fù)載均衡方法[J];計(jì)算機(jī)應(yīng)用研究;2013年12期

6 劉志忠;王懷民;周斌;;一種雙層P2P結(jié)構(gòu)的語(yǔ)義服務(wù)發(fā)現(xiàn)模型[J];軟件學(xué)報(bào);2007年08期

7 董健全,武雪麗,李智昕;P2P網(wǎng)絡(luò)中應(yīng)用移動(dòng)Agent進(jìn)行資源搜索的研究[J];計(jì)算機(jī)工程與設(shè)計(jì);2005年01期

8 明德廷;李娟;邱曉紅;楊s

本文編號(hào)：1679394