Efficient beacon placement for network tomography
Ritesh Kumar, Jasleen Kaur · ACM SIGCOMM Internet Measurement Conference (IMC) · 2004
Recent interest in using tomography for network monitoring has raised the fundamental issue of whether it is possible to use only a small number of probing nodes (beacons) for monitoring all edges of a network in the presence of dynamic routing. Past work has shown that minimizing the number of beacons is NP-hard, and has provided approximate solutions that may be fairly suboptimal. In this paper, we use a two-pronged approach to compute an efficient beacon set: (i) we formulate the need for, and design algorithms for, computing the set of edges that can be monitored by a beacon under all possible routing states; and (ii) we minimize the number of beacons used to monitor all network edges. We show that the latter problem is NP-complete and use an approximate placement algorithm that yields beacon sets of sizes within 1+ln(|E|) of the optimal solution, where E is the set of edges to be monitored. Beacon set computations for several Rocketfuel ISP topologies indicate that our algorithm may reduce the number of beacons yielded by past solutions by more than 50%.
Cited by 40 works. doi:10.1145/1028788.1028810
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Introduction to Algorithms
- Internet tomography
- Measuring ISP topologies with rocketfuel
- Internet tomography
- In search of path diversity in ISP networks
- Multicast inference of packet delay variance at interior network links
- Robust monitoring of link delays and faults in IP networks
- Network Delay Tomography from End-to-End Unicast Measurements
- On the number of distributed measurement points for network tomography