Detection of Distributed Reflection DoS by using Rank Correlation?
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 8)Publication Date: 2014-08-30
Authors : Preeti Goyal; Sangeeta Malik;
Page : 85-92
Keywords : DRDoS; Spearman’s Rho; Rank Correlation;
Abstract
Information technology has widened itself over the last two decades and has become the axis of today’s global development, but this development also faces many problems among which DoS is one of the big problem. DoS presents a great threat to internet as an attacker sends a lots of requests to the victim, Such that the victim will not be able to entertain the legitimate user and the next stage of this problem is Distributed Reflection DoS in which many attacker sends the request to a server which sends these request with multiple reflection to the victim because of so many request the victim face the severe problem. There are many protocol based Algorithm to detect this problem but they are not efficient and have high cost. Here we have introduced an algorithm i.e. Rank Correlation Detection Algorithm which will detect the malicious node among the legitimate nodes so that node can be removed from the path of transfer of the data packs.
Other Latest Articles
- Map Matching Algorithms in GPS Navigating System and Their Functions
- FoCUS ? Forum Crawler Under Supervision?
- Automated Window 8 Security and Safety System?
- THE PRACTICE OF FRENCH JUSTICE ARTICLE 228 OF THE UN CONVENTION ON THE LAW OF THE SEA
- IMPLEMENTATION OF THE PUBLIC-PRIVATE PARTNERSHIP IN THE FIELD OF PRODUCTION AND CONSUMPTION WASTE IN CONSTITUENT AND MUNICIPAL ENTITIES OF THE RUSSIAN FEDERATION
Last modified: 2014-08-10 22:02:18