Brief announcement: the theory of network tracing
Proceedings of the 28th ACM symposium on Principles of distributed computing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Maximum-bandwidth ALM tree on tree network
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Primitives for active internet topology mapping: toward high-frequency characterization
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Brief announcement: on the hardness of topology inference
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On the hardness of topology inference
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
The weak network tracing problem
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Misleading stars: what cannot be measured in the Internet?
DISC'11 Proceedings of the 25th international conference on Distributed computing
Achieving effective resilience for QoS-aware application mapping
Computer Networks: The International Journal of Computer and Telecommunications Networking
DataTraffic Monitoring and Analysis
| Hi-index | 0.07 |
We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given N hosts in an asymmetric network without anonymous routers, traditionally full N(N-1) traceroutes are needed to determine the underlay topology. We investigate how to efficiently infer an underlay topology with low measurement cost, and propose a heuristic called Max-Delta. In the heuristic, a server selects appropriate host-pairs to measure in each iteration so as to reveal the most undiscovered information on the underlay. We further observe that the presence of anonymous routers significantly distorts and inflates the inferred topology. Previous research has shown that obtaining both exact and approximate topology in the presence of anonymous routers under certain consistency constraints is intractable. We hence propose fast algorithms on how to practically construct an approximate topology by relaxing some constraints. We investigate and compare two algorithms to merge anonymous routers. The first one uses Isomap to map routers into a multidimensional space and merges anonymous routers according to their interdistances. The second algorithm is based on neighbor router information, which trades off some accuracy with speed. We evaluate our inference algorithms on Internet-like and real Internet topologies. Our results show that almost full measurement is needed to fully discover the underlay topology. However, substantial reduction in measurements can be achieved if a little accuracy, say 5%, can be compromised. Moreover, our merging algorithms in the presence of anonymous routers can efficiently infer an underlay topology with good accuracy