Technical Papers Parallel Session-VII: CHOKe-FS: CHOKe with fair bandwidth share
Abstract/Description
This paper proposes a partial state Active Queue Management (AQM) technique, called CHOKe-FS, which addresses the problem of fair-bandwidth allocation among different flows sharing a common bottleneck link. CHOKe-FS is a packet-dropping mechanism for classifying and restricting unresponsive or misbehaving flows during congestion. It utilizes a direct bitmap technique, which estimates the number of active flows in the buffer to compute the fair-share. It inherits the matched drop mechanism of CHOKe and the buffer management technique of RED. The proposed technique differs from CHOKe in three ways: (i) it divides the queue into multiple regions, (ii) it dynamically adjusts the drawing factor depending on the average queue occupancy, by drawing multiple packets from the buffer, and (iii) it estimates the number of active flows in a queue for fair share estimation to drop the packet from flows exceeding the fair bandwidth share. The performance of CHOKe-FS is analyzed under various scenarios by comparing it with the well-known, AQM schemes such as RED, CHOKe and CHOKeR. The results demonstrate that the proposed algorithm not only protects the responsive flows from unresponsive flows, but it also works reasonably well for providing intra-protocol fairness.
Keywords
Decision support systems, Computers, Conferences, Inductors, Estimation, Military communication, Informatics
Location
C-12, AMAN CED
Session Theme
Technical Papers Parallel Session-VII (Networks-II)
Session Type
Parallel Technical Session
Session Chair
Dr. Shahid Shaikh
Start Date
13-12-2015 3:10 PM
End Date
13-12-2015 3:30 PM
Recommended Citation
Raza, U., Abbas, G., & Hussain, Z. (2015). Technical Papers Parallel Session-VII: CHOKe-FS: CHOKe with fair bandwidth share. International Conference on Information and Communication Technologies. Retrieved from https://ir.iba.edu.pk/icict/2015/2015/38
COinS
Technical Papers Parallel Session-VII: CHOKe-FS: CHOKe with fair bandwidth share
C-12, AMAN CED
This paper proposes a partial state Active Queue Management (AQM) technique, called CHOKe-FS, which addresses the problem of fair-bandwidth allocation among different flows sharing a common bottleneck link. CHOKe-FS is a packet-dropping mechanism for classifying and restricting unresponsive or misbehaving flows during congestion. It utilizes a direct bitmap technique, which estimates the number of active flows in the buffer to compute the fair-share. It inherits the matched drop mechanism of CHOKe and the buffer management technique of RED. The proposed technique differs from CHOKe in three ways: (i) it divides the queue into multiple regions, (ii) it dynamically adjusts the drawing factor depending on the average queue occupancy, by drawing multiple packets from the buffer, and (iii) it estimates the number of active flows in a queue for fair share estimation to drop the packet from flows exceeding the fair bandwidth share. The performance of CHOKe-FS is analyzed under various scenarios by comparing it with the well-known, AQM schemes such as RED, CHOKe and CHOKeR. The results demonstrate that the proposed algorithm not only protects the responsive flows from unresponsive flows, but it also works reasonably well for providing intra-protocol fairness.
