布尔网络层析中故障节点最大可识别性的紧界
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
摘要:
我们研究了最大可识别性,最近在布尔网络断层扫描,以表征网络的能力,定位故障节点的端到端路径测量中引入的措施。我们证明严格的上限和下限的最大可识别性的故障节点的特定类别的网络拓扑结构,如树和$d$维网格,在有向和无向的情况下。我们证明了有向$d$ -维网格与支持$n$有最大的可识别性$d$使用$2d(n-1)+2$监测器,并在无向的情况下,我们表明,$2d$监测器足以得到可识别性的$d-1$。然后,我们研究了嵌入下的可识别性:当网络拓扑模型为DAG时,我们建立了最大可识别性,嵌入性和图维数之间的关系。我们的研究结果表明,网络的设计在$N$节点最大的可识别性$Ω(\log N)$使用$O(\log N)$监视器和启发式,以提高最大的可识别性在给定的网络模拟$d$维网格。我们提供了积极的证据,这种启发式通过精确计算的最大可识别性的小的真实网络的例子中提取的数据。
英文摘要:
We study maximal identifiability, a measure recently introduced in Boolean Network Tomography to characterize networks' capability to localize failure nodes in end-to-end path measurements. We prove tight upper and lower bounds on the maximal identifiability of failure nodes for specific classes of network topologies, such as trees and $d$-dimensional grids, in both directed and undirected cases. We prove that directed $d$-dimensional grids with support $n$ have maximal identifiability $d$ using $2d(n-1)+2$ monitors; and in the undirected case we show that $2d$ monitors suffice to get identifiability of $d-1$. We then study identifiability under embeddings: we establish relations between maximal identifiability, embeddability and graph dimension when network topologies are model as DAGs. Our results suggest the design of networks over $N$ nodes with maximal identifiability $Ω(\log N)$ using $O(\log N)$ monitors and a heuristic to boost maximal identifiability on a given network by simulating $d$-dimensional grids. We provide positive evidence of this heuristic through data extracted by exact computation of maximal identifiability on examples of small real networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。