The brute force approach would be to run pair test of every possible combination and identify the slow performing pairs and then identify the node that is common in all pairs - So for a 16 node it would be $\binom{16}{2}$ = 120 combinations.
but using binary search we can find the problem faster and smaller number of runs