Skip to main content

Algebraic Approaches for Scalable End-to-End Monitoring and Diagnosis

  • Chapter
  • First Online:
Book cover Algorithms for Next Generation Networks

Part of the book series: Computer Communications and Networks ((CCN))

  • 1128 Accesses

Abstract

The rigidity of the Internet architecture led to flourish in the research of end-to-end based systems. In this chapter, we describe a linear algebra-based end-to-end monitoring and diagnosis system. We first propose a tomography-based overlay monitoring system (TOM). Given n end hosts, TOM selectively monitors a basis set of O(nlogn) paths out of all n(n − 1) end-to-end paths. Any end-to-end path can be written as a unique linear combination of paths in the basis set. Consequently, by monitoring loss rates for the paths in the basis set, TOM infers loss rates for all end-to-end paths. Furthermore, leveraging on the scalable measurements from the TOM system, we propose the Least-biased End-to-End Network Diagnosis (in short, LEND) system. We define a minimal identifiable link sequence (MILS) as a link sequence of minimal length whose properties can be uniquely identified from end-to-end measurements. LEND applies an algebraic approach to find out the MILSes and infers the properties of the MILSes efficiently. This also means LEND system achieves the finest diagnosis granularity under the least biased statistical assumptions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adams, A., et al.: The use of end-to-end multicast measurements for characterizing internal network behavior. In: IEEE Communications (May, 2000)

    Google Scholar 

  2. Akamai Inc.: Technology overview. http://www.akamai.com/en/html/technology/overview.html

  3. Anagnostakis, K., Greenwald, M., Ryger, R.: cing: Measuring network-internal delays using only existing infrastructure. In: IEEE INFOCOM (2003)

    Google Scholar 

  4. Anderson, E., et al.: LAPACK Users’ Guide, third edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)

    Book  Google Scholar 

  5. Bu, T., Duffield, N., Presti, F., Towsley, D.: Network tomography on general topologies. In: ACM SIGMETRICS (2002)

    Google Scholar 

  6. Caceres, R., Duffield, N., Horowitz, J., Towsley, D.: Multicast-based inference of network-internal loss characteristics. IEEE Transactions in Information Theory 45 (1999)

    Google Scholar 

  7. Caceres, R., Duffield, N., Horowitz, J., Towsley, D., Bu, T.: Multicast-based inference of network-internal characteristics: Accuracy of packet loss estimation. In: IEEE INFOCOM (1999)

    Google Scholar 

  8. Chen, Y., Bindel, D., Katz, R.H.: Tomography-based overlay network monitoring. In: ACM SIGCOMM Internet Measurement Conference (IMC) (2003)

    Google Scholar 

  9. Chen, Y., Bindel, D., Song, H., Katz, R.H.: An algebraic approach to practical and scalable overlay network monitoring. In: ACM SIGCOMM (2004)

    Google Scholar 

  10. Chen, Y., Lim, K., Overton, C., Katz, R.H.: On the stability of network distance estimation. In: ACM SIGMETRICS Performance Evaluation Review (PER) (Sep. 2002)

    Google Scholar 

  11. Chua, D.B., Kolaczyk, E.D., Crovella, M.: Efficient monitoring of end-to-end network properties. In: IEEE INFOCOM (2005)

    Google Scholar 

  12. Coates, M., Hero, A., Nowak, R., Yu, B.: Internet Tomography. IEEE Signal Processing Magazine 19(3), 47–65 (2002)

    Article  Google Scholar 

  13. Demmel, J.: Applied Numerical Linear Algebra. SIAM (1997)

    Google Scholar 

  14. Duffield, N.: Simple network performance tomography. In: ACM SIGCOMM Internet Measurement Conference (IMC) (2003)

    Google Scholar 

  15. Duffield, N., Horowitz, J., Towsley, D., Wei, W., Friedman, T.: Multicast-based loss inference with missing data. IEEE Journal of Selected Areas of Communications 20(4) (2002)

    Google Scholar 

  16. Duffield, N., Presti, F., Paxson, V., Towsley, D.: Inferring link loss using striped unicast probes. In: IEEE INFOCOM (2001)

    Google Scholar 

  17. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1(4) (1993)

    Google Scholar 

  18. Francis, P., et al.: IDMaps: A global Internet host distance estimation service. IEEE/ACM Trans. on Networking (2001)

    Google Scholar 

  19. Golub, G., Loan, C.V.: Matrix Computations. The Johns Hopkins University Press (1989)

    Google Scholar 

  20. Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: IEEE INFOCOM (2000)

    Google Scholar 

  21. Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: User-level internet path diagnosis. In: ACM SOSP (2003)

    Google Scholar 

  22. Medina, A., Matta, I., Byers, J.: On the origin of power laws in Internet topologies. In: ACM Computer Communication Review (2000)

    Google Scholar 

  23. Ng, T.S.E., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: Proc.of IEEE INFOCOM (2002)

    Google Scholar 

  24. Ozmutlu, H.C., et al.: Managing end-to-end network performance via optimized monitoring strategies. Journal of Network and System Management 10(1) (2002)

    Google Scholar 

  25. Padmanabhan, V., Qiu, L., Wang, H.: Server-based inference of Internet link lossiness. In: IEEE INFOCOM (2003)

    Google Scholar 

  26. PlanetLab: http://www.planet-lab.org/

  27. R.A.Brualdi, Pothen, A., Friedland, S.: The sparse basis problem and multilinear algebra. SIAM Journal of Matrix Analysis and Applications 16, 1–20 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  28. Ratnasamy, S., et al.: Topologically-aware overlay construction and server selection. In: Proc. of IEEE INFOCOM (2002)

    Google Scholar 

  29. Shavitt, Y., Sun, X., Wool, A., Yener, B.: Computing the unmeasured: An algebraic approach to Internet mapping. In: IEEE INFOCOM (2001)

    Google Scholar 

  30. Song, H., Qiu, L., Zhang, Y.: Netquest: A flexible framework for lange-scale netork measurement. In: ACM SIGMETRICS (June 2006)

    Google Scholar 

  31. Tang, C., McKinley, P.: On the cost-quality tradeoff in topology-aware overlay path probing. In: IEEE ICNP (2003)

    Google Scholar 

  32. Zhang, Y., et al.: On the constancy of Internet path properties. In: Proc. of SIGCOMM IMW (2001)

    Google Scholar 

  33. Zhao, Y., Chen, Y.: A suite of schemes for user-level network diagnosis without infrastructure. In: IEEE INFOCOM (2007)

    Google Scholar 

  34. Zhao, Y., Chen, Y., Bindel, D.: Towards unbiased end-to-end network diagnosis. In: ACM SIGCOMM (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yao Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Zhao, Y., Chen, Y. (2010). Algebraic Approaches for Scalable End-to-End Monitoring and Diagnosis. In: Cormode, G., Thottan, M. (eds) Algorithms for Next Generation Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-765-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-765-3_14

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-764-6

  • Online ISBN: 978-1-84882-765-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics