A new coarse-grained differentiated least interference routing algorithm(CDLI) with DiffServ-Aware was presented.This algorithm is composed of off-line and on-line stages,taking into account both real-time traffic and...A new coarse-grained differentiated least interference routing algorithm(CDLI) with DiffServ-Aware was presented.This algorithm is composed of off-line and on-line stages,taking into account both real-time traffic and best-effort traffic.Off-line stage is to determine the shortest path set disjointed path(DP) database for real-time traffic,and to identify link critical value by traffic profile information of real-time traffic and DP database.On-line stage is at first to select route in the DP database for real-time traffic,if there is no path to meet the needs,the dynamic routing will be operated.On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements,and for best-effort traffic it chooses a lighter load path.The simulation results show that compared with the dynamic online routing algorithm(DORA) and constrained shortest path first(CSPF) algorithm,the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic.This guarantees quality of service(QoS) of real-time traffic while improving the utilization of network resources.展开更多
基金Project(2003AA781011) supported by the National High-Tech Research and Development of Program of China Project(20072022) supported by Science and Technology Foundation of Liaoning Province,China
文摘A new coarse-grained differentiated least interference routing algorithm(CDLI) with DiffServ-Aware was presented.This algorithm is composed of off-line and on-line stages,taking into account both real-time traffic and best-effort traffic.Off-line stage is to determine the shortest path set disjointed path(DP) database for real-time traffic,and to identify link critical value by traffic profile information of real-time traffic and DP database.On-line stage is at first to select route in the DP database for real-time traffic,if there is no path to meet the needs,the dynamic routing will be operated.On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements,and for best-effort traffic it chooses a lighter load path.The simulation results show that compared with the dynamic online routing algorithm(DORA) and constrained shortest path first(CSPF) algorithm,the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic.This guarantees quality of service(QoS) of real-time traffic while improving the utilization of network resources.
