Measuring Large Traffic Aggregates on Commodity Switches Lavanya Jose, Minlan Yu, Jennifer Rexford Princeton University, NJ 1.

Slides:



Advertisements
Similar presentations
Towards Software Defined Cellular Networks
Advertisements

SIMPLE-fying Middlebox Policy Enforcement Using SDN
Programming Protocol-Independent Packet Processors
VCRIB: Virtual Cloud Rule Information Base Masoud Moshref, Minlan Yu, Abhishek Sharma, Ramesh Govindan HotCloud 2012.
New Directions in Traffic Measurement and Accounting Cristian Estan – UCSD George Varghese - UCSD Reviewed by Michela Becchi Discussion Leaders Andrew.
Nanxi Kang Princeton University
Programmable Measurement Architecture for Data Centers Minlan Yu University of Southern California 1.
OpenSketch Slides courtesy of Minlan Yu 1. Management = Measurement + Control Traffic engineering – Identify large traffic aggregates, traffic changes.
PARIS: ProActive Routing In Scalable Data Centers Dushyant Arora, Theophilus Benson, Jennifer Rexford Princeton University.
A Fast and Compact Method for Unveiling Significant Patterns in High-Speed Networks Tian Bu 1, Jin Cao 1, Aiyou Chen 1, Patrick P. C. Lee 2 Bell Labs,
Incremental Consistent Updates Naga Praveen Katta Jennifer Rexford, David Walker Princeton University.
OpenFlow-Based Server Load Balancing GoneWild
Scalable Flow-Based Networking with DIFANE 1 Minlan Yu Princeton University Joint work with Mike Freedman, Jennifer Rexford and Jia Wang.
Flowspace revisited OpenFlow Basics Flow Table Entries Switch Port MAC src MAC dst Eth type VLAN ID IP Src IP Dst IP Prot L4 sport L4 dport Rule Action.
Profiling Network Performance in Multi-tier Datacenter Applications
1 Reversible Sketches for Efficient and Accurate Change Detection over Network Data Streams Robert Schweller Ashish Gupta Elliot Parsons Yan Chen Computer.
1 13-Jun-15 S Ward Abingdon and Witney College LAN design CCNA Exploration Semester 3 Chapter 1.
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:
Reverse Hashing for High-speed Network Monitoring: Algorithms, Evaluation, and Applications Robert Schweller 1, Zhichun Li 1, Yan Chen 1, Yan Gao 1, Ashish.
Reverse Hashing for Sketch Based Change Detection in High Speed Networks Ashish Gupta Elliot Parsons with Robert Schweller, Theory Group Advisor: Yan Chen.
PegaSys : Princeton Enterprise GENI System Michael Freedman, Scott Karlin, Larry Peterson, Jennifer Rexford, and Chris Tengi.
1 Wire Speed Packet Classification Without TCAMs: A Few More Registers (And A Bit of Logic) Are Enough Author: Qunfeng Dong, Suman Banerjee, Jia Wang, Dheeraj.
Dream Slides Courtesy of Minlan Yu (USC) 1. Challenges in Flow-based Measurement 2 Controller Configure resources1Fetch statistics2(Re)Configure resources1.
DREAM: Dynamic Resource Allocation for Software-defined Measurement
Fast and Robust Worm Detection Algorithm Tian Bu Aiyou Chen Scott Vander Wiel Thomas Woo bearhsu.
FlowSense: Monitoring Network Utilization with Zero Measurement Cost Curtis Yu 1, Cristian Lumezanu 2, Yueping Zhang 2, Vishal Singh 2, Guofei Jiang 2,
Languages for Software-Defined Networks Nate Foster, Arjun Guha, Mark Reitblatt, and Alec Story, Cornell University Michael J. Freedman, Naga Praveen Katta,
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.
Software-defined Measurement
September RTC-Mon Enabling High-Speed and Extensible Real-Time Communications Monitoring Diego Costantini, Felipe Huici
Cellular Core Network Architecture
Enabling Innovation Inside the Network Jennifer Rexford Princeton University
OpenFlow-Based Server Load Balancing GoneWild Author : Richard Wang, Dana Butnariu, Jennifer Rexford Publisher : Hot-ICE'11 Proceedings of the 11th USENIX.
Software-Defined Networks Jennifer Rexford Princeton University.
SIGCOMM 2002 New Directions in Traffic Measurement and Accounting Focusing on the Elephants, Ignoring the Mice Cristian Estan and George Varghese University.
OpenFlow: Enabling Innovation in Campus Networks
Wire Speed Packet Classification Without TCAMs ACM SIGMETRICS 2007 Qunfeng Dong (University of Wisconsin-Madison) Suman Banerjee (University of Wisconsin-Madison)
Resource/Accuracy Tradeoffs in Software-Defined Measurement Masoud Moshref, Minlan Yu, Ramesh Govindan HotSDN’13.
1 LD-Sketch: A Distributed Sketching Design for Accurate and Scalable Anomaly Detection in Network Data Streams Qun Huang and Patrick P. C. Lee The Chinese.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Measurement COS 597E: Software Defined Networking.
Online Identification of Hierarchical Heavy Hitters Yin Zhang Joint work with Sumeet SinghSubhabrata Sen Nick DuffieldCarsten Lund.
Programming Languages for Software Defined Networks Jennifer Rexford and David Walker Princeton University Joint work with the.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
A Smart Pre-Classifier to Reduce Power Consumption of TCAMs for Multi-dimensional Packet Classification Yadi Ma, Suman Banerjee University of Wisconsin-Madison.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
CellSDN: Software-Defined Cellular Core networks Xin Jin Princeton University Joint work with Li Erran Li, Laurent Vanbever, and Jennifer Rexford.
Yaping Zhu with: Jennifer Rexford (Princeton University) Aman Shaikh and Subhabrata Sen (ATT Research) Route Oracle: Where Have.
SIMPLE-fying Middlebox Policy Enforcement Using SDN
Jennifer Rexford Princeton University MW 11:00am-12:20pm SDN Programming Languages COS 597E: Software Defined Networking.
Packet Classification Using Multidimensional Cutting Sumeet Singh (UCSD) Florin Baboescu (UCSD) George Varghese (UCSD) Jia Wang (AT&T Labs-Research) Reviewed.
IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo a, Jose G. Delgado-Frias Publisher: Journal of Systems.
SCREAM: Sketch Resource Allocation for Software-defined Measurement Masoud Moshref, Minlan Yu, Ramesh Govindan, Amin Vahdat (CoNEXT’15)
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
SketchVisor: Robust Network Measurement for Software Packet Processing
Constant Time Updates in Hierarchical Heavy Hitters
CacheFlow: Dependency-Aware Rule-Caching for Software-Defined Networks
Jennifer Rexford Princeton University
FlowRadar: A Better NetFlow For Data Centers
DDoS Attack Detection under SDN Context
Optimal Elephant Flow Detection Presented by: Gil Einziger,
Enabling Innovation Inside the Network
SCREAM: Sketch Resource Allocation for Software-defined Measurement
Programmable Networks
Memento: Making Sliding Windows Efficient for Heavy Hitters
Constant Time Updates in Hierarchical Heavy Hitters
Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Ori Rottenstreich
Lu Tang , Qun Huang, Patrick P. C. Lee
Enabling Innovation Inside the Network
Elmo Muhammad Shahbaz Lalith Suresh, Jennifer Rexford, Nick Feamster,
Presentation transcript:

