【摘要】：P2P (Peer-to-Peer Network)網(wǎng)絡(luò)是構(gòu)建在底層物理網(wǎng)絡(luò)之上的邏輯覆蓋網(wǎng)絡(luò),具有網(wǎng)絡(luò)節(jié)點(diǎn)非中心化、高可擴(kuò)展性、強(qiáng)健壯性、高性價(jià)比、負(fù)載均衡等多種特性。隨著Internet的普及、網(wǎng)絡(luò)接入帶寬的增大以及端系統(tǒng)計(jì)算能力的迅速增強(qiáng),P2P端到端通信模式已經(jīng)逐漸發(fā)展成為IT行業(yè)和學(xué)術(shù)界應(yīng)用和研究的熱點(diǎn)。目前P2P技術(shù)在內(nèi)容分發(fā)、流媒體、分布式存儲(chǔ)、并行計(jì)算、云存儲(chǔ)以及即時(shí)通訊等領(lǐng)域均有廣泛應(yīng)用,根據(jù)調(diào)查顯示,國(guó)內(nèi)主要運(yùn)營(yíng)商骨干網(wǎng)流量中P2P流量已達(dá)到了60%以上,成為因特網(wǎng)上的主要流量。 然而多數(shù)P2P應(yīng)用采取的隨機(jī)鄰居節(jié)點(diǎn)選取策略忽略了底層物理網(wǎng)絡(luò)的信息,導(dǎo)致邏輯網(wǎng)絡(luò)與物理網(wǎng)絡(luò)嚴(yán)重失配,產(chǎn)生大量冗余跨域流量,加重了因特網(wǎng)服務(wù)提供商(ISP, Internet Service Provider)的流量壓力并破壞了ISP收支平衡,同時(shí)P2P應(yīng)用擠占帶寬的局面對(duì)其他帶寬敏感型應(yīng)用也造成了不良影響。如何減少域間冗余流量,即對(duì)P2P流量進(jìn)行優(yōu)化,成為ISP以及P2P內(nèi)容提供商共同關(guān)注的熱點(diǎn)問(wèn)題。目前一些P2P流量?jī)?yōu)化方法根據(jù)時(shí)延、帶寬、AS距離等信息估計(jì)節(jié)點(diǎn)間網(wǎng)絡(luò)距離,優(yōu)先選取“鄰近“節(jié)點(diǎn)作為鄰居,然而這些方法大多選取單一因素進(jìn)行網(wǎng)絡(luò)距離度量,在復(fù)雜的因特網(wǎng)背景下這種方式無(wú)法保證有效性。 本文提出了一種基于模糊綜合評(píng)價(jià)的P2P流量?jī)?yōu)化方法,當(dāng)某個(gè)P2P節(jié)點(diǎn)進(jìn)行鄰居節(jié)點(diǎn)選擇時(shí)綜合考慮時(shí)延、帶寬、AS距離、鏈路代價(jià)、文件差異程度等多種因素對(duì)所有節(jié)點(diǎn)進(jìn)行評(píng)價(jià)并排序,從中選取評(píng)價(jià)結(jié)果較高的P2P節(jié)點(diǎn)作為該節(jié)點(diǎn)的鄰居節(jié)點(diǎn),據(jù)此構(gòu)建邏輯覆蓋網(wǎng)絡(luò)。該方法采用結(jié)合粒子群算法(PSO, Particle Swarm Optimization)的改進(jìn)層次分析法(AHP, Analytic Hierarchy Process)確定各因素權(quán)重,同時(shí)驗(yàn)證和修正一致性判斷矩陣。本文還對(duì)提出的優(yōu)化方法進(jìn)行了網(wǎng)絡(luò)模擬實(shí)驗(yàn),分析結(jié)果表明該算法能夠大幅度本地化P2P流量并且一定程度上加速文件下載,保證P2P應(yīng)用性能不下降的同時(shí)進(jìn)一步優(yōu)化P2P流量。
[Abstract]:P2P (Peer-to-Peer Network) network is a logical overlay network built on the underlying physical network. It has many characteristics, such as non-centralization of network nodes, high scalability, strong robustness, high performance-to-price ratio, load balancing and so on. With the popularity of Internet, the increase of network access bandwidth and the rapid enhancement of end-to-end computing power, P2P end-to-end communication mode has gradually developed into a hot spot in the application and research of IT industry and academia. At present, P2P technology is widely used in the fields of content distribution, streaming media, distributed storage, parallel computing, cloud storage and instant messaging. According to the survey, P2P traffic in the backbone network of major domestic operators has reached more than 60%. Become the main traffic on the Internet. However, the random neighbor node selection strategy adopted by most P2P applications ignores the information of the underlying physical network, resulting in a serious mismatch between the logical network and the physical network, resulting in a large number of redundant cross-domain traffic, and exacerbating the Internet service provider (ISP,). Internet Service Provider) traffic pressure and break the balance of ISP revenue and expenditure, while P2P applications of bandwidth crowding out of other bandwidth sensitive applications also have a negative impact on other applications. How to reduce redundant inter-domain traffic, that is, to optimize P2P traffic, has become a hot issue for ISP and P2P content providers. At present, some P2P traffic optimization methods estimate the network distance between nodes according to the information of delay, bandwidth, AS distance, and select "adjacent" nodes as neighbors first. However, most of these methods choose a single factor to measure the network distance. This approach does not guarantee effectiveness in a complex Internet context. In this paper, a P2P traffic optimization method based on fuzzy comprehensive evaluation is proposed. When a P2P node selects a neighbor node, time delay, bandwidth, AS distance, link cost are taken into account. All nodes are evaluated and sorted by many factors such as file difference degree and so on. P2P nodes with higher evaluation results are selected as neighbor nodes of this node and the logical overlay network is constructed according to these factors. In this method, the weight of each factor is determined by the improved Analytic hierarchy process (AHP, Analytic Hierarchy Process) combined with particle swarm optimization (PSO, Particle Swarm Optimization), and the consistency judgment matrix is verified and amended. The results show that the proposed algorithm can localize P2P traffic greatly and accelerate file download to a certain extent so as to ensure that P2P application performance does not deteriorate and optimize P2P traffic further.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02;TP393.06

