Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Towards an accurate AS-level traceroute tool
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Towards unbiased end-to-end network diagnosis
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
Multicast-based loss inference with missing data
IEEE Journal on Selected Areas in Communications
A probe prediction approach to overlay network monitoring
Proceedings of the 7th International Conference on Network and Services Management
| Hi-index | 0.00 |
Internet fault diagnosis has attracted much attention in recent years. In this paper, we focus on the problem of finding the Link Pass Ratios (LPRs) when the Path Pass Ratios (PPRs) of a set of paths are given. Usually, given the PPRs of the paths, the LPRs of a significant percentage of the links cannot be uniquely determined because the system is under-constrained. We consider the Maximum Likelihood Estimation of the LPRs of such links. We prove that the problem of finding the Maximum Likelihood Estimation is NP-hard, then propose a simple algorithm based on divide-and-conquer. We first estimate the number of faulty links on a path, then use the global information to assign LPRs to the links. We conduct simulations on networks of various sizes and the results show that our algorithm performs very well in terms of identifying faulty links.