Skip to main content

Using Non-random Associations for Predicting Latency in WANs

  • Conference paper
Web Information Systems Engineering – WISE 2005 (WISE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3806))

Included in the following conference series:

  • 1180 Accesses

Abstract

In this paper, we propose a scalable performance management tool for Wide Area Applications. Our objective is to scalably identify non-random associations between pairs of individual Latency Profiles (iLPs) (i.e., latency distributions experienced by clients when connecting to a server) and exploit them in latency prediction. Our approach utilizes Relevance Networks (RNs) to manage tens of thousands of iLPs. Non-random associations between iLPs can be identified by topology-independent measures such as correlation and mutual information. We demonstrate that these non-random associations do indeed have a significant impact in improving the error of latency prediction.

This research is supported by NSF Grants IIS0219909 and EIA0130422.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.appliant.com/default.asp

  2. http://www.keynote.com/services/html/product_lib.html

  3. Krishnamurthy, B., Wang, J.: On network-aware clustering of web clients. In: Proc. SIGComm, pp. 97–110 (2000)

    Google Scholar 

  4. Li, W.: Mutual information functions versus correlation functions. Journal of Statistical Physics (60) (1990)

    Google Scholar 

  5. Mao, Z., Cranor, C., Douglis, F., Rabinovich, M., Spatscheck, O., Wang, J.: A precise and efficient evaluation of the proximity between web clients and their local dns servers (2002)

    Google Scholar 

  6. Mendenhall, W., Sincich, T.: Statistics for Engineering and the Sciences. Macmillan Publishing, Basingstoke (1985)

    Google Scholar 

  7. Ng, E.N., Zhang, H.: Towards global network positioning. In: Proceedings of ACM SIGCOMM Internet Measurement Workshop (2001)

    Google Scholar 

  8. The planetlab home page, http://www.planet-lab.org/

  9. Raschid, L., Wen, H.-F., Gal, A., Zadorozhny, V.: Latency profiles: Performance monitoring for wide area applications. In: Proceedings of the Third IEEE Workshop on Internet Applications (WIAPP 2003), June 2003, San Jose, CA (2003)

    Google Scholar 

  10. Reza, F.: An Introduction to Information Theory. McGraw-Hill, New York (1961)

    Google Scholar 

  11. Rubenstein, D., Kurose, J., Towsley, D.: Detecting shared congestion of flows via end-to-end measurement. In: Proceedings of the ACM SIGMETRICS Conference (2000)

    Google Scholar 

  12. Sacerdoti, F., Katz, M., Massie, M., Culler, D.: Wide area cluster monitoring with ganglia. In: Proceedings of the IEEE Cluster 2003 Conference (2003)

    Google Scholar 

  13. Stemm, M., Seshan, S., Katz, R.: A network measurement architecture for adaptive applications. In: Proceedings of IEEE InfoComm (2000)

    Google Scholar 

  14. Sun, S., Lannom, L.: Handle system overview. IRDM/IRTF Draft (2001), http://www.idrm.org/idrm_drafts.htm

  15. Swany, M., Wolski, R.: Multivariate resource performance forecasting in the network weather service. In: Proceedings of SC 2002 (2002)

    Google Scholar 

  16. Wolski, R.: Dynamically forecasting network performance to support dynamic scheduling using the network weather service. In: Proc. of the 6th High-Performance Distributed Computing Conference (1997)

    Google Scholar 

  17. Zadorozhny, V., Gal, A., Raschid, L., Ye, Q.: Wide area performance monitoring using aggregate latencyprofiles. In: Koch, N., Fraternali, P., Wirsing, M. (eds.) ICWE 2004. LNCS, vol. 3140, pp. 386–390. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Zadorozhny, V., Gal, A., Raschid, L., Ye, Q.: Arena: Adaptive distributed catalog infrastructure based on relevance networks. In: Proceedings of the International Conference on Very Large Data Bases (2005)

    Google Scholar 

  19. Zadorozhny, V., Raschid, L., Zhan, T., Bright, L.: Validating an access cost model for wide area applications. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, p. 371. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zadorozhny, V., Raschid, L., Gal, A., Ye, Q., Murthy, H. (2005). Using Non-random Associations for Predicting Latency in WANs. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, JY., Sheng, Q.Z. (eds) Web Information Systems Engineering – WISE 2005. WISE 2005. Lecture Notes in Computer Science, vol 3806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581062_48

Download citation

  • DOI: https://doi.org/10.1007/11581062_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30017-5

  • Online ISBN: 978-3-540-32286-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics