本文選題：P2P + 流量識(shí)別�。� 參考：《湖北工業(yè)大學(xué)》2014年碩士論文

【摘要】：由于互聯(lián)網(wǎng)本身是基于點(diǎn)到點(diǎn)的傳輸，使得P2P技術(shù)得到了廣泛地應(yīng)用與發(fā)展，給用戶帶來便捷的同時(shí)也給網(wǎng)絡(luò)質(zhì)量和網(wǎng)絡(luò)管理帶來了巨大的負(fù)面影響，如網(wǎng)絡(luò)擁堵、知識(shí)產(chǎn)權(quán)、資源管理以及安全隱患問題。P2P流量識(shí)別問題得到了越來越多的關(guān)注，，圍繞P2P識(shí)別問題產(chǎn)生了一批相關(guān)的算法。近年來研究與應(yīng)用最為廣泛的P2P流量識(shí)別方法之一是基于機(jī)器學(xué)習(xí)的識(shí)別方法。然而由于P2P網(wǎng)絡(luò)的突變性和不確定性，對(duì)于傳統(tǒng)的基于貝葉斯網(wǎng)絡(luò)，決策樹算法等機(jī)器學(xué)習(xí)方法而言，P2P流量識(shí)別變得更加困難。 支持向量機(jī)（Support Vector Machine，簡(jiǎn)稱SVM）作為目前性能良好且廣泛使用的分類器，它在克服“維數(shù)災(zāi)難”以及避免局部最優(yōu)解等流量識(shí)別問題上具有明顯的優(yōu)勢(shì)。然而在P2P流量識(shí)別問題中，支持向量機(jī)的性能受懲罰系數(shù)和核函數(shù)的參數(shù)的影響。常規(guī)的支持向量機(jī)參數(shù)求取方法性能需要進(jìn)一步加強(qiáng)。菌群優(yōu)化算法是近年來新提出的一種群體智能優(yōu)化算法，具有較強(qiáng)的尋優(yōu)能力。小波函數(shù)可以用來描述突變信號(hào)逐漸精細(xì)的特點(diǎn)，能夠在一定程度上處理突變的P2P網(wǎng)絡(luò)。因此本文重點(diǎn)研究菌群優(yōu)化算法和小波支持向量機(jī)在P2P流量識(shí)別問題中的應(yīng)用，本文的主要研究?jī)?nèi)容和工作如下： 1提出了一種結(jié)合菌群優(yōu)化算法和支持向量機(jī)的P2P流量識(shí)別方法。首先引入菌群優(yōu)化算法來優(yōu)化支持向量機(jī)的兩個(gè)參數(shù)，從而可以得到參數(shù)配置較優(yōu)的支持向量機(jī)；并將其應(yīng)用于P2P流量識(shí)別。通過與現(xiàn)有的基于遺傳算法優(yōu)化參數(shù)和基于粒子群算法優(yōu)化參數(shù)的支持向量機(jī)方法在實(shí)際的P2P流量識(shí)別問題中進(jìn)行性能對(duì)比測(cè)試，結(jié)果顯示基于菌群優(yōu)化算法所優(yōu)化的支持向量機(jī)在性能上更具優(yōu)勢(shì)。 2在優(yōu)化了支持向量機(jī)的參數(shù)以后，對(duì)配置不同核函數(shù)的支持向量機(jī)進(jìn)行P2P流量識(shí)別性能測(cè)試和分析。由于小波分析在局部分析和處理突變信號(hào)方面的優(yōu)越性，能很好地解決P2P網(wǎng)絡(luò)流量的突變性和不確定性，這里重點(diǎn)研究選擇合適的小波核函數(shù)來提高支持向量機(jī)的性能，通過對(duì)常用的核函數(shù)及多種小波核函數(shù)的對(duì)比實(shí)驗(yàn)，結(jié)果表明基于小波核函數(shù)和基于菌群優(yōu)化算法的SVM在P2P流量識(shí)別具有較高的識(shí)別精度與穩(wěn)定性。
[Abstract]:Since the Internet itself is based on point-to-point transmission, P2P technology has been widely used and developed, which brings convenience to users, but also brings huge negative effects to network quality and network management, such as network congestion, intellectual property rights.More and more attention has been paid to resource management and P2P traffic identification.In recent years, one of the most widely studied and applied P2P traffic identification methods is based on machine learning.However, due to the mutation and uncertainty of P2P network, it is more difficult for traditional machine learning methods based on Bayesian network and decision tree algorithm to identify P2P traffic.As a widely used classifier with good performance at present, support Vector Machine (SVM) has obvious advantages in overcoming "dimension disaster" and avoiding the problem of local optimal solution.However, in P2P traffic identification problem, the performance of SVM is affected by the penalty coefficient and the parameters of kernel function.The performance of the conventional support vector machine (SVM) parameter estimation method needs to be further enhanced.Bacterial colony optimization algorithm is a new swarm intelligence optimization algorithm proposed in recent years.Wavelet function can be used to describe the characteristics of the gradual refinement of abrupt signals and to deal with sudden changes in P2P networks to a certain extent.Therefore, this paper focuses on the application of microbial colony optimization algorithm and wavelet support vector machine in P2P traffic identification. The main contents and work of this paper are as follows:1. A P2P traffic identification method combined with microbial colony optimization algorithm and support vector machine is proposed.Firstly, the bacterial colony optimization algorithm is introduced to optimize the two parameters of support vector machine (SVM), so that the support vector machine with better parameter configuration can be obtained, and it is applied to P2P traffic identification.Compared with the existing support vector machine (SVM) based on genetic algorithm and particle swarm optimization parameters, the performance of P2P traffic identification problem is compared and tested.The results show that the support vector machine based on colony optimization algorithm has more advantages in performance.2 after optimizing the parameters of support vector machine, the P2P traffic identification performance of support vector machine with different kernel function is tested and analyzed.Due to the advantages of wavelet analysis in local analysis and processing of abrupt signals, the mutation and uncertainty of P2P network traffic can be solved well. This paper focuses on the selection of appropriate wavelet kernel functions to improve the performance of support vector machines.The comparative experiments of common nuclear function and several wavelet kernel functions show that SVM based on wavelet kernel function and bacterial colony optimization algorithm has high recognition accuracy and stability in P2P traffic identification.
【學(xué)位授予單位】：湖北工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP181;TP393.06

