Earticle

초록

영어

Recently, shortest path tree construction is essential in network routing. Dijkstra algorithm, one of the static routing algorithms, is widely used. When some links develop new weights, dynamic routing algorithms become more efficient than static routing algorithms. This is because dynamic routing algorithms reduce the redundancy caused by re-computing the affected part of the network in regards to the changed links. However, dynamic routing algorithms are not always efficient in some cases and increase the computation time when making the shortest path tree. In this paper, we present a Hybrid Shortest Path Tree (HSPT) algorithm which reduces the total execution time of shortest path tree computation by using the advantages of both static and dynamic routing algorithms. Comparisons with the other routing algorithms such as Dijkstra, Dynamic Dijkstra and RDSP show that the HSPT algorithm provides a better performance as demonstrated by the decrease in the execution time.

목차

Abstract
 1. Introduction
 2. Related Works
  2.1. Dijkstra Algorithm
  2.2. Dynamic Routing Algorithm
  2.3. Problem Definition
 3. Proposed Algorithm
 4. Performance Evaluation
  4.1. Number of Nodes
  4.2. Changed Rate of Link Weights
  4.3. Deviation of Link Weights
  4.4. Simulation Results
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Taehwan Cho [ Department of Electronics Engineering, Inha University, Incheon, Korea ]
• Kyeongseob Kim [ Department of Electronics Engineering, Inha University, Incheon, Korea ]
• Wanoh Yoon [ Department of Electronics Engineering, Inha University, Incheon, Korea ]
• Sangbang Choi [ Department of Electronics Engineering, Inha University, Incheon, Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605