Abstract
We propose a practical technique for the identification of lossy network links. Our scheme is based on a function that computes the likelihood of each link to be lossy. This function mainly depends on the number of times a link appears in lossy paths and on the relative loss rates of these paths. Preliminary simulation results show that our solution achieves accuracy comparable to statistical methods (e.g. Bayesian) at significantly lower running time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rabbat, M., Nowak, R., Coates, M.J.: Multiple Source, Multiple Destination Network Tomography. In: Proceedings of IEEE INFOCOM (April 2004)
Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: User-level Internet Path Diagnosis. In: Proceedings of SOSP 2003 (October 2003)
Padmanabhan, V., Qiu, L., Wang, H.J.: Server-based Inference of Internet Link Lossines. In: Proceedings of IEEE INFOCOM 2003 (April 2003)
Duffield, N.: Simple Network Performance Tomography. In: Proceedings of Internet Measurement Conference (IMC) 2003 (October 2003)
Liang, G., Nowak, R., Castro, R., Coates, M.J., Yu, B.: Internet Tomography: Recent Developments. Statistical Science (March 2004)
Zhang, Y., Duffield, N., Paxson, V., Shenker, S.: On the Constancy of Internet Path Properties. In: Proceedings ACM SIGCOMM Internet Measurement Workshop (November 2001)
Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: An approach to universal topology generation. In: Proceedings of MASCOTS 2001 (August 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batsakis, A., Malik, T., Terzis, A. (2005). Practical Passive Lossy Link Inference. In: Dovrolis, C. (eds) Passive and Active Network Measurement. PAM 2005. Lecture Notes in Computer Science, vol 3431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31966-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-31966-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25520-8
Online ISBN: 978-3-540-31966-5
eBook Packages: Computer ScienceComputer Science (R0)