• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Information and Computing >Locating a Broadcast Source in a Tree Network with Complex Unreliability
【24h】

Locating a Broadcast Source in a Tree Network with Complex Unreliability

机译：在具有复杂的不可靠性的树网络中定位广播源

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In an unreliable communication network, failures may occur to nodes and/or links. The problem of finding a source for data broadcast on the network can be reduced to the problem of computing a most reliable source of the network. Previous studies focused on the case of either edge failures or node failures. In this paper, we study a more general case, where each node has an independent transmitting probability and an independent receiving probability while each link has an independent operational probability, called the complex unreliability. Our aim is to compute a node, which maximizes its minimum reachability, called an Maximin most reliable source (Maximin_MRS) of the network. For a tree network with the complex unreliability, we employ a two-stage dynamic programming method to design a linear time algorithm for computing an Maximin_MRS of this network.
机译：在不可靠的通信网络中，可能对节点和/或链接发生故障。可以减少对网络上广播的数据广播源的问题可以减少到计算网络最可靠的源的问题。以前的研究专注于边缘故障或节点故障的情况。在本文中，我们研究了更常规的情况，其中每个节点具有独立的发送概率和独立接收概率，而每个链路具有独立的操作概率，称为复杂的不可靠性。我们的目标是计算一个节点，它可以最大化其最小可达性，称为网络的最大可靠源（MaxImin_mrs）。对于具有复杂不可靠性的树网络，我们采用了两级动态编程方法来设计用于计算该网络的Maximin_MR的线性时间算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号