Optimal Queue Management for Net Service
Zhang Xiang-l · Microcomputer Information · 2011
In this paper, we analyze the limitation of several present queue management algorithms, and propose an optimal algorithm with relative PRI based on RED algorithm. We set different priority, and use interleaving way to decide different dropped packet threshold depending on all kinds of data service. Then, to the marked data packet we calculate their average queue length respectively, and figure out the dropped probability of different priority packet. Based on the simulation in MATLAB, it presents that this optimal algorithm improves the performance of queue management in terms of equity and relative priority in different kinds of network service.