Efficient beacon placement for network tomography

Authors:
Ritesh Kumar;Jasleen Kaur
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Year:
2004

Citing 5
Cited 6

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
Measuring ISP topologies with rocketfuel

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the number of distributed measurement points for network tomography

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
In search of path diversity in ISP networks

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement

Algorithmic foundations of the internet

ACM SIGACT News
Probe Station Placement for Robust Monitoring of Networks

Journal of Network and Systems Management
Locating congested segments over the Internet by clustering the delay performance of multiple paths

Computer Communications
An algorithm for the measure station selection and measure assignment in the active IP network measurement

APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Distributed active measuring link bandwidth in IP networks

NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Algorithmic foundations of the internet: roundup

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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%.