PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Internet Mapping: From Art to Science
CATCH '09 Proceedings of the 2009 Cybersecurity Applications & Technology Conference for Homeland Security
Analyzing Router Responsiveness to Active Measurement Probes
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Measuring multipath routing in the internet
IEEE/ACM Transactions on Networking (TON)
Monitoring network topology dynamism of large-scale traceroute-based measurements
Proceedings of the 7th International Conference on Network and Services Management
Deployment of an Algorithm for Large-Scale Topology Discovery
IEEE Journal on Selected Areas in Communications
LIFEGUARD: practical repair of persistent route failures
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Revealing middlebox interference with tracebox
Proceedings of the 2013 conference on Internet measurement conference
| Hi-index | 0.00 |
Large-scale distributed network route tracing systems obtain the IP-level internet topology and can be used to monitor and understand network behavior. However, existing approaches require one or more days to obtain a full graph of the public IPv4 internet, which is too slow to capture important network dynamics. This paper presents a new approach to topology capture that aims at obtaining the graph rather than full routes, and that employs partial rather than full route tracing to achieve this aim. Our NTC (Network Topology Capture) heuristics use information from previous tracing rounds to guide probing in future rounds. Through simulations based upon two months of traces that we obtained, we find that the heuristics improve significantly on the state of the art for reducing probing overhead while maintaining good graph coverage. We also conduct the first study of how such a distributed tracing system performs in its ability to capture network dynamics.