Most Wanted Internet Applications: A Framework for P2P Identification

Guthemberg Silvestre, S. Fernandes, C. Kamienski, D. Sadok
{"title":"Most Wanted Internet Applications: A Framework for P2P Identification","authors":"Guthemberg Silvestre, S. Fernandes, C. Kamienski, D. Sadok","doi":"10.1109/CNSR.2010.64","DOIUrl":null,"url":null,"abstract":"For almost a decade, Peer-to-Peer (P2P) traffic have been putting pressure on network operators. Taking actions to control P2P traffic is a daunting task. In this paper, we present a comprehensive framework for the identification of P2P traffic based on information-theoretic techniques. Despite the inherent difficulty to single out such applications, our methodology is able to successfully identify P2P traffic using a set of communication patterns or profiles. We show that profiles built on the observation of traffic volume are more accurate than those using the number of flows.","PeriodicalId":208564,"journal":{"name":"2010 8th Annual Communication Networks and Services Research Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 8th Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2010.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

For almost a decade, Peer-to-Peer (P2P) traffic have been putting pressure on network operators. Taking actions to control P2P traffic is a daunting task. In this paper, we present a comprehensive framework for the identification of P2P traffic based on information-theoretic techniques. Despite the inherent difficulty to single out such applications, our methodology is able to successfully identify P2P traffic using a set of communication patterns or profiles. We show that profiles built on the observation of traffic volume are more accurate than those using the number of flows.
最受欢迎的互联网应用:一个P2P识别框架
近十年来,点对点(P2P)流量一直给网络运营商带来压力。采取措施控制P2P流量是一项艰巨的任务。在本文中,我们提出了一个基于信息论技术的P2P流量识别的综合框架。尽管挑出这样的应用程序存在固有的困难,但我们的方法能够使用一组通信模式或配置文件成功地识别P2P流量。我们表明,建立在交通量上的轮廓比使用流量的轮廓更准确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信