Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the structure and application of BGP policy atoms
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
NetQuest: a flexible framework for large-scale network measurement
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Uncovering performance differences among backbone ISPs with Netdiff
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
A systematic framework for unearthing the missing links: measurements and impact
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
IEEE Journal on Selected Areas in Communications
Suggesting ghost edges for a smaller world
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more than a factor of two off the true mean. We present the Broom toolkit that has three methods to correct for this bias. Broom places no burden on the measurement process itself and can be applied post hoc to any measured data set. Our evaluation finds that two of the methods are particularly effective. One of them estimates missing path samples by embedding the nodes in a low-dimensional coordinate space. For realistic sampling rates, the quality of its estimates for path latency approximates ideal, unbiased sampling. The other method is based on a view of network paths as being composed of source-specific, destination-specific, and shared components. It reduces bias for a wide range of path properties, such as latency, hop count and capacity. Applying Broom to data from a real measurement study leads to substantial changes in the resulting inferences. For some networks, the post-correction estimate is 30% higher than the original.