Approximate Fairness Through Limited Flow List

Provided by: Norwegian University of Science and Technology Topic: Mobility Date Added: Jun 2011 Format: PDF
Most of router mechanisms proposed for fair bandwidth sharing lack either simplicity due to complexity of intricate per flow management of all connections (e.g., WFQ, SFQ), heterogeneity due to a design targeting a specific traffic type, e.g., RED-PD and Fair RED (FRED) or robustness due to requirement for proper router configurations (e.g., CSFQ). All of these severely impact the scalability of the schemes. This paper proposes a novel router fairness mechanism, namely Approximate Fairness through partial Finish Time (AFpFT). Key to the design of AFpFT is a tag field the value of which defines the position of the packet in an aggregate queue shared by all flows.

Find By Topic