We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each link to be lossy. This function depends on the number of times a link appears in lossy paths and on the relative loss rates of these paths. Preliminary simulation results show that our algorithm achieves accuracy higher than previously proposed heuristic methods and comparable to statistical methods at significantly lower running time.