Dynamically weighted queueing for fair bandwidth allocation and its performance analysis

We describe how to allocate bandwidth fairly to each user in a differentiated services architecture. Our method estimates the number of active users in each class by simple traffic measurement. Using this estimate, it dynamically changes the weight assigned to each class queue and adaptively updates the target rate used for selective packet discarding. By doing this, it can cope with changes in traffic conditions. We call this method dynamically weighted queueing. In this paper, we evaluated its performance under various heterogeneous conditions, i.e., when there are users who have different numbers of TCP flows, have different access link rates, generate UDP flows, and are bottlenecked elsewhere. Simulation showed that this method can achieve fair bandwidth allocation to each user under any condition.