BitTorrent早期拒绝服务攻击的实验研究

Soufiane Rouibia, Jonathan Vayn, Olivier Beauvais, G. Urvoy-Keller
{"title":"BitTorrent早期拒绝服务攻击的实验研究","authors":"Soufiane Rouibia, Jonathan Vayn, Olivier Beauvais, G. Urvoy-Keller","doi":"10.1109/WETICE.2008.35","DOIUrl":null,"url":null,"abstract":"BitTorrent is a popular p2p file replication application, which aims at replicating a given content as fast as possible on a set of peers. The algorithms of BitTorrent used to elect remote peers with whom a peer collaborates and also which pieces of the content it offers, have proved to be highly efficient. This means that a high level of parallelism is achieved among the peers as a given peer always has a high chance to find another peer that holds content it is currently missing. Still, at the beginning of a BitTorrent session, pieces of the content have to be obtained from only a few peers (in general a single one called the initial seed) that hold a full copy of the file to be replicated. In this work, we aim at evaluating the ability of a BitTorrent session to survive to a denial of service attack that would disconnect the initial seed from the network. We address this issue through experimentation. Our main conclusion is that BitTorrent is highly resilient to this attack as neither the ability to obtain a full copy of the content nor the actual replication speed are affected by the disconnection of the initial seed if the attack is not carried out at the very early stage of the session.","PeriodicalId":259447,"journal":{"name":"2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Early Stage Denial of Service Attacks in BitTorrent: An Experimental Study\",\"authors\":\"Soufiane Rouibia, Jonathan Vayn, Olivier Beauvais, G. Urvoy-Keller\",\"doi\":\"10.1109/WETICE.2008.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"BitTorrent is a popular p2p file replication application, which aims at replicating a given content as fast as possible on a set of peers. The algorithms of BitTorrent used to elect remote peers with whom a peer collaborates and also which pieces of the content it offers, have proved to be highly efficient. This means that a high level of parallelism is achieved among the peers as a given peer always has a high chance to find another peer that holds content it is currently missing. Still, at the beginning of a BitTorrent session, pieces of the content have to be obtained from only a few peers (in general a single one called the initial seed) that hold a full copy of the file to be replicated. In this work, we aim at evaluating the ability of a BitTorrent session to survive to a denial of service attack that would disconnect the initial seed from the network. We address this issue through experimentation. Our main conclusion is that BitTorrent is highly resilient to this attack as neither the ability to obtain a full copy of the content nor the actual replication speed are affected by the disconnection of the initial seed if the attack is not carried out at the very early stage of the session.\",\"PeriodicalId\":259447,\"journal\":{\"name\":\"2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WETICE.2008.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 17th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WETICE.2008.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

BitTorrent是一个流行的p2p文件复制应用程序,其目的是在一组对等节点上尽可能快地复制给定的内容。BitTorrent的算法被证明是非常高效的,该算法用于选择与某个对等体合作的远程对等体以及它提供的内容片段。这意味着在对等点之间实现了高水平的并行性,因为给定的对等点总是有很高的机会找到另一个拥有当前丢失内容的对等点。尽管如此,在BitTorrent会话开始时,内容片段只能从少数几个节点(通常是一个称为初始种子的节点)获得,这些节点拥有待复制文件的完整副本。在这项工作中,我们的目标是评估BitTorrent会话在拒绝服务攻击中存活的能力,拒绝服务攻击会断开初始种子与网络的连接。我们通过实验来解决这个问题。我们的主要结论是,BitTorrent对这种攻击具有高度的弹性,因为如果攻击不在会话的早期阶段进行,那么获得内容的完整副本的能力和实际复制速度都不会受到初始种子断开连接的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Early Stage Denial of Service Attacks in BitTorrent: An Experimental Study
BitTorrent is a popular p2p file replication application, which aims at replicating a given content as fast as possible on a set of peers. The algorithms of BitTorrent used to elect remote peers with whom a peer collaborates and also which pieces of the content it offers, have proved to be highly efficient. This means that a high level of parallelism is achieved among the peers as a given peer always has a high chance to find another peer that holds content it is currently missing. Still, at the beginning of a BitTorrent session, pieces of the content have to be obtained from only a few peers (in general a single one called the initial seed) that hold a full copy of the file to be replicated. In this work, we aim at evaluating the ability of a BitTorrent session to survive to a denial of service attack that would disconnect the initial seed from the network. We address this issue through experimentation. Our main conclusion is that BitTorrent is highly resilient to this attack as neither the ability to obtain a full copy of the content nor the actual replication speed are affected by the disconnection of the initial seed if the attack is not carried out at the very early stage of the session.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GRIPLAB 1.0: Grid Image Processing Laboratory for Distributed Machine Vision Applications Adaptive Process Management. Issues and (Some) Solutions A Sybil-Resistant Admission Control Coupling SybilGuard with Distributed Certification Cooperative Behavior of Artificial Neural Agents Based on Evolutionary Architectures An Agent-Based Approach for Composition of Semantic Web Services
×
引用
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