期刊文献+

超立方体网络的不相交路径通信策略研究综述 被引量:2

A Review of Disjoint Path Routing Strategy in Hypercube
下载PDF
导出
摘要 超立方体是一类具有良好的拓扑性质的互连网络模型。不相交路径的实现是超立方体网络中容错通信的有效保证。介绍了超立方体网络的不相交路径路由策略中的主要研究内容和研究现状,对近年来该方面取得的研究成果进行分析和总结,并指出了其中存在的问题和该策略研究的方向。 The hypercube is a kind of interconnection network with many excellent topological properties. The implementations of the disjoint path routing in hypereube network guarantee fauh - tolerant communication effectively. This article describes research contents of the disjoint path routing strategy in hypercube network, analyzes and summarizes related works in recent years. After that, the paper points out the existing problems and the future research direction.
出处 《智能计算机与应用》 2014年第1期17-19,23,共4页 Intelligent Computer and Applications
基金 国家高技术研究发展计划(863)(2013AA010208)
关键词 互连网络 超立方体 不相交路径 容错路由 Interconnection Networks Hypercube Disjoint Path Fault - tolerant Routing
  • 相关文献

参考文献1

二级参考文献9

  • 1Wu J,IEEE on Computers,1997年,46卷,2期,241页
  • 2Chiu G M,IEEE Trans Computers,1997年,46卷,8期,953页
  • 3Chiu G M,IEEE Trans Computers,1996年,45卷,2期,143页
  • 4Min Y L,J Comput Sci Technol,1995年,10卷,6期,536页
  • 5Min Y H,Proceedings of APPT’ 95,1995年,154页
  • 6Li Z C,Proceedings of the PRDC’ 95 ,CA,1995年,166页
  • 7Chen M S,IEEE Trans Computers,1990年,39卷,12期,1406页
  • 8Chen M S,IEEE Trans Parallel Distributed Systems,1990年,1卷,2期,152页
  • 9Wu Jie,IEEE Trans Parallel Distributed Systems,1998年,9卷,4期,321页

共引文献21

同被引文献21

  • 1韩伟一,王铮.Dijkstra算法的一个改进[J].运筹与管理,2004,13(6):6-10. 被引量:8
  • 2LAI Chengnan.Optimal Construction of All Shortest Node-disjoin Paths in Hypercubes with Applications[C]∥IEEE Transactions on Parallel and Distributed System,2012,23(6):1129-1134.
  • 3LAI Chengnan.Constructing all Shortest Node-disjoint Paths in Torus Networks[J].J Parallel Distrib Comput,2015,75:123-132.
  • 4CHEN Xiebin.Many-to-many Disjoint Paths in Faulty Hypercubes[J].Information Sciences,2009,179:3110-3115.
  • 5CHEN Xiebin.Paired Many-to-many Disjoint Path Covers of Hypercubes[J].Information Sciences,2013,236:218-223.
  • 6QIU Ke.An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube[R].14th IEEE International Conference on Parallel and Distributed Systems,2008.
  • 7WU Rueiyu,CHEN Genhuey,KUO Yuliang,et al.Node-disjoint Paths in Hierarchical Hypercube Networks[J].Information Sciences,2007(19):4200-4207.
  • 8Antoine Bossard, Keiichi Kaneko. Time optimal node-to-set disjoint paths routing in hypercubes [ J-. Journal of Information Science and Engi- neering, 2014, (30) : 1087 - 1093.
  • 9Anil M, Shende. Maximal induced paths and minimal percolating sets in hypercubes [ J ]. Journal of Algebra Combinatorics Discrete Structures and Applications ,2014,2 ( 1 ) : 17 - 24.
  • 10Cheng-Nan Lai. An efficient construction of one-to-mang node-disjoint paths in folded hypercubes [ J]. J Parallel Distrib Comput,2014 ,74 :2310 -2316.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部