On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Understanding BGP misconfiguration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Network performance monitoring at small time scales
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Comparing Probe- and Router-Based Packet-Loss Measurement
IEEE Internet Computing
Improving accuracy in end-to-end packet loss measurement
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The role of PASTA in network measurement
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Detecting BGP configuration faults with static analysis
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
PlanetSeer: internet path failure monitoring and characterization in wide-area services
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Accurate and efficient SLA compliance monitoring
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
An active measurement system for shared environments
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Studying black holes in the internet with Hubble
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Building bug-tolerant routers with virtualization
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Discarte: a disjunctive internet cartographer
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Practical issues with using network tomography for fault diagnosis
ACM SIGCOMM Computer Communication Review
Experimental study of router buffer sizing
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Troubleshooting chronic conditions in large IP networks
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
Network Tomography of Binary Network Performance Characteristics
IEEE Transactions on Information Theory
LDP failure detection and recovery
IEEE Communications Magazine
Detecting the performance impact of upgrades in large operational networks
Proceedings of the ACM SIGCOMM 2010 conference
Predicting and tracking internet path changes
Proceedings of the ACM SIGCOMM 2011 conference
Trinocular: understanding internet reliability through adaptive probing
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.00 |
Binary tomography - the process of identifying faulty network links through coordinated end-to-end probes - is a promising method for detecting failures that the network does not automatically mask (e.g., network "blackholes"). Because tomography is sensitive to the quality of the input, however, naïve end-to-end measurements can introduce inaccuracies. This paper develops two methods for generating inputs to binary tomography algorithms that improve their inference speed and accuracy. Failure confirmation is a per-path probing technique to distinguish packet losses caused by congestion from persistent link or node failures. Aggregation strategies combine path measurements from unsynchronized monitors into a set of consistent observations. When used in conjunction with existing binary tomography algorithms, our methods identify all failures that are longer than two measurement cycles, while inducing relatively few false alarms. In two wide-area networks, our techniques decrease the number of alarms by as much as two orders of magnitude. Compared to the state of the art in binary tomography, our techniques increase the identification rate and avoid hundreds of false alarms.