Identifying defective network components through restricted group testing
- 7 Downloads
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.
KeywordsSwitch networks Node covering Group testing s-t Cuts Heuristics
The author thanks Dr. Nilotpal Chakravarti for introducing him to the problem and for many fruitful discussions on the problem.
- 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)Google Scholar
- 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)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
- 8.Karbasi, A., Zadimoghaddam, M.: Sequential group testing with graph constraints. In: Proceedings of IEEE Information Theory Workshop (ITW), pp. 292–296 (2012)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)Google Scholar