作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (S1): 15-17.

• 论文 • 上一篇    下一篇

4元N树InfiniBand网络的拓扑探查及管理

曹志强,金红   

  1. 上海交通大学计算机科学与工程系,江南计算技术研究所 上海 200030
  • 发布日期:2004-12-29

Subnet Sweeping and Topology Management of 4-ary N-tree InfiniBand Network

CAO Zhiqiang,JIN Hong   

  1. (Dept.of Computer Science and Engineering,Shanghai Jiaotong University,Shanghai 200030; Jiangnan Institute of Computing Technology,Wuxi 214083)
  • Published:2004-12-29

摘要: 业界越来越认可InfiniBand协议在网络互联技术上的优势。根据其网络特点,将K元N树引入IBA,构造规则拓扑的网络结构,以满 足性能和路由的需求。但InfiniBand协议并没有给出针对规则拓扑结构有效的管理方法,该文提出一种管理策略。以实现对这种规则拓扑的 探查、错误检查及其验证。该方法同时支持基于4元N树的多种规模网络的节点定位和管理。

关键词: InfiniBand, K元N树, 拓扑管理

Abstract: InfiniBand protocol has been recently got more and more attention. According to the character of network, a new regular topology is proposed, which uses the k-ary n-trecs structure in the iBA network, for meeting the need of performance and routing. But the corresponding management policy isn't mentioned in the InfiniBand protocol. A new management strategy is proposed, which can search the network topology, error examination and validation. Also the strategy supports the node location and management.

中图分类号: