Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

An Improved Distributed Algorithm for Delay-Constrained Unicast Routing

개선된 분산 Delay-Constrained Unicast Routing 알고리듬

  • Zhou, Xiao-Zheng (Department of Information Engineering, Beijing Instistute of Petro-Chemical Technology) ;
  • Suh, Hee-Jong (Division of Electronic Communication and Electrical Engineering, Yosu National University)
  • 주효정 (북경석유화공학원 정보공학과) ;
  • 서희종 (여수대학교 전자통신전기공학부)
  • Published : 2005.11.26
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks which is based on the delay-constrained unicast routing (DCUR) algorithm. Our I-DCUR algorithm is quite different from DCUR algorithm, because the node will choose the link between the active node and the previous node, and it will replace the original loop path when it detects a loop. Thus, firstly consider to choose the link between the active node and the previous node to replace the original loop path when a node detects a loop. So our algorithm can make the construction of path more efficiently, as compared to DCUR algorithm. We could see that the performance of I-DCUR algorithm is much better than DCUR algorithm in the experimental results. There were over 40% improvement in 100 nodes, 60% in 200 nodes, and 9% reduction of costs.

Keywords