Skip to main content
SpringerLink
Log in

Efficient Loss Inference Algorithm Using Unicast End-to-End Measurements

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

We address the problem of loss rates inference from end-to-end unicast measurements. Like other network tomography problems, it requires solving a system of equations that involve measurement values and the loss rates of links. However, the equations do not have a unique solution in general. One kind of method imposes unrealistic assumption on the system, e.g. the uniform prior probability of a link being congested. Other methods use multiple probe measurements to acquire more information about the system that may generate many additional overhead costs. In this paper, we demonstrate that a considerable portion (more than 95 %) of links could be uniquely identified by current measurements directly. Then we utilize the information of these determined links to acquire the global distribution of the system that can help to infer the rest loss rates. Moreover, we derive an upper bound on the accuracy of a congestion localization problem using the Bayesian network that provides a necessary condition for achieving the 0—error diagnosis. Finally, we evaluate our new method and a former representative method by both the simulation and the real implementation in the PlanetLab network. The results show that our method not only makes a great improvement on the accuracy, but also reduces the probe costs and the running time to an extremely low level. Furthermore, our method can also perform well in large and more congested networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: User-level internet path diagnosis. ACM Symposium on Operating Systems Principles, pp. 106–119. New York, USA (2003)

  2. Anagnostakis, K., Greenwald, M., Ryger, R., Cing.: Measuring network-internal delays using only existing infrastructure. Proceedings of the IEEE International Conference on Computer Communications. California, USA (2003)

  3. Nguyen, H.X., Thiran, P.: Network loss inference with second order statistics of end-to-end flows. Proceedings of the ACM Internet Measurement Conference, pp. 227–240. New York, USA (2007)

  4. Duffield, N.G.: Network tomography of binary network performance characteristic. IEEE Trans. Inf. Theory 52(12), 5373–5388 (2006)

    Article  MathSciNet  Google Scholar 

  5. Adams, A., Bu, T., Friedman, T., Horowitz, J.: The use of end-to-end multicast measurements for characterizing internal network behavior. IEEE Commun. Mag. 38(5), 152–159 (2000)

    Article  Google Scholar 

  6. Bu, T., Duffield, N., Presti, F.L., Towsley, D.: Network tomography on general topologies. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems, pp. 21–30. California, USA (2002)

  7. Caceres, R., Duffield, N.G., Horowitz, J., Towsley, D.: Multicast-based inference of network-internal loss characteristics. IEEE Trans. Inf. Theory 45(7), 2462–2480 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen, Y., Bindel, D., Song, H., Katz, R.H.: Network tomography: Identifiability and fourier domain estimation. Proceedings of the IEEE International Conference on Computer Communications, pp. 1875–1883. Alaska, USA (2007)

  9. Coates, M., Nowak, R.: Network loss inference using unicast end-to-end measurement. Proceedings of the ITC specialist seminar IP traffic measurement, modeling and management. California, USA (2000)

  10. Duffield, N., Presti, F.L., Paxson, V., Towsley, D.: Inferring link loss using striped unicast probes. Proceedings of the IEEE International Conference on Computer Communications, vol. 2, pp. 915–923. Alaska, USA (2001)

  11. Nguyen, H.X., Thiran, P.: The boolean solution to the congested IP link location problem: theory and practice. Proceedings of the IEEE International Conference on Computer Communications, pp. 2117–2125. Alaska, USA (2007)

  12. Padmanabhan, V.N., Qiu, L., Wang, H.J.: Server-based inference of internet performance. Proceedings of the IEEE International Conference on Computer Communications, vol. 1, pp. 145–155. California, USA (2003)

  13. Ghita, D., Nguyen, H., Kurant, M., Argyraki, K., Thiran, P.: Netscope: practical network loss tomography. Proceedings of the IEEE International Conference on Computer Communications, pp. 1–9. California, USA (2010)

  14. Zhao, Y., Chen, Y., Bindel, D.: Toward unbiased end-to-end network diagnosis. Proceedings of the ACM Special Interest Group on Data Communication, pp. 219–230. Pisa, Italy (2006)

  15. Y. Zhang, N. Duffield, V. Paxson.: On the constancy of internet path properties. Proceedings of ACM SIGCOMM Internet Measurement Workshop. California, USA (2001)

  16. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mate, Canada (1988)

    Google Scholar 

  17. Qiao, Y., Cheng, L., Qiu, X.S., Meng, L.M.: A methodology used to optimize probe selection for fault localization. IEEE Global Communications Conference. FL, USA (2010)

  18. Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3), 237–252 (1998)

    MATH  Google Scholar 

  19. Shetty, N., Gueye, A., Walrand, J.: A novel approach to Bottleneck analysis in networks. Proceedings of the IEEE Network Operations and Management Symposium, pp. 65–72. Salvador, Bahia (2008)

  20. Linear Complementarity: Linear and Nonlinear Programming. Heldermann Verlag, Berlin, Germany (1988)

    MATH  Google Scholar 

  21. Odintsova, N., Rish, I.: Empirical study of topology effects on diagnosis in computer networks. Proceedings of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems, pp. 1–6. Pisa, Italy (2007)

  22. Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6, 1617–1622 (1988)

    Article  Google Scholar 

  23. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. Massachusetts, pp. 251–262, USA (1999)

  24. Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. University of Michigan, Michigan, USA. CSE-TR-456-02 (2002)

  25. Cheng, L., Qiu, X.S., Meng, L.M., Qiao, Y.: Probabilistic fault diagnosis for IT services in Noisy and dynamic environments. Proceedings of the IEEE/IFIP International Symposium on Integrated Network Management, pp. 149–156. NY, USA (2009)

  26. Cheng, L., Qiu, X.S., Meng, L.M., Qiao, Y.: Efficient active probing for fault diagnosis in large scale and noisy networks. Proceedings of the 29th Conference on Information Communications, pp. 2169–2177. CA, USA. (2010)

  27. Botta, A., de Donato, W., Pescape’, A., Ventre, G.: Discovering Topologies at Router Level: Part II. IEEE Global Communications Conference, Washington, DC, USA (2007)

  28. Augustin, B., Cuvellier, X., Orgogozo, B., Vige, F.: Avoiding Traceroute Anomalies with Paris Traceroute. Proceedings of the 6th ACM SIGCOMM conference on Internet measurement. New York, NY, USA (2006)

  29. Donnet, B.: Internet topology discovery: a survey. IEEE Communications Surveys and Tutorials 9(1–4), 56–69 (2007)

    Article  Google Scholar 

  30. Botta, A., Dainotti, A., Pescap, A.: Do you trust your software-based traffic generator?. IEEE Commun. Mag. 48(9), 158–165 (2010)

    Article  Google Scholar 

  31. Chen, Y., Bindel, D., Song, H., Katz, R.H.: An algebraic approach to practical and scalable overlay network monitoring. Proceedings of the ACM Special Interest Group on Data Communication. Oregon, USA (2004)

Download references

Acknowledgments

Supported by Funds for Creative Research Groups of China, No. 61121061; Supported by the National Natural Science Foundation of China (NSFC), No. 60973108; Supported by 863 Program (2011AA05A116, 2011AA01A102).

Author information

Authors and Affiliations

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Yan Qiao, Xuesong Qiu, Luoming Meng & Ran Gu

Authors
  1. Yan Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuesong Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luoming Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ran Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuesong Qiu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qiao, Y., Qiu, X., Meng, L. et al. Efficient Loss Inference Algorithm Using Unicast End-to-End Measurements. J Netw Syst Manage 21, 169–193 (2013). https://doi.org/10.1007/s10922-012-9231-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-012-9231-7

Keywords

Search

Navigation