100 likes | 219 Vues
This paper explores the design and evaluation of approximate fairness and control delay queue management schemes, particularly focusing on AF-CODEL mechanisms within high-speed networks. It discusses enqueue and dequeue processes, highlighting the management of approximately 2000 packets in the shadow buffer and 100 in the flow table. It evaluates different queuing delays and fairness objectives using TCP variants like CUBIC and Reno across various Round Trip Times (RTT). The results demonstrate the effectiveness of the schemes in maintaining fairness under different conditions, including background traffic scenarios.
E N D
Design and Evaluation:Approximate Fair & Control DelayQueue Management Schemes over High Speed Networks Lin Xue 2012.12
AF&CODEL queue mechanism: Enqueue Packet enqueue Sample packet (sample interval 1/500 packets) Y N Update shadow buffer(SB, size 2000) and flow table (FT, size 100) Enqueue
AF&CODEL queue mechanism: Dequeue Packet dequeue Within interval(100ms) Min Queuing delay > Fair_targetof the flow N Y Drop Stop drop Dequeue next packet Schedule next drop
Fair Target of the Flow Fair target = flow’s share ^ -3 Fair target Flow’s share
FIFO Result (1 CUBIC & 1 RENO) Cwnd RTT
AF-CODEL Result (1 CUBIC & 1 RENO) Cwnd RTT
1 CUBIC, 1 HSTCP, 1 RENO (RTT=120ms) Fairness Delay
10 CUBIC, 10 HSTCP, 10 RENO (RTT=120ms) Fairness Delay
10 CUBIC, 10 HSTCP, 10 RENO (RTT=60ms) Fairness Delay
10 CUBIC, 10 HSTCP, 10 RENO with background traffic (RTT=120ms) Fairness Delay