Adaptive filter theory (3rd ed.)
Adaptive filter theory (3rd ed.)
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Passive network tomography using Bayesian inference
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Robust identification of shared losses using end-to-end unicast probes
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Multicast-Based Inference of Network-Internal Delay Distributions TITLE2:
Multicast-Based Inference of Network-Internal Delay Distributions TITLE2:
Simple network performance tomography
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Passive network tomography using EM algorithms
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Sequential Monte Carlo inference of internal delays innonstationary data networks
IEEE Transactions on Signal Processing
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
Entropy-based algorithms for best basis selection
IEEE Transactions on Information Theory - Part 2
Multi-gateway association in wireless mesh networks
Ad Hoc Networks
| Hi-index | 0.00 |
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximum likelihood estimate for the problem and show that the problem boils down to the matrix inversion problem for an under-determined system of linear equations. Without any prior knowledge of the statistics of packet loss rates, most of the existing work uses the minimum norm solution for the under-determined linear system. We devise, under the assumption that link failures are abnormal events in real networks and lossy links are sparse among all the internal links, an iterative algorithm to identify non-lossy links and to remove the corresponding terms from the under-determined linear system. To identify non-lossy links, we propose to use three different criteria (and a combination thereof): the criterion determined by a basis selection technique, that obtained by sorting path loss rates, and that determined by the minimum norm least square solution. We show via simulation and empirical studies on the MIT Roofnet traces that the computational complexity of the iterative algorithm is comparable to that of the minimum norm least square approach, and that the solution obtained under the iterative algorithm achieves high coverage of lossy links, while incurring only a small number of false positives in various network scenarios.