Design of AQM based on variable structure control

The variable structure control algorithm has been proposed for active queue management (AQM) in TCP networks. In this paper we have considered the saturation constrain, i.e. marking probability p(t) ∈ [0,1], which was omitted by many papers. By introducing the sliding model plane, this AQM algorithm can maintain an input rate around the target rate, while attempting to regulate the queue length. In this paper, we analyze the existence of the sliding mode plane in a nonlinear model. We intend to implement this algorithm in a per-flow queuing framework and we also guarantee that this algorithm can make the system converge to max-min fairness. We show the effectiveness of our algorithm compared to widely used AQM scheme RED through ns-2 simulations.