Derivation of Three Queue Nodes Discrete-Time Analytical Model Based on DRED Algorithm

Evaluating the Performance of Active Queue Management Using Discrete-Time Analytical Model

Congestion in networks is considered a serious problem; in order to manage and control this phenomena in early stages before it occurs, a derivation of a new discrete-time queuing network analytical model based on dynamic random early drop (DRED) algorithm is derived to present analytical expressions to calculate three performance measures: average queue length (Qavg,j), packet-loss rate (Ploss,j), and packet dropping probability (pd(j)). Many scenarios can be implemented to analyze the effectiveness and flexibility of the model. We compare between the three queue nodes of the proposed model using the derived performance measures to identify which queue node provides better performance. Results show that queue node one provides highest Qavg,j, Ploss,j, and (pd(j)) than queue nodes two and three, since it has the highest priority than other nodes. All the above results of performance measure are obtained only based on the queuing network setting parameters.