HMC:一种识别加密P2P雷电流量的新机制

Chenglong Li, Y. Xue, Yingfei Dong, Dongsheng Wang
{"title":"HMC:一种识别加密P2P雷电流量的新机制","authors":"Chenglong Li, Y. Xue, Yingfei Dong, Dongsheng Wang","doi":"10.1109/GLOCOM.2010.5683651","DOIUrl":null,"url":null,"abstract":"Thunder (also called Xunlei) is the most popular P2P file sharing application in China and probably the most popular P2P software in term of traffic volume and number of users. Precisely identifying Thunder traffic can help network administrators to efficiently manage their networks. Traditional methods of identifying P2P traffic such as port-based or content-based approaches are ineffective to Thunder traffic, because of its dynamic packet format, flexible port numbers, and payload encryption. In this paper, we developed a novel Heuristic Message Clustering approach (HMC) to identify Thunder traffic, and obtain its state machine and key transaction cycles, thus identifying Thunder traffic fast and accurately. We first evaluate our method in a controlled environment and then with real campus traces. The results show that HMC is able to identify Thunder flows with high precision and low error rate.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"17 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"HMC: A Novel Mechanism for Identifying Encrypted P2P Thunder Traffic\",\"authors\":\"Chenglong Li, Y. Xue, Yingfei Dong, Dongsheng Wang\",\"doi\":\"10.1109/GLOCOM.2010.5683651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Thunder (also called Xunlei) is the most popular P2P file sharing application in China and probably the most popular P2P software in term of traffic volume and number of users. Precisely identifying Thunder traffic can help network administrators to efficiently manage their networks. Traditional methods of identifying P2P traffic such as port-based or content-based approaches are ineffective to Thunder traffic, because of its dynamic packet format, flexible port numbers, and payload encryption. In this paper, we developed a novel Heuristic Message Clustering approach (HMC) to identify Thunder traffic, and obtain its state machine and key transaction cycles, thus identifying Thunder traffic fast and accurately. We first evaluate our method in a controlled environment and then with real campus traces. The results show that HMC is able to identify Thunder flows with high precision and low error rate.\",\"PeriodicalId\":6448,\"journal\":{\"name\":\"2010 IEEE Global Telecommunications Conference GLOBECOM 2010\",\"volume\":\"17 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Global Telecommunications Conference GLOBECOM 2010\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2010.5683651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5683651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

迅雷(也叫迅雷)是中国最流行的P2P文件共享应用程序,在流量和用户数量方面可能是最流行的P2P软件。准确识别迅雷流量可以帮助网络管理员有效地管理网络。传统的识别P2P流量的方法,如基于端口或基于内容的方法,对Thunder流量无效,因为它具有动态数据包格式、灵活的端口号和有效载荷加密。本文提出了一种新的启发式消息聚类方法(HMC)来识别迅雷流量,并获得其状态机和密钥交易周期,从而快速准确地识别迅雷流量。我们首先在受控环境中评估我们的方法,然后在真实的校园痕迹中进行评估。结果表明,该方法能够以较高的精度和较低的错误率识别雷电流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HMC: A Novel Mechanism for Identifying Encrypted P2P Thunder Traffic
Thunder (also called Xunlei) is the most popular P2P file sharing application in China and probably the most popular P2P software in term of traffic volume and number of users. Precisely identifying Thunder traffic can help network administrators to efficiently manage their networks. Traditional methods of identifying P2P traffic such as port-based or content-based approaches are ineffective to Thunder traffic, because of its dynamic packet format, flexible port numbers, and payload encryption. In this paper, we developed a novel Heuristic Message Clustering approach (HMC) to identify Thunder traffic, and obtain its state machine and key transaction cycles, thus identifying Thunder traffic fast and accurately. We first evaluate our method in a controlled environment and then with real campus traces. The results show that HMC is able to identify Thunder flows with high precision and low error rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信