A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the marginal utility of network topology measurements
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
Topology discovery for public IPv6 networks
ACM SIGCOMM Computer Communication Review
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Exploring networks with traceroute-like probes: theory and simulations
Theoretical Computer Science - Complex networks
Relevance of massively distributed explorations of the internet topology: qualitative results
Computer Networks: The International Journal of Computer and Telecommunications Networking
Large Scale Topology Discovery for Public IPv6 Networks
ICN '08 Proceedings of the Seventh International Conference on Networking
Hi-index | 0.01 |
Internet topology plays a vital role in studying network's internal structure and properties. Currently traceroute-based topology discovery is the main approach to map the network. However, the deployments of probing sources are usually quite costly and complex. Even if the total numbers of sources are the same, the overall coverage of the sampled network may vary significantly for different sources. As a result, it is of great importance for a topology discovery project to select a limited set of probing sources to detect more nodes and links. The aim of this paper is to investigate how to select a fixed set of probing sources to maximize the coverage of the sampled network. We propose a novel logic distance-based method to make source placement decisions. Also we evaluate our approach and compare it with other known methods on real network topology and generated topologies.