Using pathchar to estimate Internet link characteristics
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Multicast-based inference of network-internal delay distributions
IEEE/ACM Transactions on Networking (TON)
Network Characterization Service (NCS)
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
On the number of distributed measurement points for network 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
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
Complex Graphs and Networks (Cbms Regional Conference Series in Mathematics)
The use of end-to-end multicast measurements for characterizing internal network behavior
IEEE Communications Magazine
Practical Beacon Placement for Link Monitoring Using Network Tomography
IEEE Journal on Selected Areas in Communications
Inference of Link Delay in Communication Networks
IEEE Journal on Selected Areas in Communications
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We investigate the problem of identifying individual link metrics in a communication network from end-to-end path measurements, under the assumption that link metrics are additive and constant. To uniquely identify the link metrics, the number of linearly independent measurement paths must equal the number of links. Our contribution is to characterize this condition in terms of the network topology and the number/placement of monitors, under the constraint that measurement paths must be cycle-free. Our main results are: (i) it is generally impossible to identify all the link metrics by using two monitors; (ii) nevertheless, metrics of all the interior links not incident to any monitor are identifiable by two monitors if the topology satisfies a set of necessary and sufficient connectivity conditions; (iii) these conditions naturally extend to a necessary and sufficient condition for identifying all the link metrics using three or more monitors. We show that these conditions not only allow efficient identifiability tests, but also enable an efficient algorithm to place the minimum number of monitors in order to identify all link metrics. Our evaluations on both random and real topologies show that the proposed algorithm achieves identifiability using a much smaller number of monitors than a baseline solution.