An Improved Algorithm for Delay-Constrained Unicast Routing
In this paper, an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks is studied, which is based on the delay-constrained unicast routing (DCUR) algorithm. The improved algorithm is quite different from DCUR algorithm when an active node detects a loop. The active node will firstly consider constructing a new path along the link between the active node and the previous node rather than firstly remove some links backwards the constructed path. Experimental results show that over 40％ occurred loops are dealt with the improved algorithm for network size of 100 nodes, while over 60％ for network size of 200 nodes. Also, simulations are made to compare the improved algorithm to the original DCUR algorithm on the path costs. Results show that I-DCURs path costs are less than those from DCUR about 9％.
Delay-Constrained Distributed QoS Unicast Routing
Xiaozheng Zhou Heejong Suh
Department of Information Engineering Beijing Institute of Petro-Chemical Technology Beijing 102600, Department of Electronic CommunicationEngineering Yosu National University Yeosu-si,Korea
国际会议
太原
英文
280-283
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）