【參考文獻(xiàn)】

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

1 楊大煉;李學(xué)軍;蔣玲莉;;一種細(xì)菌覓食算法的改進(jìn)及其應(yīng)用[J];計(jì)算機(jī)工程與應(yīng)用;2012年13期

2 劉三民;孫知信;;P2P流量識(shí)別技術(shù)綜述[J];計(jì)算機(jī)科學(xué);2011年10期

3 盤善榮;傅明;史長(zhǎng)瓊;;支持向量機(jī)在P2P流量識(shí)別中的應(yīng)用[J];計(jì)算機(jī)工程與科學(xué);2010年02期

4 王逸欣;王銳;樊愛華;唐川;;P2P流量檢測(cè)技術(shù)初探[J];計(jì)算機(jī)與數(shù)字工程;2006年06期

5 楊萍;孫延明;劉小龍;車蘭秀;;基于細(xì)菌覓食趨化算子的PSO算法[J];計(jì)算機(jī)應(yīng)用研究;2011年10期

6 陳偉;蘭巨龍;張建輝;杜錫壽;;基于SVM概率輸出的P2P流媒體識(shí)別法[J];計(jì)算機(jī)科學(xué);2012年10期

7 魯剛;張宏莉;葉麟;;P2P流量識(shí)別[J];軟件學(xué)報(bào);2011年06期

8 劉文超;陳琳;向華;;P2P流量檢測(cè)技術(shù)與分析[J];現(xiàn)代電子技術(shù);2011年22期

9 馬溪原;吳耀文;方華亮;孫元章;;采用改進(jìn)細(xì)菌覓食算法的風(fēng)/光/儲(chǔ)混合微電網(wǎng)電源優(yōu)化配置[J];中國(guó)電機(jī)工程學(xué)報(bào);2011年25期

10 李宏達(dá);林嘉燕;;P2P流量識(shí)別技術(shù)研究[J];軟件工程師;2010年12期

本文編號(hào)：1750733