Unconstraining graph-constrained group testing

In network tomography, one goal is to identify a small set of failed links in a network, by sending a few packets through the network and seeing which reach their destination. This problem can be seen as a variant of combinatorial group testing, which has been studied before under the moniker "graph-constrained group testing." The main contribution of this work is to show that for most graphs, the "constraints" imposed by the underlying network topology are no constraint at all. That is, the number of tests required to identify the failed links in "graph-constrained" group testing is near-optimal even for the corresponding group testing problem with no graph constraints. Our approach is based on a simple randomized construction of tests, to analyze our construction, we prove new results about the size of giant components in randomly sparsified graphs. Finally, we provide empirical results which suggest that our connected-subgraph tests perform better not just in theory but also in practice, and in particular perform better on a real-world network topology.

[1]  Benny Sudakov,et al.  The phase transition in random graphs: A simple proof , 2012, Random Struct. Algorithms.

[2]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[3]  Alan M. Frieze,et al.  The emergence of a giant component in random subgraphs of pseudo‐random graphs , 2004, Random Struct. Algorithms.

[4]  R. Rastogi,et al.  Robust Monitoring of Link Delays and Faults , 2006 .

[5]  Arya Mazumdar,et al.  Nonadaptive Group Testing With Random Set of Defectives , 2015, IEEE Transactions on Information Theory.

[6]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[8]  Ayfer Özgür,et al.  On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Fan Chung Graham,et al.  The Volume of the Giant Component of a Random Graph with Given Expected Degrees , 2006, SIAM J. Discret. Math..

[10]  Patrick Thiran,et al.  The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[12]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[13]  Michael Dinitz,et al.  Large Low-Diameter Graphs are Good Expanders , 2018, ESA.

[14]  George Varghese,et al.  Automatic test packet generation , 2014, CoNEXT '12.

[15]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[16]  Morteza Zadimoghaddam,et al.  Sequential group testing with graph constraints , 2012, 2012 IEEE Information Theory Workshop.

[17]  Michael Dinitz,et al.  Xpander: Towards Optimal-Performance Datacenters , 2016, CoNEXT.

[18]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[19]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[20]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

[21]  Ely Porat,et al.  Search Methodologies , 2022 .

[22]  János Komlós,et al.  Largest random component of ak-cube , 1982, Comb..

[23]  Kannan Ramchandran,et al.  SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[24]  David R. Karger,et al.  Using randomized sparsification to approximate minimum cuts , 1994, SODA '94.

[25]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[26]  Arkadii G. D'yachkov,et al.  Bounds on the rate of disjunctive codes , 2013, 2014 IEEE International Symposium on Information Theory.

[27]  Renata Teixeira,et al.  NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data , 2007, CoNEXT '07.

[28]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[29]  Alex C. Snoeren,et al.  Passive Realtime Datacenter Fault Detection and Localization , 2017, NSDI.

[30]  Nick G. Duffield,et al.  Network Tomography of Binary Network Performance Characteristics , 2006, IEEE Transactions on Information Theory.