Analysis of priority queue-based scheme to alleviate malicious flows from distributed dos attacks

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we focus on defending the DDoS attacks since they have caused many famous websites enormous losses in recent years. We propose a Priority Queue-Based scheme to analyze the interval of arrival time of the incoming packet to distinguish malicious traffic from normal traffic and to take care of malicious attacks clogging the network. We use the network simulator, NS2, to evaluate the effectiveness of the proposed scheme. The proposed Priority Queue-based scheme not only effectively decreases the flows of malicious packets from DDoS attacks with various packet rates, but also provides smooth and constant flows for packets sent by normal users. Furthermore, our priority queue-based scheme performs much better than other schemes when the number of the DDoS nodes becomes large. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lin, C. H., Liu, J. C., Kuo, C. T., & Lo, C. (2009). Analysis of priority queue-based scheme to alleviate malicious flows from distributed dos attacks. In Communications in Computer and Information Science (Vol. 56, pp. 301–307). https://doi.org/10.1007/978-3-642-10844-0_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free