Distributed QoS Routing Algorithm Based On Delay Constraints

With fast development of information technologies, the data explosion has become a central issue, Therefore, massive data transmission become a hot research topic what people concerned about. However, in the transmission process how to deal with latency and how to select the optimal path has to become major problems, so we need to find a better scheduling algorithm to ensure finish the task timely. On this basis, this paper presents an extended DCLC algorithms and DCTD algorithm, they have solved the issue of QoS routing optimal path and delay problems successfully, improved the network resource utilization, achieved the data transmission in large-scale network systems. And through simulation experiments, made a comparison of the RM algorithm, DCTD algorithm, EDF algorithm, the results indicated that the DCTD algorithm has better superiority on task execution success rate, CPU utilization, performance, improved the success rate of task scheduling.