The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On the marginal utility of network topology measurements
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient algorithms for large-scale topology discovery
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
Avoiding traceroute anomalies with Paris traceroute
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Ten years in the evolution of the internet ecosystem
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Traceroute probe method and forward IP path inference
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Fixing ally's growing pains with velocity modeling
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
What are our standards for validation of measurement-based networking research?
ACM SIGMETRICS Performance Evaluation Review
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
iPlane Nano: path prediction for peer-to-peer applications
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
An internet protocol address clustering algorithm
SysML'08 Proceedings of the Third conference on Tackling computer systems problems with machine learning techniques
Improved algorithms for network topology discovery
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Network Topology Inference Based on End-to-End Measurements
IEEE Journal on Selected Areas in Communications
The 2nd workshop on active internet measurements (AIMS-2) report
ACM SIGCOMM Computer Communication Review
Measuring and characterizing end-to-end route dynamics in the presence of load balancing
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
The 3rd workshop on active internet measurements (AIMS-3) report
ACM SIGCOMM Computer Communication Review
Revealing middlebox interference with tracebox
Proceedings of the 2013 conference on Internet measurement conference
Speedtrap: internet-scale IPv6 alias resolution
Proceedings of the 2013 conference on Internet measurement conference
DataTraffic Monitoring and Analysis
| Hi-index | 0.00 |
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from existing systems is unknown, yet empirical evidence suggests that additional fine-grained probing exposes hidden links and temporal dynamics. Through longitudinal analysis of data from the Archipelago and iPlane systems, in conjunction with our own active probing, we examine how to shorten Internet topology mapping cycle time. In particular, this work develops discriminatory primitives that maximize topological fidelity while being efficient. We propose and evaluate adaptive probing techniques that leverage external knowledge (e.g., common subnetting structures) and data from prior cycle(s) to guide the selection of probed destinations and the assignment of destinations to vantage points. Our Interface Set Cover (ISC) algorithm generalizes previous dynamic probing work. Crucially, ISC runs across probing cycles to minimize probing while detecting load balancing and reacting to topological changes. To maximize the information gain of each trace, our Subnet Centric Probing technique selects destinations more likely to expose their network's internal structure. Finally, the Vantage Point Spreading algorithm uses network knowledge to increase path diversity to destination ingress points.