Random Early Detection method for ABR service

@article{Hosamo2008RandomED,
  title={Random Early Detection method for ABR service},
  author={Mohsen Hosamo and Surya Pal Singh and Anand Mohan},
  journal={Computers & Electrical Engineering},
  year={2008},
  volume={34},
  pages={290-308}
}
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 (Qavg) is compared with two threshold levels, lower queue threshold (QL) and higher queue threshold (QH). If it is smaller than QL, the cell is passed, but if it is larger than QH, the cell marking probability is set to one. If it is in between the two thresholds… CONTINUE READING