CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
Reseach Article

Evolution and Optimization of Active Queue Management Algorithms over High Bandwidth Aggregates

by Saurabh Sarkar, Geeta Sikka, Ashish Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 12
Year of Publication: 2012
Authors: Saurabh Sarkar, Geeta Sikka, Ashish Kumar
10.5120/7399-0210

Saurabh Sarkar, Geeta Sikka, Ashish Kumar . Evolution and Optimization of Active Queue Management Algorithms over High Bandwidth Aggregates. International Journal of Computer Applications. 48, 12 ( June 2012), 11-16. DOI=10.5120/7399-0210

@article{ 10.5120/7399-0210,
author = { Saurabh Sarkar, Geeta Sikka, Ashish Kumar },
title = { Evolution and Optimization of Active Queue Management Algorithms over High Bandwidth Aggregates },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 12 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 11-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number12/7399-0210/ },
doi = { 10.5120/7399-0210 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:43:53.095889+05:30
%A Saurabh Sarkar
%A Geeta Sikka
%A Ashish Kumar
%T Evolution and Optimization of Active Queue Management Algorithms over High Bandwidth Aggregates
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 12
%P 11-16
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Due to enormous growth of the Internet, demands for access from multiple users and request for new services for its applications have also increased significantly. In a result there is a rise in packet loss rates and drop in network efficiency. In addition, the inability to support new services has severely hindered the widespread deployment of bandwidth-sensitive applications. So the success of TCP / IP depends on its ability to deliver services in time of extremely high demand and hence various congestion control mechanisms ensure this ability to prosper. The idea behind TCP congestion control is to control network load by having sources adjust their rates according to the level of congestion in the network. This paper focuses on how congestion control and queue management techniques have evolved in due course of time and being modified to minimize the rate of packet loss. Considering RED being most important of all we have optimized the algorithm by challenging the linearity of marking/dropping probability. We conduct a survey by applying different possible functions in contrary to the linear behavior of dropping probability for evaluating their performance in comparison to RED. We implement the optimized RED by simulating a multicast network for TCP flows.

References
  1. "Improving Internet Congestion Control and Queue Management Algorithms" by Wu-chang Feng. A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science and Engineering) in The University of Michigan, 1999.
  2. S. Dijkstra, Modeling active queue management algorithms using stochastic Petri nets, Master's Thesis, University of Twente, 2004.
  3. Lau, F. ; Rubin, S. H. ; Smith, M. H. ; Trajkovic, L. ; , "Distributed denial of service attacks," Systems, Man, and Cybernetics, 2000 IEEE International Conference, vol. 3, no. , pp. 2275-2280 vol. 3, 2000.
  4. Shu-Gang Liu; , "Simulation and evaluation of random early detection in congestion control," Machine Learning and Cybernetics, 2008 International Conference, vol. 4, no. , pp. 2363-2368, 12-15 July 2008.
  5. Chengyu Zhu; Yang, O. W. W. ; Aweya, J. ; Ouellette, M. ; Montuno, D. Y. ; "A comparison of active queue management algorithms using the OPNET Modeler," Communications Magazine, IEEE, vol. 40, no. 6, pp. 158-167, June 2002.
  6. CDouligeris, C. ; Mitrokotsa, A. ; "DDoS attacks and defense mechanisms: a classification," Signal Processing and Information Technology, 2003. ISSPIT 2003. Proceedings of the 3rd IEEE International Symposium, vol. , no. , pp. 190- 193, 14-17 Dec. 2003. Brown, L. D. , Hua, H. , and Gao, C. 2003.
  7. Stephen Specht & Ruby Lee; "Taxonomies of Distributed Denial of Service Networks, Attacks, Tools, and Countermeasures"; May 2003.
  8. Changwang Zhang; Jianping Yin; Zhiping Cai; Weifeng Chen; , "RRED: robust RED algorithm to counter low-rate denial-of-service attacks," Communications Letters, IEEE , vol. 14, no. 5, pp. 489-491, May 2010.
  9. Jae Chung; Claypool, M. ; "Analysis of active queue management," Network Computing and Applications, 2003. NCA 2003. Second IEEE International Symposium, vol. , no. , pp. 359- 366, 16-18 April 2003.
  10. "Problem on modification of RED" by Richard T. B. Ma an Assistant Professor in School of Computing, National University of Singapore.
Index Terms

Computer Science
Information Sciences

Keywords

Aqm Red Drop Probability Simulations Ns2