...
首页> 外文期刊>Computer Communications >Hypercube connected rings f a scalable and fault-tolerant logical topology for optical networks
【24h】

Hypercube connected rings f a scalable and fault-tolerant logical topology for optical networks

机译:Hypercube连接环为光网络提供了可扩展且容错的逻辑拓扑

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. in a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increases as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. A HCRNet, like a hypercube, is perfectly symmetric in the sense that the average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of log N and it is comparable to other regular structures such as the Trous and ShuffleNet. The HCRNet is based on the Cube Connected Cycle (CCC) interconnection pattern proposed for multiprocessor architectures. However, the HCRNet improves on CCC by rearranging its hypercube links, which results in a significantly lower average internodal distance. In this paper we present the structural properties of HCRNet, and address the issues of scalability, and fast routing in complete as well as incomplete HCRNet.
机译:提出了一种新的,容错,可扩展的模块化虚拟拓扑,用于采用波分复用的光波网络。所提出的架构基于具有超立方体的丰富拓扑特性的超立方体连接环结构,但它也克服了其缺点之一。在超立方体中,节点度随节点数的增加而增加。因此,随着网络规模的增长,网络的每节点成本也会增加。但是,在超立方体连接的环网(HCRNet)中,节点度很小,并且保持不变,与网络总数无关。 HCRNet就像超立方体一样,在N节点HCRNet中的平均节点间距离与任何源节点相同的意义上是完全对称的。其平均节间距离约为log N,可与其他常规结构(如Trous和ShuffleNet)相提并论。 HCRNet基于为多处理器体系结构建议的多维数据集连接周期(CCC)互连模式。但是,HCRNet通过重新排列其超立方体链接改善了CCC,这导致平均节点间距离大大降低。在本文中,我们介绍了HCRNet的结构特性,并解决了HCRNet的可伸缩性以及快速路由的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号