作　　者： ; ;

机构地区： 中山大学信息科学与技术学院电子与通信工程系

出　　处： 《计算机科学》 2011年第3期80-82,86,共4页

摘　　要： 随着网络的高速发展以及各种应用的不断涌现,采用端口号映射或有效负载分析的方法进行流量分类与应用识别已难以满足应用的需求。以流为网络节点、流之间统计特征的相似度为边,构建流相关网络模型,利用New-man快速社团划分算法(NFCD)对流相关网络模型进行社团划分,得到了流的聚类结果,实现了网络流量的分类,并与先前的两种无监督的流量分类算法(K-Means,DBSCAN)进行了对比。实验结果显示,利用NFCD算法具有更高的准确率,并能产生更好的聚类效果,且不受输入参数影响。 In recent years,Internet traffic classification using port-based or payload-based methods is becoming increa-singly difficult with peer-to-peer（P2P） applications using dynamic port numbers,masquerading techniques,and encryption to avoid detection.Because supervised clustering algorithm needs accuracy of training sets and it can not classify unknown application,we introduced complex network＇s community detecting algorithm,a new unsupervised classify algorithm,which has previously not been used for network traffic classification.We evaluated this algorithm and compared it with the previously used unsupervised K-means and DBSCAN algorithm,using empirical Internet traces.The experiment results show complex network＇s community detecting algorithm works very well in accuracy and produces better clusters,besides,complex network＇s community detecting algorithm need not know the number of the traffic application beforehand.

关 键 词： 流量分类 无监督聚类 社团划分 复杂网络

领　　域： [电子电信] [电子电信]