Abstract
Distributed Denial of Service (DDoS) attack is one of the biggest threats now days. This paper aims at providing the simulation results of buffer size and attack intensities effects on various queuing algorithms such as Drop Tail, Fair Queuing (FQ), Stochastic Fair Queuing (SFQ), Deficit Round Robin (DRR) and Random Early Detection (RED) using ns-2 as a simulation environment. The results in this paper indicate that Stochastic Fair Queuing is the best algorithms in terms of providing maximum bandwidth to legitimate users against various attack intensities. It is also cleared from simulation results that there is no effect of variation in buffer size on queuing algorithms such as Fair Queuing, Stochastic Fair Queuing and Deficit Round Robin while DropTail and Random Early Detection algorithms are giving the best performance on buffer size 60 against various attack intensities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Specht, S.M., Lee, R.B.: Distributed Denial of Service: Taxonomies of Attacks, Tools, and Countermeasures. In: Proceedings of the 17th International Conference on Parallel and Distributed Computing Systems (2004)
Mirkovic, J., Dietrich, S., Dittrich, D., Reither, P.: Internet Denial of Service: Attack and Defense Mechanisms. Prentice Hall PTR (2004)
Weiler, N.: Honeypots for Distributed Denial of Service Attacks. In: Proceedings of the Eleventh IEEE International Workshops on Enabling Technologies (2002)
Queuing Disciplines, http://nms.csail.mit.edu/6.829-f06/lectures/bruce-queue.pdf
Shreedhar, M., Varghese, G.: Efficient Fair Queuing using Deficit Round Robin. IEEE/ACM Transactions on Networking 4(3), 375–385 (1996)
Semiria, C.: Supporting Differentiated Service Classes: Queue Scheduling Disciplines. Juniper Networks, Inc.
Zhang, C., Yin, J., Cai, Z., Chen, W.: RRED: Robust RED Algorithm to Counter Low-Rate Denial-of-Service Attacks. IEEE Communications Letters 14, 489–491 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhandari, A., Sangal, A.L., Saluja, K.K. (2012). Queuing Algorithms Performance against Buffer Size and Attack Intensities in DDOS Attacks. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-29280-4_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29279-8
Online ISBN: 978-3-642-29280-4
eBook Packages: Computer ScienceComputer Science (R0)