In VINI veritas: realistic and controlled network experimentation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Monitoring end-to-end paths in an overlay network is essential for evaluating end-system performance and for troubleshooting anomalous behavior. However, conducting measurements between all pairs of overlay nodes can be cumbersome and expensive, especially in a large network. In this paper, we take a different approach and explore an additional degree of freedom, namely, monitoring native links. We allow native link measurements, as well as end-to-end overlay measurements, in order to minimize the total cost of monitoring the network. We formulate an optimization problem that, when solved, identifies the optimal set of native and overlay links to monitor, and a feasible sequence of arithmetic operations to perform for inferring characteristics of the overlay links that are not monitored directly. We use simulations to investigate how various topological properties may affect the best monitoring strategy. We also conduct measurements over the PlanetLab network to quantify the accuracy of different monitoring strategies.