首页> 外文会议>Performance, Computing and Communications, 1998. IPCCC '98., IEEE International >Near optimal broadcast in all-port wormhole routed hypercubes using error correcting codes
【24h】

Near optimal broadcast in all-port wormhole routed hypercubes using error correcting codes

机译:使用纠错码在全端口虫洞路由超立方体中实现近乎最佳的广播

获取原文
获取外文期刊封面目录资料

摘要

A new broadcasting method is presented for hypercubes with wormhole routing mechanism. The approach is based on determination of the set of nodes (called stations) in the hypercube such that for any node in the network there is a station at distance of at most 1. Once stations are identified, parallel disjoint paths are formed from the source to all stations. The broadcasting is accomplished first by sending the message to all stations which will in turn inform the rest of the nodes of the message. To establish node-disjoint paths between the source node and all stations, we introduce a new routing strategy. We prove that multicasting can be done in one routing step as long as the number of destination nodes are fewer than or equal to n in an n-dimensional hypercube. The number of broadcasting steps using our routing is equal to or smaller than that obtained in an earlier work.
机译:提出了一种新的具有虫洞路由机制的超立方体广播方法。该方法基于确定超立方体中的节点集(称为站点),以便对于网络中的任何节点,存在距离最大为1的站点。一旦标识了站点,就会从源形成平行的不相交路径到所有车站。首先通过将消息发送到所有站点来完成广播,这些站点将依次向其余节点通知该消息。为了在源节点和所有站点之间建立节点不相交的路径,我们引入了一种新的路由策略。我们证明只要在n维超立方体中目标节点的数量小于或等于n,就可以在一个路由步骤中完成多播。使用我们的路由选择的广播步骤数等于或小于早期工作中获得的广播步骤数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号