Skip to main content
SpringerLink
Log in

Identifying defective network components through restricted group testing

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

In this paper, we consider a network of switches in which some of the switches may malfunction. Our aim is to find out efficiently (a) if any of the switches in a network of switches are defective, and (b) if there are defective switches, to identify those switches. We find an optimal solution for the first problem and a heuristic solution to the second, and demonstrate the feasibility of our approach through computational experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Azwell, T., Blum, M.J., Hare, A., Joye, S., Kubendran, S., Laleian, A., Lane, G., Meffert, D.J., Overton, E.B., Thomas III, J., White, L.E.: The Macondo Blowout Environmental Report. Deepwater Horizon Study Group Environmental Report (2011)

  2. Balding, D.J., Bruno, W.J., Knill, E., Torney, D.C.: A comparative survey of non-adaptive pooling designs. In: Speed T., Waterman, M.S. (eds.) Genetic mapping and DNA sequencing, pp. 133–154. The IMA Volumes in Mathematics and its Applications Book Series (IMA, vol. 81) Springer, New York (1996)

  3. Babarczi, P., Tapolcai, J., Ho, P.-H.: Adjacent link failure localization with monitoring trails in all-optical mesh networks. IEEE/ACM Trans. Netw. 19, 907–920 (2011)

    Article  Google Scholar 

  4. Cheraghchi, M., Karbasi, A., Mohajer, S., Saligrama, V.: Graph-constrained group testing. IEEE Trans. Inf. Theory 58, 248–262 (2010)

    Article  Google Scholar 

  5. Du, D.-Z., Hwang, F.: Combinatorial Group Testing and Its Applications. World Scientific, Singapore (2000)

    Google Scholar 

  6. Dyachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Probl. Control. Inf. Theory 12, 229–242 (1983)

    Google Scholar 

  7. Hoshino, E.A.: The minimum cut cover problem. Electron. Notes Discret. Math. 37, 255–260 (2011)

    Article  Google Scholar 

  8. Karbasi, A., Zadimoghaddam, M.: Sequential group testing with graph constraints. In: Proceedings of IEEE Information Theory Workshop (ITW), pp. 292–296 (2012)

  9. Li, C.H.: A sequential method for screening experimental variables. J. Am. Stat. Assoc. 57, 455–477 (1962)

    Article  Google Scholar 

  10. Loulou, R.: Minimal cut cover of a graph with an application to the testing of electronic boards. Oper. Res. Lett. 12, 301–305 (1992)

    Article  Google Scholar 

  11. Motwani, R., Naor, J.: On exact and approximate cut covers of graphs. Technical report STAN-CS-TN-94-11, Stanford University, Department of Computer Science (1994)

  12. Tapolcai, J., Wu, B., Ho, P.-H., Rónyai, L.: A novel approach for failure localization in all-optical mesh networks. IEEE/ACM Trans. Netw. 19, 275–285 (2010)

    Article  Google Scholar 

Download references

Acknowledgements

The author thanks Dr. Nilotpal Chakravarti for introducing him to the problem and for many fruitful discussions on the problem.

Author information

Authors and Affiliations

  1. P&QM Area, Indian Institute of Management Ahmedabad, Ahmedabad, India

    Diptesh Ghosh

Authors
  1. Diptesh Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Diptesh Ghosh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghosh, D. Identifying defective network components through restricted group testing. OPSEARCH 56, 869–889 (2019). https://doi.org/10.1007/s12597-019-00382-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-019-00382-3

Keywords

Search

Navigation