Software defined traffic measurement with OpenSketch

Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2013

Volumn , Issue , 2013, Pages 29-42

  Yu, Minlan ^a   Jose, Lavanya ^b   Miao, Rui ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS ANALYSIS;

COMMODITY SWITCHES; CONTROL PLANES; DATA PLANES; MEASUREMENT AND CONTROL; MEASUREMENT DATA; NETWORK CONTROL; PACKET TRACES; TRAFFIC MEASUREMENTS;

PIPELINES;

EID: 85076681695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. http://tools.ietf.org/html/ draft-ietf-forces-protocol-22.
2. http://www.cisco.com/en/US/products/ps6601/products_ios_protocol_group_ home.html.
3. cpacket. http://www.cpacket.com/download/cPacket_cvu_family_overview_2011a.pdf/.
4. OpenFlow switch. http://www.openflowswitch.org/.
5. Opensketch code release. https://github.com/lavanyaj/opensketch.git.
6. AL-FARES, RADHAKRISHNAN, M., RAGHAVAN, S., HUANG, B., AND VAHDAT, A. Hedera: Dynamic flow scheduling for data center networks. In NSDI (2010).
7. ALON, N., MATIAS, Y., AND SZEGEDY, M. The space complexity of approximating the frequency moments. In STOC (1996).
8. BANDI, N., METWALLY, A., AGRAWAL, D., AND ABBADI, A. E. Fast data stream algorithms using associative memories. In ACM SIGMOD (2007).
9. BAR-YOSSEF, Z., JAYRAM, T. S., KUMAR, R., SIVAKUMAR, D., AND TREVISAN, L. Counting distinct elements in a data stream. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (London, UK, UK, 2002), RANDOM'02, Springer-Verlag, pp. 1-10.
10. BREMLER-BARR, A., HAY, D., AND KORAL, Y. CompactDFA: Generic state machine compression for scalable pattern matching. In INFOCOM (2010).
11. CARLI, L. D., PAN, Y., KUMAR, A., ESTAN, C., AND SANKARALINGAM, K. PLUG: Flexible lookup modules for rapid deployment of new protocols in high-speed routers. In SIGCOMM (2009).
12. CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. Finding hierarchical heavy hitters in streaming data. ACM Transactions on Knowledge Discovery from Data (Jan. 2008).
13. CORMODE, G., AND MUTHUKRISHNAN, S. An improved data stream summary: The count-min sketch and its applications. J. Algorithms (2005).
14. CORMODE, G., AND MUTHUKRISHNAN, S. Summarizing and mining skewed data streams. In In SIAM Conference on Data Mining (2005).
15. CRANOR, C., JOHNSON, T., SPATASCHEK, O., AND SHKAPENYUK, V. Gigascope: A stream database for network applications. In SIGMOD (2003).
16. CURTIS, A. R., MOGUL, J. C., TOURRILHES, J., YALAGANDULA, P., SHARMA, P., AND BANERJEE, S. Devoflow: Scaling flow management for high-performance networks. In SIGCOMM (2011).
17. DIPERT, B. Special purpose SRAMs smooth the ride. EDN (1999).
18. DUFFIELD, N., LUND, C., AND THORUP, M. Estimating flow distributions from sampled flow statistics. In ACM SIGCOMM (2003).
19. ESTAN, C., KEYS, K., MOORE, D., AND VARGHESE, G. Building a better netflow. ACM SIGCOMM (2004).
20. ESTAN, C., AND VARGHESE, G. New directions in traffic measurement and accounting. ACM SIGCOMM (2002).
21. ESTAN, C., VARGHESE, G., AND FISK, M. Bitmap algorithms for counting active flows on high speed links. In IMC (2003).
22. FLAJOLET, P., AND MARTIN, G. N. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31, 2 (Sept. 1985), 182-209.
23. GOEL, A., AND GUPTA, P. Small subset queries and Bloom filters using ternary associative memories, with applications. In ACM SIGMETRICS (2010).
24. HADJIELEFTHERIOU, M., BYERS, J. W., AND KOLLIOS, G. Robust sketching and aggregation of distributed data streams. Tech. rep., Boston University, 2005.
25. HUANG, G., LALL, A., CHUAH, C.-N., AND XU, J. Uncovering global icebergs in distributed monitors. In IEEE IWQoS (2009).
26. KOMPELLA, R., LEVCHENKO, K., SNOEREN, A., AND VARGHESE, G. Every microsecond counts: Tracking fine-grain latencies with a loss difference aggregator. In ACM SIGCOMM (2009).
27. KUMAR, A., SUNG, M., XU, J., AND WANG, J. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In SIGMETRICS (2004).
28. MAI, J., CHUAH, C.-N., SRIDHARAN, A., YE, T., AND ZANG, H. Is sampled data sufficient for anomaly detection? In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement (New York, NY, USA, 2006), IMC'06, ACM, pp. 165-176.
29. MCKEOWN, N., ANDERSON, T., BALAKRISHNAN, H., PARULKAR, G., PETERSON, L., REX-FORD, J., SHENKER, S., AND TURNER, J. OpenFlow: Enabling innovation in campus networks. ACM Computer Communication Review (Apr. 2008).
30. MEINERS, C. R., PATEL, J., NORIGE, E., TORNG, E., AND LIU, A. X. Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems. In USENIX Security Symposium (2010).
31. MITZENMACHER, M., AND VADHAN, S. Why simple hash functions work: Exploiting the entropy in a data stream. In SODA (2008).
32. MOGUL, J. C., AND CONGDON, P. Hey, you darned counters!: get off my asic! In Proceedings of the first workshop on Hot topics in software defined networks (New York, NY, USA, 2012), HotSDN'12, ACM, pp. 25-30.
33. POPA, L., RATNASAMY, S., AND STOICA, I. Building extensible networks with rule-based forwarding. In OSDI (2010).
34. PǍTRAŞCU, M., AND THORUP, M. The power of simple tabulation hashing. J. ACM 59, 3 (June 2012), 14:1-14:50.
35. SANJUÀS-CUXART, J., BARLET-ROS, P., DUFFIELD, N., AND KOMPELLA, R. R. Sketching the delay: tracking temporally uncorrelated flow-level latencies. In Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference (New York, NY, USA, 2011), IMC'11, ACM, pp. 483-498.
36. SCHWELLER, R., GUPTA, A., PARSONS, E., AND CHEN, Y. Reversible sketches for efficient and accurate change detection over network data streams. In IMC (2004).
37. SEKAR, V., REITER, M. K., AND ZHANG, H. Revisiting the case for a minimalist approach for network flow monitoring. In IMC (2010).
38. SHINDE, R., GOEL, A., GUPTA, P., AND DUTTA, D. Similarity search and locality sensitive hashing using TCAMs. In SIGMOD (2010).
39. THORUP, M., AND ZHANG, Y. Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation. SIAM J. Comput. 41, 2 (Apr. 2012), 293-331.
40. VENKATARAMAN, S., SONG, D., GIBBONS, P. B., AND BLUM, A. New streaming algorithms for fast detection of superspreaders. In Network and Distributed System Security Symposium (2005).
41. WALSWORTH, C., ABEN, E., KC CLAFFY, AND ANDERSEN, D. The CAIDA Anonymized 2009 Internet Traces - Sep. 17 2009. http://www.caida.org/data/passive/passive_2009_dataset.xml.
42. WANG, M., LI, B., AND LI, Z. sflow: Towards resource-efficient and agile service federation in service overlay networks. Distributed Computing Systems, International Conference on 0 (2004), 628-635.
43. WHANG, K.-Y., VANDER-ZANDEN, B. T., AND TAYLOR, H. M. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst. 15, 2 (June 1990), 208-229.
44. YU, M., JOSE, L., AND MIAO, R. Software defined traffic measurement with opensketch. Tech. rep., USC Technical Report, 2013.
45. YUAN, L., CHUAH, C.-N., AND MOHAPATRA, P. ProgME: Towards programmable network measurement. In ACM SIGCOMM (2007).
46. ZHANG, Y., SINGH, S., SEN, S., DUFFIELD, N., AND LUND, C. Online identification of hierarchical heavy hitters: Algorithms, evaluation, and applications. In IMC (2004).
47. ZHAO, Q., XU, J., AND LIU, Z. Design of a novel statistics counter architecture with optimal space and time efficiency. In ACM SIGMETRICS (2006).
48. ZSEBY, T., ET AL. Sampling and filtering techniques for IP packet selection. http://www.ietf.org/internet-drafts/draft-ietf-psamp-sample-tech-07.txt, July 2005. -Work in progress.