【參考文獻(xiàn)】

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

1 王靖,張金鎖;綜合評(píng)價(jià)中確定權(quán)重向量的幾種方法比較[J];河北工業(yè)大學(xué)學(xué)報(bào);2001年02期

2 張聯(lián)峰,劉乃安,錢秀檳,張玉清;綜述:對(duì)等網(wǎng)(P2P)技術(shù)[J];計(jì)算機(jī)工程與應(yīng)用;2003年12期

3 張翔;李綱;熊偉清;;基于粒子群算法的判斷矩陣一致性修正[J];計(jì)算機(jī)工程與應(yīng)用;2010年36期

4 陳光喜;李振興;劉卓軍;;基于改進(jìn)粒子群算法的P2P流媒體數(shù)據(jù)調(diào)度策略[J];計(jì)算機(jī)應(yīng)用;2013年04期

5 張國(guó)強(qiáng);唐明董;程蘇琦;張國(guó)清;宋海濱;曹薊光;楊景;;P2P流量?jī)?yōu)化[J];中國(guó)科學(xué):信息科學(xué);2012年01期

6 金菊良,魏一鳴,丁晶;基于改進(jìn)層次分析法的模糊綜合評(píng)價(jià)模型[J];水利學(xué)報(bào);2004年03期

7 彭補(bǔ)拙，竇貽儉，，張燕;用動(dòng)態(tài)的觀點(diǎn)進(jìn)行環(huán)境綜合質(zhì)量評(píng)價(jià)[J];中國(guó)環(huán)境科學(xué);1996年01期

本文編號(hào)：2302260