...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids
【24h】

Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids

机译：对基于多数的网络系统中的故障传播进行建模：三角形网格中的动态垄断

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In a graph theoretical model of the spread of fault in distributed computing and communication networks, each element in the network is represented by a vertex of a graph where edges connect pairs of communicating elements, and each colored vertex corresponds to a faulty element at discrete time periods. Majority-based systems have been used to model the spread of fault to a certain vertex by checking for faults within a majority of its neighbors. Our focus is on irreversible majority processes wherein a vertex becomes permanently colored in a certain time period if at least half of its neighbors were in the colored state in the previous time period. We study such processes on planar, cylindrical, and toroidal triangular grid graphs. More specifically, we provide bounds for the minimum number of vertices in a dynamic monopoly defined as a set of vertices that, if initially colored, will result in the entire graph becoming colored in a finite number of time periods.
机译：在分布式计算和通信网络中故障扩散的图形理论模型中，网络中的每个元素都由图形的顶点表示，其中边连接了成对的通信元素，每个有色顶点对应于离散时间的故障元素期。基于多数的系统已被用来通过检查大多数邻居中的故障来模拟故障向某个顶点的扩散。我们的重点是不可逆的多数过程，其中如果某个顶点的至少一半邻居在上一个时间段处于着色状态，则该顶点在特定时间段内将变为永久着色。我们在平面，圆柱和环形三角形网格图上研究此类过程。更具体地说，我们为动态垄断中定义为一组顶点的最小顶点数提供了界限，这些顶点如果最初是着色的，将导致整个图形在有限的时间段内着色。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号