Advanced Search
Volume 35 Issue 4
May  2013
Turn off MathJax
Article Contents
Zhao Qi, Zhao A-Qun. A Multi-path Routing Algorithm Base on A* Algorithm[J]. Journal of Electronics & Information Technology, 2013, 35(4): 952-957. doi: 10.3724/SP.J.1146.2012.00983
Citation: Zhao Qi, Zhao A-Qun. A Multi-path Routing Algorithm Base on A* Algorithm[J]. Journal of Electronics & Information Technology, 2013, 35(4): 952-957. doi: 10.3724/SP.J.1146.2012.00983

A Multi-path Routing Algorithm Base on A* Algorithm

doi: 10.3724/SP.J.1146.2012.00983
  • Received Date: 2012-07-27
  • Rev Recd Date: 2012-12-07
  • Publish Date: 2013-04-19
  • With the rapid growth of network traffic, applications of the multi-path transmission are becoming more popular. The multi-path routing algorithms are the base to implement multi-path transmission. In this paper, a new Multi-path routing algorithm based on the A* algorithm called MA* algorithm is proposed which combining the path similarity objective with the heuristic method. A new evaluation function construction method is devised for the MA* algorithm, which is proved to be feasible through theoretical analysis. The simulation experiments are carried out to compare the MA* algorithm with other multi-path routing algorithms applying network topology generation tool. The results show that the MA* algorithm can acquire multiple paths with reasonable path cost and path similarity at quite low search times. In addition, the balance of path cost and path similarity can be achieved through reasonable adjustment of the punishing parameter. The MA* algorithm can be applied to wider multi-path transmission environments as a more common multi-path routing algorithm.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1889) PDF downloads(791) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return