On the dropping probability function in active queue management schemes

Choosing an appropriate type of dropping probability function is an important design issue in active queue management schemes. In this paper, we investigated the queueing performance associated with the use of different types of dropping probability function. We firstly constructed a QoS plane which can distinguish the performance limitation associated with the type of dropping probability function from the performance tradeoffs caused by the function parameter adjustment. We secondly proposed a performance measure in the QoS plane to quantify the performance limitation of different types of dropping probability function. Using the proposed performance measure, we quantitatively compared the exponential, the piecewise linear and the staircase dropping probability functions