Fundamental limits of failure identifiability by boolean network tomography

@article{Bartolini2017FundamentalLO,
  title={Fundamental limits of failure identifiability by boolean network tomography},
  author={Novella Bartolini and Ting He and Hana Khamfroush},
  journal={IEEE INFOCOM 2017 - IEEE Conference on Computer Communications},
  year={2017},
  pages={1-9}
}
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… CONTINUE READING
3 Citations
15 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Graphcontrained group testing

  • M. Cheraghchi, A. Karbasi, S. Mohajer, V. Saligrama
  • IEEE Trans. on Inf. Theory, no. 1, 2012.
  • 2012
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…