An efficient approach for the selection of priority control parameters in adaptive proportional delay differentiated services

A proportional-delay model for Internet differentiated services was proposed recently. Under this model, the average waiting times among different classes of traffic is kept as constant specified ratios. Adaptive waiting time priority (AWTP) scheduling algorithm has been demonstrated to be an efficient one to realize such proportional differentiated services if a good set of priority control parameter exists. However, the existence on such a good set of priority control parameters was not completely solved in the AWTP algorithm. In this paper, we mainly consider the searching problem on the good set of priority control parameters and its effect on the system performance. We propose an improved searching algorithm for obtaining the priority control parameters. Compared to that proposed by Leung. Lui and Yau (LLY), the new searching algorithm can greatly improve the successful searching probability for priority control parameters. Furthermore. We also investigate the selection problem on the priority control parameters when our searching algorithm does not converge and present a fast table looking-up method on the selection of the priority control parameters. Simulation results have clearly demonstrated that our table looking-up selection method on the priority control parameters can provide a very good performance in adaptive proportional delay differentiated services.