In this paper, double laxity threshold MLT(Minimum Laxity Threshold) algorithm and double queue threshold QLT(Queue Length Threshold) algorithm are proposed as DPS(Dynamic Priority Scheduling) techniques for advanced processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed by a computer simulation. According to the simulation results, it can be shown that the proposed double laxity threshold ML T algorithm advances the processing performance versus ML T algorithm for 2 or more classes delay sensitive traffics, and that double queue length threshold QL T algorithm provides more efficient performance than QL T for 2 or more classes of non real time traffics.