Practical Beacon Placement for Link Monitoring Using Network Tomography

Recent interest in using tomography for network monitoring has motivated the 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: 1) 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 2) we minimize the number of beacons used to monitor all network edges. We show that the latter problem is NP-complete and use various 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 Internet service provider topologies indicate that our algorithms may reduce the number of beacons yielded by past solutions by more than 50% and are, in most cases, close to optimal

[1]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[4]  Donald F. Towsley,et al.  Network Delay Tomography from End-to-End Unicast Measurements , 2001, IWDC.

[5]  Azer Bestavros,et al.  On the marginal utility of network topology measurements , 2001, IMW '01.

[6]  Ritesh Kumar,et al.  Efficient beacon placement for network tomography , 2004, IMC '04.

[7]  Alejandro López-Ortiz,et al.  On the number of distributed measurement points for network tomography , 2003, IMC '03.

[8]  Patrick Thiran,et al.  Active Measurement for Multiple Link Failures Diagnosis in IP Networks , 2004, PAM.

[9]  Nick G. Duffield,et al.  Multicast inference of packet delay variance at interior network links , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[11]  Renata Teixeira,et al.  In search of path diversity in ISP networks , 2003, IMC '03.

[12]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.