Experiences on enhancing data collection in large networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analyzing Router Responsiveness to Active Measurement Probes
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Increasing the coverage of a cooperative internet topology discovery algorithm
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
A recursive distributed topology discovery service for network-aware grid clients
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Toward the practical use of network tomography for internet topology discovery
INFOCOM'10 Proceedings of the 29th conference on Information communications
Improving retouched Bloom filter for trading off selected false positives against false negatives
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable and systematic Internet-wide path and delay estimation from existing measurements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient network tomography for internet topology discovery
IEEE/ACM Transactions on Networking (TON)
Quantifying violations of destination-based forwarding on the internet
Proceedings of the 2012 ACM conference on Internet measurement conference
Efficient IP-Level network topology capture
PAM'13 Proceedings of the 14th international conference on Passive and Active Measurement
Efficient content-based routing with network topology inference
Proceedings of the 7th ACM international conference on Distributed event-based systems
DataTraffic Monitoring and Analysis
| Hi-index | 0.07 |
Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. This paper describes several contributions towards that end. These were first presented in the proceedings of ACM Sigmetrics 2005. We show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble distributed denial-of-service attacks. We propose two metrics focusing on redundancy in probing and show that both are important. We also propose and evaluate Doubletree, an algorithm that strongly reduces redundancy, while maintaining nearly the same level of node and link coverage. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Following the Sigmetrics work, we implemented Doubletree, and deployed it in a real-network environment. This paper describes that implementation, as well as preliminary favorable results