ACM Home Page
Please provide us with feedback. Feedback
Efficient beacon placement for network tomography
Full text PdfPdf (282 KB)
Source Internet Measurement Conference archive
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement table of contents
Taormina, Sicily, Italy
SESSION: Traffic matrix estimation and tomography table of contents
Pages: 181 - 186  
Year of Publication: 2004
ISBN:1-58113-821-0
Authors
Ritesh Kumar  University of North Carolina at Chapel Hill
Jasleen Kaur  University of North Carolina at Chapel Hill
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1028788.1028810
What is a DOI?

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+<i>ln</i>(|<i>E</i>|) 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%.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CAIDA, "Skitter," http://www.caida.org/tools/measurement/skitter.
 
2
M. Coates, A. Hero, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Processing Magazine, May 2002.
 
3
K. Claffy, T.E. Monk, and D. McRobb, "Internet tomography," Nature, 1999.
 
4
Y. Bejerano and R. Rastogi, "Robust monitoring of link delays and faults in ip networks," in Proceedings of the 2003 ACM INFOCOM, 2003.
 
5
N.G. Duffield and F. Lo Presti, "Multicast inference of packet delay variance at interior network links," in INFOCOM (3), 2000, pp. 1351--1360.
 
6
7
8
 
9
R. Kumar and J. Kaur, "Efficient beacon placement for network tomography," Technical Report, Department of Computer Science, University of North Carolina at Chapel Hill, August 2004.
 
10
A. Shriram and J. Kaur, "Identifying bottleneck links using distributed end-to-end available bandwidth measurements," First ISMA Bandwidth Estimation Workshop, December 2003.
 
11
Postel et. al., "Rfc 791: Internet protocol," Request for Comments, pp. 17--18, 1999.
 
12
H.X. Nguyen and P. Thiran, "Active measurement for multiple link failures diagnosis in ip networks," in Proceedings of Passive and Active Measurement Workshop (PAM), April 2004.
 
13
 
14
 
15
16


Collaborative Colleagues:
Ritesh Kumar: colleagues
Jasleen Kaur: colleagues