【24h】

Fault-Tolerant Routing in Mesh-Connected 2D Tori

机译:网格连接2D Tori中的容错路由

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

摘要

In this paper, we study natural conditions for 2D tori with a large number of faulty nodes to remain connected. Under the suggested connectivity conditions, we develop efficient routing algorithms in 2D tori with a large number of faulty nodes. As long as a given input torus and the meshes within the torus satisfy the conditions, the routing algorithm successfully constructs a fault-free path by using only local information of the network. Also, our algorithms do not require faulty nodes and faulty blocks to be a special structure such as convex, rectangle, while each mesh in a given torus can sustain as many faulty nodes as possible, provided that non-faulty nodes of the mesh are connected and the mesh holds the connectivity conditions. Specifically, for a torus sustaining up to 22.2% faulty nodes, in linear time, our algorithm constructs a fault-free path of length bounded by six times the shortest path length between the two nodes.
机译:在本文中,我们研究具有大量故障节点保持连接的2D托里的自然条件。在建议的连通性条件下,我们在二维Tori中开发了具有大量故障节点的高效路由算法。只要给定的输入圆环和圆环内的网格满足条件,路由算法仅使用网络的本地信息就可以成功构建无故障路径。而且,我们的算法不需要故障节点和故障块为特殊结构(例如凸面,矩形),而给定圆环中的每个网格都可以维持尽可能多的故障节点,前提是必须连接网格的非故障节点网格保持连通性条件。具体来说,对于在故障时间内维持22.2%故障节点的圆环,我们的算法构造了一条无故障路径,该路径的长度为两个节点之间最短路径长度的六倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号