Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Fundamental Bounds of Failure Identifiability by Boolean Network
  Tomography   Boolean network tomography is a powerful tool to infer the state
(working/failed) of individual nodes from path-level measurements obtained by
egde-nodes. We consider the problem of optimizing the capability of identifying
network failures through the design of monitoring schemes. Finding an optimal
solution is NP-hard and a large body of work has been devoted to heuristic
approaches providing lower bounds. Unlike previous works, we provide upper
bounds on the maximum number of identifiable nodes, given the number of
monitoring paths and different constraints on the network topology, the routing
scheme, and the maximum path length. These upper bounds represent a fundamental
limit on identifiability of failures via Boolean network tomography. Our
analysis provides insights on how to design topologies and related monitoring
schemes to achieve the maximum identifiability under various network settings.
Through analysis and experiments we demonstrate the tightness of the bounds and
efficacy of the design insights for engineered as well as real networks.

23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc