skip to main content
10.1145/1402958.1402971acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free Access

Answering what-if deployment and configuration questions with wise

Published:17 August 2008Publication History

ABSTRACT

Designers of content distribution networks often need to determine how changes to infrastructure deployment and configuration affect service response times when they deploy a new data center, change ISP peering, or change the mapping of clients to servers. Today, the designers use coarse, back-of-the-envelope calculations, or costly field deployments; they need better ways to evaluate the effects of such hypothetical "what-if" questions before the actual deployments. This paper presents What-If Scenario Evaluator (WISE), a tool that predicts the effects of possible configuration and deployment changes in content distribution networks. WISE makes three contributions: (1) an algorithm that uses traces from existing deployments to learn causality among factors that affect service response-time distributions; (2) an algorithm that uses the learned causal structure to estimate a dataset that is representative of the hypothetical scenario that a designer may wish to evaluate, and uses these datasets to predict future response-time distributions; (3) a scenario specification language that allows a network designer to easily express hypothetical deployment scenarios without being cognizant of the dependencies between variables that affect service response times. Our evaluation, both in a controlled setting and in a real-world field deployment at a large, global CDN, shows that WISE can quickly and accurately predict service response-time distributions for many practical What-If scenarios.

References

  1. Akamai Technologies. www.akamai.comGoogle ScholarGoogle Scholar
  2. M. Arlitt, B. Krishnamurthy, J. Mogul. Predicting Short-transfer Latency from TCP Arcana: A Trace-based Validation. IMC'2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. A. Barroso, J. Dean, U. Holzle. Web Search for a Planet: The Google Cluster Architecture. IEEE Micro. Vol. 23, No. 2. pp 22--28 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Bahl, R. Chandra, A. Greenberg, S. Kandula, D. Maltz, M. Zhang. Towards Highly Reliable Enterprise Network Services via Inference of Multi-level Dependencies. ACM SIGCOMM 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. Cardwell, S. Savage, T. Anderson. Modeling TCP Latency. IEEE Infocomm 2000.Google ScholarGoogle Scholar
  6. G. Cooper. A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships. Data Mining and Knowledge Discovery 1, 203--224. 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Emulab Network Testbed. http://www.emulab.netGoogle ScholarGoogle Scholar
  8. N. Feamster and J. Rexford. Network-Wide Prediction of BGP Routes. IEEE/ACM Transactions on Networking. Vol. 15. pp. 253--266 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Freedman, E. Freudenthal, D. Mazieres. Democratizing Content Publication with Coral. USENIX NSDI 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Gray, A. Moore, 'N-Body' Problems in Statistical Learning. Advances in Neural Information Processing Systems 13. 2000.Google ScholarGoogle Scholar
  11. Lucene Hadoop. http://lucene.apache.org/hadoop/Google ScholarGoogle Scholar
  12. Q. He, C. Dovrolis, M. Ammar. On the Predictability of Large Transfer TCP Throughput. ACM SIGCOMM 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Barbir, et al. Known Content Network Request Routing Mechanisms. IETF RFC 3568. July 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Kandula, D. Katabi, J. Vasseur. Shrink: A Tool for Failure Diagnosis in IP Networks. MineNet Workshop SIGCOMM 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Kompella, J. Yates, A. Greenberg, A. Snoeren. IP Fault Localization Via Risk Modeling. USENIX NSDI 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. USENIX OSDI 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Mirza, J. Sommers, P. Barford, X. Zhu. A Machine Learning Approach to TCP Throughput Prediction. ACM SIGMETRICS 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Netezza http://www.netezza.com/Google ScholarGoogle Scholar
  19. J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP Throughput: A Simple Model and its Empirical Validation. IEEE/ACM Transactions on Networking. Vol 8. pp. 135--145 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Pearl. Causality: Models, Reasoning, and Inference. Cambridge University Press. 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. I. Rish, M. Brodie, S. Ma. Efficient Fault Diagnosis Using Probing. AAAI Spring Symposium on DMDP. 2002.Google ScholarGoogle Scholar
  22. R. Pike, S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal. Vol. 13. pp. 227--298. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. P. Sprites, C. Glymour. An Algorithm for fast recovery of sparse causal graphs. Social Science Computer Review 9. USENIX Symposium on Internet Technologies and Systems. 1997.Google ScholarGoogle Scholar
  24. M. Tariq, A. Zeitoun, V. Valancius, N. Feamster, M. Ammar. Answering "What-if" Deployment and Configuration Questions with WISE. Georgia Tech Technical Report GT-CS-08-02. February 2008.Google ScholarGoogle Scholar
  25. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer Texts in Statistics. 2003.Google ScholarGoogle Scholar
  26. J. Wolberg. Data Analysis Using the Method of Least Squares. Springer. Feb 2006.Google ScholarGoogle Scholar

Index Terms

  1. Answering what-if deployment and configuration questions with wise

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication
      August 2008
      452 pages
      ISBN:9781605581750
      DOI:10.1145/1402958
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 38, Issue 4
        October 2008
        436 pages
        ISSN:0146-4833
        DOI:10.1145/1402946
        Issue’s Table of Contents

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 17 August 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate528of3,309submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader