CFP last date
20 January 2025
Reseach Article

Performance Evaluation of Controlling High Bandwidth Flows by RED-PD

by Osama Ahmed Bashir, Md Asri Bin Ngadi, Yahia Abdalla Mohamed, Mohamed Awad
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 13
Year of Publication: 2013
Authors: Osama Ahmed Bashir, Md Asri Bin Ngadi, Yahia Abdalla Mohamed, Mohamed Awad
10.5120/11456-7061

Osama Ahmed Bashir, Md Asri Bin Ngadi, Yahia Abdalla Mohamed, Mohamed Awad . Performance Evaluation of Controlling High Bandwidth Flows by RED-PD. International Journal of Computer Applications. 67, 13 ( April 2013), 19-23. DOI=10.5120/11456-7061

@article{ 10.5120/11456-7061,
author = { Osama Ahmed Bashir, Md Asri Bin Ngadi, Yahia Abdalla Mohamed, Mohamed Awad },
title = { Performance Evaluation of Controlling High Bandwidth Flows by RED-PD },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 13 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 19-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number13/11456-7061/ },
doi = { 10.5120/11456-7061 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:24:44.171758+05:30
%A Osama Ahmed Bashir
%A Md Asri Bin Ngadi
%A Yahia Abdalla Mohamed
%A Mohamed Awad
%T Performance Evaluation of Controlling High Bandwidth Flows by RED-PD
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 13
%P 19-23
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper proposed to investigate and evaluate the performance of one of the algorithm used to provide fair bandwidth allocation to the flows. First In First Out (FIFO) queuing is simple but does not protect responsive flows from unresponsive one, flows that are sending more than their fair share. One of FIFO queuing is Random Early Detection which it can effectively avoid congestion at routers, but it also cannot provide fair bandwidth for the flows. On the other hand, per-?ow scheduling mechanisms provide max-min fairness but are more complex, it requires keeping state for all ?ows going through the router; it's proved that high bandwidth ?ows at the time of congestion consume most of the bandwidth of the link, so this algorithm (RED-PD) is most candidates to provide fairness to the flows. Simulations with networks demonstrate that there are chances for RED-PD to enhance its work, by means of incorporating the test of unresponsive flows actively in response to changes in the packet drop rate.

References
  1. Ratul Mahajan and Sally Floyd Controlling High Bandwidth Flows at the Congested Router in ACIRI, November 20, 2000.
  2. S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE-ACM Transactions on Networking, pp. 397-413, August 1993.
  3. S. Floyd and K. Fall, Promoting the use of end-to-end congestion control in the internet, IEEE-ACM Transactions on Networking, pp. 458-472, August 1999.
  4. Dong Lin and Robert Morris. Dynamics of Random Early Detection. In ACM SIGCOMM, September 1997.
  5. Rong Pan, Balaji Prabhakar and Konstantinos Psounis. Choke, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation in IEEE INFOCOMM, March 2000.
  6. Matt Mathis, Jamshid Mahdavi, Sally Floyd, and Allyn Romanow. TCP Selective Acknowledgement Options. RFC 2018, April 1996.
  7. S. Floyd, NS network simulator, www. isi. edu/nsnam.
  8. Hahne E. , and Gallager, R. , Round Robin Scheduling for Fair Flow Control in Data Communications Networks, IEEE International Conference on Communications, June, 1986.
  9. Addisu Eshete and Yuming Jiang. Generalizing the CHOKe ?ow protection, Computer Networks, January 2013.
Index Terms

Computer Science
Information Sciences

Keywords

RED High bandwidth ?ows Transport Protocols (TCP UDP) Drop Probability max-min fairness