A Discrete Event Simulation of Fair Bandwidth Share Mechanism CHOKe-FS

Authors

  • Gamil Gardan Faculty of Computer Science and Information Technology Universiti Putra Malaysia, Serdang, Malaysia.
  • Rohaya Latip Faculty of Computer Science and Information Technology Universiti Putra Malaysia, Serdang, Malaysia. Institute for Mathematical Research, Universiti Putra Malaysia.

Keywords:

AQM, CHOKe-FS, CHOKe, Congestion Control, Discrete Event Simulation,

Abstract

CHOKe-FS is a partial state Active Queue Management (AQM) of fair bandwidth share mechanism among different flows in the same link. There is no public general programming language (GPL) available for this mechanism. This paper focused on the development of a Discrete Event Simulation (DES) for the proposed partial state Active Queue Management (CHOKe-FS) to simulate this mechanism with different simulation environment. CHOKe-FS uses RED algorithm probability to match the incoming packet with the selecting packets from the queue to decide either to drop packet or allow it to enter the queue. CHOKe-FS uses same CHOKe technique with three main differences. In this research, we focused on the development of discrete event simulator to implement one of active queue management mechanisms which is called CHOKe-FS and compare it with other three active queue management mechanisms which are called RED, CHOKe, CHOKeD. The results gained from this research showed that the developed simulators have produced almost the same results as previous simulators. CHOKe-FS, CHOKeD and CHOKe maintain fairness in the share link, identify and penalize non-responsive flows while RED fails.

Downloads

Download data is not yet available.

Downloads

Published

2017-09-15

How to Cite

Gardan, G., & Latip, R. (2017). A Discrete Event Simulation of Fair Bandwidth Share Mechanism CHOKe-FS. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-10), 139–144. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2726