Peer to peer traffic identification using support vector machine and bat-inspired optimization algorithm

Liu Chuan, Chunzhi Wang, Jixiong Hu, Z. Ye
{"title":"Peer to peer traffic identification using support vector machine and bat-inspired optimization algorithm","authors":"Liu Chuan, Chunzhi Wang, Jixiong Hu, Z. Ye","doi":"10.1109/ICCSE.2017.8085541","DOIUrl":null,"url":null,"abstract":"Nowadays, Peer-to-Peer computing technology (P2P) is widely used on Internet, which has brought great challenges to effective management of the network. As a result, it is very important to recognize P2P applications as to maintain network. In essence, to identify traffic of P2P is a problem belongs to pattern recognition. As one of the optimal classifiers, support vector machine (SVM) has special advantages with avoiding local optimum, overcoming dimension disaster, resolving small samples and high dimension for P2P classification problems. However, the performance of SVM is largely dependent on its parameters and the traditional tuning methods are inefficient. Therefore, in the paper the bat algorithm is proposed to seek the optimal parameters for SVM. In the end, experimental results display that the proposed method outperforms SVM optimized by genetic algorithm, particle swarm optimization algorithm, which can effectively improve the accuracy of P2P network traffic identification.","PeriodicalId":256055,"journal":{"name":"2017 12th International Conference on Computer Science and Education (ICCSE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Computer Science and Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE.2017.8085541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nowadays, Peer-to-Peer computing technology (P2P) is widely used on Internet, which has brought great challenges to effective management of the network. As a result, it is very important to recognize P2P applications as to maintain network. In essence, to identify traffic of P2P is a problem belongs to pattern recognition. As one of the optimal classifiers, support vector machine (SVM) has special advantages with avoiding local optimum, overcoming dimension disaster, resolving small samples and high dimension for P2P classification problems. However, the performance of SVM is largely dependent on its parameters and the traditional tuning methods are inefficient. Therefore, in the paper the bat algorithm is proposed to seek the optimal parameters for SVM. In the end, experimental results display that the proposed method outperforms SVM optimized by genetic algorithm, particle swarm optimization algorithm, which can effectively improve the accuracy of P2P network traffic identification.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
点对点流量识别采用支持向量机和蝙蝠启发优化算法
目前,点对点计算技术(P2P)在Internet上的广泛应用,给网络的有效管理带来了巨大的挑战。因此,认识到P2P应用对网络的维护作用是非常重要的。从本质上讲,P2P流量识别是一个属于模式识别的问题。支持向量机(SVM)作为最优分类器之一,在避免局部最优、克服维数灾难、解决P2P分类问题的小样本和高维数等方面具有独特的优势。然而,支持向量机的性能在很大程度上依赖于其参数,传统的调优方法效率低下。因此,本文提出了用bat算法来寻求支持向量机的最优参数。最后,实验结果表明,该方法优于遗传算法、粒子群优化算法优化的SVM,能够有效提高P2P网络流量识别的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A unified approach to automate the usage of plagiarism detection tools in programming courses Software verification of Orion cockpit displays Wine quality identification based on data mining research A comparison of inertial-based navigation algorithms for a low-cost indoor mobile robot A HCI design for developing touch-operation-based DGS: What you think is what you get
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1