Measuring Large Traffic Aggregates on Commodity Switches Lavanya Jose, Minlan Yu, Jennifer Rexford Princeton University, NJ 1

Motivation Large traffic aggregates?  manage traffic efficiently  understand traffic structure  detect unusual activity 2

Aggregate at fixed prefix-length? Top 10 /24 prefixes (by how much traffic they send)  could miss individual heavy users Top 10 IP addresses …  could miss heavy subnets where each individual user is small 3

** 000* **010*011* 01** 40 0*** 0 1*** 40 **** All the IP prefixes >= a fraction T of the link capacity Aggregate at all prefix-lengths? (Heavy Hitters) HH: sends more than T= 10% of link cap

Hierarchical Heavy Hitters All the IP prefixes >= a fraction T of the link capacity after excluding any HHH descendants ** 000* **010*011* 01** 40 0*** 0 1*** 40 **** HH: sends more than T= 10% of link cap. 100 HHH: 5

Related Work Offline analysis on raw packet trace [ AutoFocus ]  accurate but slow and expensive Streaming algorithms on Custom Hardware [ Cormode’08, Bandi’07, Zhang’04, Sketch-Based ]  accurate, fast but not commodity Our Work: Commodity, fast and relatively accurate 6

Why commodity switches?  cheap, easy to deploy  let “network elements monitor themselves” Commodity OpenFlow switches  available from multiple vendors (HP, NEC, and Quanta)  deployed in campuses, backbone networks  wildcard rules with counters to measure traffic PriorityPrefix RuleCount *** * ****... 5 HHH on Commodity- Using OpenFlow 7

TCAM Controller Software Fetch Counts Install Rules Constraints  <= N Prefix Rules SRC IP SRC IP increment count PriorityPrefix RuleCount *** * **** 5 OpenFlow Measurement Framework 8 Switch  Measuring Interval M  No pkts to Controller

Monitoring HHHes ** 000* **010*011* 01** 40 0*** 0 1*** 40 **** PriorityPrefix RuleCount *12 3 0***17 HHH: after excluding any descendant prefix rules TCAM: priority matching 9

Detecting New HHHes Monitor children of HHHes Use at most 2/T rules ** 000* **010*011* 01** 40 0*** 0 1*** 40 ****

Iteratively adjust wildcard rules:  Expand If count > T, install rule for child instead.  Collapse If count < T, remove rule. 0*** **** 00** 000*001* 01** 010*011* 1*** 10**11** 100*101*110*111* ** 000* **10**11** 01** 80 0*** PriorityPrefix RuleCount 1 0***80 2 ****0 PriorityPrefix RuleCount 1 001* *5 3 ****3 PriorityPrefix RuleCount 1 00** **3 3 ****0 Identifying New HHHes 11

Using Leftover Rules Why left over rules?  May not be 1/T HHHes.  May still be discovering new HHHes How to use leftover rules?  To monitor HHHes close to threshold  Data shows 2-3 new HHHes/ interval (a few secs) ** 000* **010*011* 01** 40 0*** 0 1*** 40 ****

Real packet trace (400K pkts/ sec) from CAIDA  Measured HHHes for T=5% and T=10%  Measuring interval M from 1-60s Evaluation - Method 13

Evaluation - Results 20 rules to identify 88-94% of the 10%- HHHes Accurate  Gets ~9 out of 10 HHHes  Uses left over TCAM space to quickly find HHHes  Large traffic aggregates usually stable Fast  Takes a few intervals for 1-2 new HHHes  Meanwhile aggregates at coarse levels *

Stepping back… not just for HHHes Framework  Adjusting <= N wildcard rules  Every measuring interval M  Only match and increment per packet Can solve problems that require  Understanding a baseline of normal traffic  Quickly pinpointing large traffic aggregates 15

Conclusion Solving HHH problem with OpenFlow  Relatively accurate, Fast, Low overhead  Algorithm with expanding /collapsing Future work  multidimensional HHH  Generic framework for measurement Explore algorithms for DoS, large traffic changes etc. Understand overhead Combine results from different switches 16