Adaptive Filtering Queueing for Improving Fairness
AbstractIn this paper, we propose a scalable and efficient Active Queue Management (AQM) scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ). First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ’s feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ), Core-Stateless Fair Queueing (CSFQ), CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe) and First-In First-Out (FIFO) schemes under a variety of traffic conditions. View Full-Text
Share & Cite This Article
Yang, J.-P. Adaptive Filtering Queueing for Improving Fairness. Appl. Sci. 2015, 5, 122-135.
Yang J-P. Adaptive Filtering Queueing for Improving Fairness. Applied Sciences. 2015; 5(2):122-135.Chicago/Turabian Style
Yang, Jui-Pin. 2015. "Adaptive Filtering Queueing for Improving Fairness." Appl. Sci. 5, no. 2: 122-135.