基于流量和等级相关性的分布式反射拒绝服务攻击检测

P. Revathi
{"title":"基于流量和等级相关性的分布式反射拒绝服务攻击检测","authors":"P. Revathi","doi":"10.1109/ICRTIT.2014.6996117","DOIUrl":null,"url":null,"abstract":"Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Flow and rank correlation based detection against Distributed Reflection Denial of Service attack\",\"authors\":\"P. Revathi\",\"doi\":\"10.1109/ICRTIT.2014.6996117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.\",\"PeriodicalId\":422275,\"journal\":{\"name\":\"2014 International Conference on Recent Trends in Information Technology\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Recent Trends in Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2014.6996117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Recent Trends in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2014.6996117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

计算领域的拒绝服务攻击涉及到对特定用户的资源阻塞。这种屏蔽可以是对网络中访问web服务器的临时屏蔽或无限期屏蔽。这种攻击通常是由受害的web服务器完成的。分布式拒绝服务攻击是由两个以上的web服务器提供的。涌入受害web服务器的大量网络流迫使其关闭。虽然攻击的单个互联网数据包可能完全没有危险,但这种类型的数据包的洪水可以压倒受害者服务器的互联网连接或网络中的其他数据包处理资源。其结果是,有效流量无法与恶意流量竞争,几乎没有机会为合法用户提供有用的服务。本文主要研究基于流量和等级相关的算法(FRCD)。通过秩相关,我们可以检查网络中是否存在攻击。有了这个作为基础,我们可以计算流量相关性来检查这个攻击是否合法。该系统效率高,是一种协议无关的方法。所涉及的计算成本不会影响网络的吞吐量,从而增加了分布式反射拒绝服务攻击检测的可能性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flow and rank correlation based detection against Distributed Reflection Denial of Service attack
Denial of service attack in computing involves blocking of resources to particular user. This kind of blocking may be temporary or indefinite blocking to access web server in the network. This attack is usually done by a victim web server. Distributed denial of service attacks is given by more than two web servers. The flood of incoming network flows to the victim web server forces it to shut down. Although the attack's individual internet packets may be completely not dangerous and flood of such type of packets can overwhelm the victim server's internet connection or other packet-processing resources in the network. The result is that valid traffic, unable to compete with malicious flood, has little chance for obtaining useful service to legitimate users. This paper mainly concentrates on flow and rank correlation based algorithm (FRCD). With rank correlation we can check if there is any attack in the network or not. And having this as the base we could calculate flow correlation to check if this attack is legitimate or not. The proposed system is highly efficient and is a protocol independent method. The computational cost involved does not affect the network's throughput thereby increasing the possibilities of Distributed Reflection Denial of Service attack detection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信