AN EVENT DRIVEN SIMULATION FOR ADAPTIVE GENTLE RANDOM EARLY DETECTION (AGRED) ALGORITHM

Omid Seifaddini,Azizol Abdullah,Shamala Subramaniam

doi:10.3844/jcssp.2014.1939.1945

Abstract

Simulations are used to find optimum answers for pr oblems in wide areas. Active queue management algorithms such as RED, GRED, typically use simulators like ns2 which is an open source simulator or OPNET, OMNET which are commercial simulators. However, beside the benefits of using simulators like having defined modules, parameters. There are probl ems such as complexity, large integrated components and licensing cost. To have an ideal balance in men tioned benefits and problems and to further complement the repository of simulators, this study presents t he description of a general-purpose programming language based discrete event simulation for active queue ma nagement. This research has focused at developing a discrete event simulator to implement one of active queue management algorithms which is called AGRED. The results showed that the developed simulator has successfully produced the same results with an ave rage deviation of 1.5% as previous simulator in AGRED.

Highlights

Based on the (Abdel-Jaber et al, 2012; Mahmoud Baklizi and Abdel-Jaber, 2012; Reddy and Ahammed, 2008) and (Floyd and Jacobson, 1993) congestion is fundamental issue in computer networks
To have an ideal balance in mentioned benefits and problems and to further complement the repository of simulators, this study presents the description of a general-purpose programming language based discrete event simulation for active queue management
This research has focused at developing a discrete event simulator to implement one of active queue management algorithms which is called Adaptive Gentle Radom Early Detection (AGRED)

Summary

Introduction

Based on the (Abdel-Jaber et al, 2012; Mahmoud Baklizi and Abdel-Jaber, 2012; Reddy and Ahammed, 2008) and (Floyd and Jacobson, 1993) congestion is fundamental issue in computer networks. Different Active Queue Management (AQM) algorithms deal with the congestion in different ways such as Random Early Detection algorithm (RED) which is one of the most well known active queue management algorithms and was recommended by Internet Engineering Task Force IETF (Braden, 1988). RED was proposed to deal with the congestion but there were issues such as parameter setting which were stated in (Mahmoud Baklizi and Abdel-Jaber, 2012). Gentle Random Early Detection (GRED) was proposed (Floyd, 2000) to solve the primarily issues with RED. GRED was evaluated using the same simulation as used in RED

Results

Discussion

Conclusion