skip to main content
research-article

DREAM: dynamic resource allocation for software-defined measurement

Authors Info & Claims
Published:17 August 2014Publication History
Skip Abstract Section

Abstract

Software-defined networks can enable a variety of concurrent, dynamically instantiated, measurement tasks, that provide fine-grain visibility into network traffic. Recently, there have been many proposals to configure TCAM counters in hardware switches to monitor traffic. However, the TCAM memory at switches is fundamentally limited and the accuracy of the measurement tasks is a function of the resources devoted to them on each switch. This paper describes an adaptive measurement framework, called DREAM, that dynamically adjusts the resources devoted to each measurement task, while ensuring a user-specified level of accuracy. Since the trade-off between resource usage and accuracy can depend upon the type of tasks, their parameters, and traffic characteristics, DREAM does not assume an a priori characterization of this trade-off, but instead dynamically searches for a resource allocation that is sufficient to achieve a desired level of accuracy. A prototype implementation and simulations with three network-wide measurement tasks (heavy hitter, hierarchical heavy hitter and change detection) and diverse traffic show that DREAM can support more concurrent tasks with higher accuracy than several other alternatives.

References

  1. http://news.netcraft.com/archives/2013/05/20/amazon-web-services-growth-unrelenting.html.Google ScholarGoogle Scholar
  2. Amazon CloudWatch. http://aws.amazon.com/cloudwatch/.Google ScholarGoogle Scholar
  3. CAIDA Anonymized Internet Traces 2012. http://www.caida.org/data/passive/passive_2012_dataset.xml.Google ScholarGoogle Scholar
  4. Floodlight. http://www.projectfloodlight.org/floodlight/.Google ScholarGoogle Scholar
  5. Open vSwitch. http://openvswitch.org/.Google ScholarGoogle Scholar
  6. Pica8 P-3290 switch. http://www.pica8.com/documents/pica8-datasheet-48x1gbe-p3290-p3295.pdf.Google ScholarGoogle Scholar
  7. M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: Dynamic Flow Scheduling for Data Center Networks. In NSDI, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Alizadeh, S. Yang, M. Sharif, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. pFabric: Minimal Near-optimal Datacenter Transport. In SIGCOMM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. M. Azab, P. Ning, and X. Zhang. SICE: A Hardware-level Strongly Isolated Computing Environment for x86 Multi-core Platforms. In CCS, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Ballani, P. Costa, T. Karagiannis, and A. I. Rowstron. Towards Predictable Datacenter Networks. In SIGCOMM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Benson, A. Anand, A. Akella, and M. Zhang. MicroTE: Fine Grained Traffic Engineering for Data Centers. In CoNEXT, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. K. Chen, A. Singla, A. Singh, K. Ramachandran, L. Xu, Y. Zhang, X. Wen, and Y. Chen. OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility. In NSDI, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Y. Chen, R. Griffith, J. Liu, R. H. Katz, and A. D. Joseph. Understanding TCP Incast Throughput Collapse in Datacenter Networks. In WREN, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. R. Chowdhury, M. F. Bari, R. Ahmed, and R. Boutaba. PayLess: A Low Cost Network Monitoring Framework for Software Defined Networks. In IEEE/IFIP NOMS, 2014.Google ScholarGoogle Scholar
  15. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Finding Hierarchical Heavy Hitters in Data Streams. In VLDB, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Cormode and S. Muthukrishnan. An Improved Data Stream Summary: The Count-Min Sketch and its Applications. Journal of Algorithms, 55(1), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. G. Cormode and S. Muthukrishnan. Summarizing and Mining Skewed Data Streams. In SIAM Conference on Data Mining (SDM), 2005.Google ScholarGoogle Scholar
  18. C. Cranor, T. Johnson, O. Spataschek, and V. Shkapenyuk. Gigascope: a Stream Database for Network Applications. In SIGMOD, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Curtis, J. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, and S. Banerjee. DevoFlow: Scaling Flow Management for High-Performance Networks. In SIGCOMM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting. SIGCOMM Computer Communication Review, 32(4):323--336, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving Traffic Demands for Operational IP Networks: Methodology and Experience. Transactions on Networking, 9(3), 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. Gandhi, H. Liu, Y. Hu, G. Lu, J. Padhye, L. Yuan, and M. Zhang. Duet: Cloud Scale Load Balancing with Hardware and Software. In SIGCOMM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Y. Huang, K. Yocum, and A. C. Snoeren. High-fidelity Switch Models for Software-defined Network Emulation. In HotSDN, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, et al. B4: Experience with a Globally-deployed Software Defined WAN. In SIGCOMM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. L. Jose, M. Yu, and J. Rexford. Online Measurement of Large Traffic Aggregates on Commodity Switches. In Hot-ICE, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. F. Khan, N. Hosein, C.-N. Chuah, and S. Ghiasi. Streaming Solutions for Fine-Grained Network Traffic Measurements and Analysis. In ANCS, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. A. Kumar, M. Sung, J. J. Xu, and J. Wang. Data Streaming Algorithms for Efficient and Accurate Estimation of Flow Size Distribution. In SIGMETRICS, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang. Data Streaming Algorithms for Estimating Entropy of Network Traffic. In SIGMETRICS/Performance, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Meng, A. K. Iyengar, I. M. Rouvellou, and L. Liu. Volley: Violation Likelihood Based State Monitoring for Dataceners. ICDCS, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. M. Mitzenmacher, T. Steinke, and J. Thaler. Hierarchical Heavy Hitters with the Space Saving Algorithm. arXiv:1102.5540, 2011.Google ScholarGoogle Scholar
  31. M. Moshref, M. Yu, and R. Govindan. Resource/Accuracy Tradeoffs in Software-Defined Measurement. In HotSDN, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. M. Moshref, M. Yu, R. Govindan, and A. Vahdat. DREAM: Dynamic Resource Allocation for Software-defined Measurement. Technical Report 14-945, Computer Science, USC, 2014. http://www.cs.usc.edu/assets/007/91037.pdf.Google ScholarGoogle Scholar
  33. V. Sekar, N. G. Duffield, O. Spatscheck, J. E. van der Merwe, and H. Zhang. LADS: Large-scale Automated DDoS Detection System. In ATC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen. CSAMP: A System for Network-Wide Flow Monitoring. In NSDI, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. V. Sekar, M. K. Reiter, and H. Zhang. Revisiting the Case for a Minimalist Approach for Network Flow Monitoring. In IMC, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. V. V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Inc., 2001. Google ScholarGoogle ScholarCross RefCross Ref
  37. Z. Wang and X. Jiang. Hypersafe: A Lightweight Approach to Provide Lifetime Hypervisor Control-flow Integrity. In SP, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. D. Xie, N. Ding, Y. C. Hu, and R. Kompella. The Only Constant is Change: Incorporating Time-varying Network Reservations in Data Centers. SIGCOMM Computer Communication Review, 42(4), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. M. Yu, L. Jose, and R. Miao. Software Defined Traffic Measurement with OpenSketch. In NSDI, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. L. Yuan, C.-N. Chuah, and P. Mohapatra. ProgME: Towards Programmable Network MEasurement. Transactions on Networking, 19(1), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Y. Zhang. An Adaptive Flow Counting Method for Anomaly Detection in SDN. In CoNEXT, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Y. Zhang, S. Singh, S. Sen, N. Duffield, and C. Lund. Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications. In IMC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. DREAM: dynamic resource allocation for software-defined measurement

      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

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 44, Issue 4
        SIGCOMM'14
        October 2014
        672 pages
        ISSN:0146-4833
        DOI:10.1145/2740070
        Issue’s Table of Contents

        Copyright © 2014 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 2014

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader