Sampling biases in network path measurements and what to do about it

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2009, Pages 156-169

  Kandula, Srikanth ^a   Mahajan, Ratul ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Coordinate embedding; Networkmeasurement; Path decomposition; Sampling bias

Indexed keywords

COORDINATE EMBEDDING; MEASUREMENT PROCESS; NETWORK PATH MEASUREMENT; NETWORKMEASUREMENT; PATH DECOMPOSITION; SAMPLING BIAS; SHARED COMPONENTS; UNBIASED SAMPLINGS;

MEASUREMENTS;

ESTIMATION;

EID: 84858024265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1644893.1644912     Document Type: Conference Paper

References (27)

1. Y. Afek, O. Ben-Shalom, and A. Bremler-Barr. On the structure and application of BGP policy atoms. In IMW, 2002.
2. S. Agarwal and J. R. Lorch.Matchmaking for online games and other latency-sensitive P2P systems. In SIGCOMM, 2009.
3. H. M. Blalock. Social statistics. McGraw-Hill Book Company, 1972.
4. A. Bryk and H.Weisberg. A developmental perspective on statistical methods for removing bias in quasi-experiments. National Institute of Education Project No. C-72-0125, 1975.
5. H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W.Willinger. Towards capturing representative AS-level Internet topologies. Computer Networks Journal, 44(6), 2004.
6. Y. Chen, D. Bindel, H. Song, and R. H. Katz. An algebraic approach to practical and scalable overlay network monitoring. In SIGCOMM, 2004.
7. D. B. Chua, E. D. Kolaczyk, and M. Crovella. Network kriging. IEEE JSAC, 24(12), 2006.
8. F.Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In SIGCOMM, 2004.
9. Choice of control group and related issues in clinical trials. http://www.fda.gov/CDER/GUIDANCE/4155fnl.htm, 2001.
10. Y.He, G. Siganos, M. Faloutsos, and S. Krishnamurthy. A systematic framework for unearthing the missing links: Measurements and impact. In NSDI, 2007.
11. D. D. Heckathorn. Respondent-driven sampling: A new approach to the study of hidden populations. Social Problems, 44(2), 1997.
12. D. D. Heckathorn. Respondent-drive sampling II: Deriving valid population estimates from chain-referral samples of hidden populations. Social Problems, 2002.
13. S. Kandula, D. Katabi, B. Davie, and A. Charny.Walking the tightrope: Responsive yet stable traffic engineering. In SIGCOMM, Philadelphia, PA, August 2005.
14. A. Lakhina, J.W. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In INFOCOM, 2003.
15. E. Learned-Miller and V. Jain. Many heads are better than one: Jointly removing bias from multiple MRIs using nonparametric maximum likelihood. In Information Processing in Medical Imaging, 2005.
16. J. Ledlie, P. Gardner, andM. Seltzer. Network coordinates in the wild. In NSDI, 2007.
17. R. Mahajan, N. Spring, D.Wetherall, and T. Anderson. Inferring link weights using end-to-endmeasurements. In IMW, 2002.
18. R. Mahajan, M. Zhang, L. Poole, and V. Pai. Uncovering performance differences among backbone ISPs with Netdiff. In NSDI, 2008.
19. A.Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In MASCOTS, 2001.
20. T. S. E. Ng andH. Zhang. Predicting Internet network distance with coordinates-based approaches. In INFOCOM, 2002.
21. P. Perry and Gallup. Certain problems in election survey methodology. Oxford Journals, 1979.
22. V. Ramasubramanian, D. Malkhi, F. Kuhn, M. Balakrishnan, A. Gupta, and A. Akella. On the Treeness of Internet Latency and Bandwidth. In SIGMETRICS, 2009.
23. D. Romer, K. Kenski, K. Winneg, C. Adasiewicz, andK.H. Jameison. Capturing Campaign Dynamics 2000 & 2004. University of Pennsylvania Press, 2006.
24. H.H. Song, L. Qiu, and Y. Zhang.NetQuest: A flexible framework for large-scale network measurement. In SIGMETRICS, 2006.
25. N. Spring, R. Mahajan, D.Wetherall, and T. Anderson. Measuring ISP topologies with Rocketfuel. IEEE/ACM ToN, 12(1), 2004.
26. D. Stutzbach, R. Rejaie, N. G. Duffield, S. Sen, and W.Willinger. Sampling techniques for large, dynamic graphs. In INFOCOM, 2006.
27. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W.Willinger. Network topology generators: Degree-based vs. structural. In SIGCOMM, 2002.