A method is described that can allocate bandwidth to each user flow fairly
in a scalable network architecture such as differentiated services architec
ture. As promising queueing techniques for providing differentiated service
s, class-based packet scheduling and selective packet discarding have been
attracting attention. However, if we consider that bandwidth should be allo
cated to each flow in a weighted manner, the parameters used in these metho
ds such as the weight assigned to each class queue should be pre-determined
appropriately based on an assumption about the number of flows in each cla
ss. Thus, when the actual traffic pattern differs from the assumed one, the
y may not work well. Instead of assuming the traffic conditions, our method
estimates the number of active flows in each class by simple traffic measu
rement and dynamically changes the weight assigned to each class queue base
d on the estimated number. Our method does not need to maintain the per-flo
w state, Which gives it scalability. Simulation showed that this method is
effective under various patterns of the number of active flows.