Random Early Detection method for ABR service

Authors:
Mohsen Hosamo;S. P. Singh;Anand Mohan
Affiliations:
Department of Electronics Engineering, Institute of Technology, Banaras Hindu University, Varanasi 221 005, India;Department of Electronics Engineering, Institute of Technology, Banaras Hindu University, Varanasi 221 005, India;Department of Electronics Engineering, Institute of Technology, Banaras Hindu University, Varanasi 221 005, India
Venue:
Computers and Electrical Engineering
Year:
2008

Citing 7
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Adaptive packet marking for maintaining end-to-end throughput in a differentiated-services internet

IEEE/ACM Transactions on Networking (TON)
Tuning RED for Web traffic

IEEE/ACM Transactions on Networking (TON)
MRED: A New Approach to Random Early Detection

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
The drop from front strategy in TCP and in TCP over ATM

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new implementation for the Random Early Detection method algorithm for ABR (REDM-ABR) service is proposed in this paper. It keeps running an exponential average of the queue length (Q). When a cell arrives, the average queue size (Q"a"v"g) is compared with two threshold levels, lower queue threshold (Q"L) and higher queue threshold (Q"H). If it is smaller than Q"L, the cell is passed, but if it is larger than Q"H, the cell marking probability is set to one. If it is in between the two thresholds, the cell marking probability is calculated depending on the value of Q"a"v"g. The values of Resource Management (RM) cell fields: Congestion Indication (CI), No Additive Increase (NI), and Explicit Rate (ER) are filled by the Relative Rate Marking (RRM) switch and sent back to the sources. The sources will change their rate depending on CI, NI, and ER values. To investigate the effect of decreasing the impending congestion area, a dynamic Q threshold (Q"D) is used. The Q"D is shifted from Q"L toward Q"H for decreasing the congestion area and to investigate the effect of this shift on the performance of the switch through simulation study.