Dream Slides Courtesy of Minlan Yu (USC) 1. Challenges in Flow-based Measurement 2 Controller Configure resources1Fetch statistics2(Re)Configure resources1.

Slides:



Advertisements
Similar presentations
SIMPLE-fying Middlebox Policy Enforcement Using SDN
Advertisements

VCRIB: Virtual Cloud Rule Information Base Masoud Moshref, Minlan Yu, Abhishek Sharma, Ramesh Govindan HotCloud 2012.
Programmable Measurement Architecture for Data Centers Minlan Yu University of Southern California 1.
Fast Firewall Implementation for Software and Hardware-based Routers Lili Qiu, Microsoft Research George Varghese, UCSD Subhash Suri, UCSB 9 th International.
Active Learning for Streaming Networked Data Zhilin Yang, Jie Tang, Yutao Zhang Computer Science Department, Tsinghua University.
Fast Algorithms For Hierarchical Range Histogram Constructions
OpenSketch Slides courtesy of Minlan Yu 1. Management = Measurement + Control Traffic engineering – Identify large traffic aggregates, traffic changes.
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,
Author: Nan Hua, Bill Lin, Jun (Jim) Xu, Haiquan (Chuck) Zhao Publisher: ANCS’08 Presenter: Yun-Yan Chang Date:2011/02/23 1.
Estimating TCP Latency Approximately with Passive Measurements Sriharsha Gangam, Jaideep Chandrashekar, Ítalo Cunha, Jim Kurose.
Optimizing Buffer Management for Reliable Multicast Zhen Xiao AT&T Labs – Research Joint work with Ken Birman and Robbert van Renesse.
Scalable Flow-Based Networking with DIFANE 1 Minlan Yu Princeton University Joint work with Mike Freedman, Jennifer Rexford and Jia Wang.
Robust Network Compressive Sensing Lili Qiu UT Austin NSF Workshop Nov. 12, 2014.
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.
Measuring Large Traffic Aggregates on Commodity Switches Lavanya Jose, Minlan Yu, Jennifer Rexford Princeton University, NJ 1.
1 Reversible Sketches for Efficient and Accurate Change Detection over Network Data Streams Robert Schweller Ashish Gupta Elliot Parsons Yan Chen Computer.
Reverse Hashing for High-speed Network Monitoring: Algorithms, Evaluation, and Applications Robert Schweller 1, Zhichun Li 1, Yan Chen 1, Yan Gao 1, Ashish.
1 Energy Efficient Multi-match Packet Classification with TCAM Fang Yu
Reverse Hashing for Sketch Based Change Detection in High Speed Networks Ashish Gupta Elliot Parsons with Robert Schweller, Theory Group Advisor: Yan Chen.
DREAM: Dynamic Resource Allocation for Software-defined Measurement
Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.
Software-defined Measurement
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen.
UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.
SIMPLE-fying Middlebox Policy Enforcement Using SDN Zafar Ayyub Qazi Cheng-Chun Tu Luis Chiang Vyas Sekar Rui Miao Minlan Yu.
Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.
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.
VeriFlow: Verifying Network-Wide Invariants in Real Time
Scalable and Efficient Data Streaming Algorithms for Detecting Common Content in Internet Traffic Minho Sung Networking & Telecommunications Group College.
CEDAR Counter-Estimation Decoupling for Approximate Rates Erez Tsidon (Technion, Israel) Joint work with Iddo Hanniel and Isaac Keslassy ( Technion ) 1.
CEDAR Counter-Estimation Decoupling for Approximate Rates Erez Tsidon Joint work with Iddo Hanniel and Isaac Keslassy Technion, Israel 1.
Performance evaluation of adaptive sub-carrier allocation scheme for OFDMA Thesis presentation16th Jan 2007 Author:Li Xiao Supervisor: Professor Riku Jäntti.
Balajee Vamanan and T. N. Vijaykumar School of Electrical & Computer Engineering CoNEXT 2011.
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.
Online Identification of Hierarchical Heavy Hitters Yin Zhang Joint work with Sumeet SinghSubhabrata Sen Nick DuffieldCarsten Lund.
Efficient Cache Structures of IP Routers to Provide Policy-Based Services Graduate School of Engineering Osaka City University
CellSDN: Software-Defined Cellular Core networks Xin Jin Princeton University Joint work with Li Erran Li, Laurent Vanbever, and Jennifer Rexford.
Reliable Multicast Routing for Software-Defined Networks.
SCREAM: Sketch Resource Allocation for Software-defined Measurement Masoud Moshref, Minlan Yu, Ramesh Govindan, Amin Vahdat (CoNEXT’15)
Re-evaluating Measurement Algorithms in Software Omid Alipourfard, Masoud Moshref, Minlan Yu {alipourf, moshrefj,
SketchVisor: Robust Network Measurement for Software Packet Processing
Xin Li, Chen Qian University of Kentucky
Software defined networking: Experimental research on QoS
Constant Time Updates in Hierarchical Heavy Hitters
University of Maryland College Park
Jennifer Rexford Princeton University
FlowRadar: A Better NetFlow For Data Centers
Cognitive Link Layer for Wireless Local Area Networks
Augmented Sketch: Faster and More Accurate Stream Processing
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
A Novel Framework for Software Defined Wireless Body Area Network
Query-Friendly Compression of Graph Streams
Latent Space Model for Road Networks to Predict Time-Varying Traffic
DDoS Attack Detection under SDN Context
Optimal Elephant Flow Detection Presented by: Gil Einziger,
Qun Huang, Patrick P. C. Lee, Yungang Bao
SCREAM: Sketch Resource Allocation for Software-defined Measurement
Packet Classification Using Coarse-Grained Tuple Spaces
Memento: Making Sliding Windows Efficient for Heavy Hitters
Constant Time Updates in Hierarchical Heavy Hitters
Heavy Hitters in Streams and Sliding Windows
By: Ran Ben Basat, Technion, Israel
Lu Tang , Qun Huang, Patrick P. C. Lee
Toward Self-Driving Networks
Toward Self-Driving Networks
Enabling Innovation Inside the Network
2019/11/12 Efficient Measurement on Programmable Switches Using Probabilistic Recirculation Presenter:Hung-Yen Wang Authors:Ran Ben Basat, Xiaoqi Chen,
Towards Predictable Datacenter Networks
Presentation transcript:

Dream Slides Courtesy of Minlan Yu (USC) 1

Challenges in Flow-based Measurement 2 Controller Configure resources1Fetch statistics2(Re)Configure resources1 Heavy Hitter detection H H Change detection Dynamic Resource Allocator Many Management tasks Limited resources (<4K TCAM)

Last Class: OpenSketch Use sketch to perform measurements Sketches are very efficient (space wise) Requites a combination of TCAM and SRAM – Requires the same flow to go through multiple stages Sketches have 3 phases. – Many OpenFlow 1.0 switches don’t support multi-stage matching – OpenFlow 1.3> supports some multi-stage matching 3

DivideMerge 31 Flow-based Measurement Flow-based counters – Match on multiple packet header fields – Report #bytes/#packets – Heavy hitters, change detection, etc. Monitor nodes in IP prefix tree – E.g., Identify source IPs over 10 – Divide to increase accuracy – Merge to save TCAM entries 4

Recall To make accuracy gurantees – You need to know traffic matrix – You need to know for given algorithm what is the space to accuracy trade-off 5

Diminishing return of resources Tradeoff accuracy for more resources – More resources make smaller accuracy gains – Operators can accept an accuracy bound <100% 6 Recall= detected true HH/all Challenge: No ground truth of resource-accuracy

Spatial/Temporal Resource Multiplexing Temporal multiplexing across tasks – Traffic varies over time, and accuracy depends on traffic Spatial multiplexing across switches – A task needs different resources across switches 7 Recall= detected true HH/all Switch 1 Switch Challenge: Handle traffic and task dynamics across switches

Multiplexing Resources Among Tasks A task may need more resources – At a specific time – At a specific switch But we can multiplex 8 Time=0Time=1Switch 1 Switch 2 Temporal multiplex Spatial multiplex

DREAM Framework 9 Controller Configure resources1Fetch statistics2(Re)Configure resources1 TCAM-based Measurement Framework Dynamic Resource Allocator Estimated accuracy Allocated resource Estimated accuracy Allocated resource

TCAM-based Measurement Framework General support for different types of tasks – Heavy hitters, Hierarchical HHs, change detection Resource aware – Maximize accuracy given limited resources Network-wide – Measuring traffic from multiple switches – Assume each flow is seen at one switch (e.g., at sources) 10

Challenges No ground truth of resource-accuracy – Hard to do traditional convex optimization – We propose new ways to estimate accuracy on the fly – Adaptively increase/decrease resources accordingly Spatial & temporal changes – Task and traffic dynamics across switches – Temporal: Adjust resources based on traffic changes – Spatial: Dynamically allocate resources across switches 11

Divide & Merge at Multiple Switches Divide: Monitor children to increase accuracy – Requires more resources on a set of switches E.g., needs an additional entry on switch B Merge: Monitor parent to free resources – Each node keeps the switch set it frees after merge – Finding the least important prefixes to merge is the minimum set cover problem *01* 0** {A,B}{B,C} {A,B,C} *11* 1** {B}

Task Implementation 13 Controller Configure resources1Fetch statistics2(Re)Configure resources1 Heavy Hitter detection H H Change detection Dynamic Resource Allocator Estimated accuracy Allocated resource Estimated accuracy Allocated resource

Accuracy Estimation Leverage all the monitored counters – Precision: every detected HH is a true HH – Recall: Estimate missing HHs using counter and level *11* 00*01* 0** 1** *** With size 26 missed <=2 HHs At level 2 missed <=2 HH Threshold=10 The error for our accuracy estimator for Heavy hitters is below 5% for real traffic traces

Dynamic Resource Allocator 15 Controller Heavy Hitter detection H H Change detection Dynamic Resource Allocator Estimated accuracy Allocated resource Estimated accuracy Allocated resource Decompose the resource allocator to each switch – Each switch separately increase/decrease resources – When and how to change resources?

Per-switch Resource Allocator: When? When a task on a switch needs more resources? – Global accuracy is important if bound is 40%, no need to increase A’s resources – Local accuracy is important if bound is 80%, increasing B’s resources is not helpful – Conclusion: when max(local, global) < accuracy bound 16 AB Controller Heavy Hitter detection Detected HH:5 out of 20 Local accuracy=25% Detected HH:9 out of 10 Local accuracy=90% Detected HH: 14 out of 30 Global accuracy=47%

Per-Switch Resource Allocator: How? How to adapt resources? – Take from rich tasks (r=r-s), give to poor tasks (r=r+s) How much resource to take/give? – Approach: Adaptive change step (s) for fast convergence – Intuition: Small steps close to bound, large steps otherwise 17 Additive increase in both AA and AM methods converges slowly when the goal changes Additive decrease cannot decrease the step size fast to converge to a fixed value Multiplicative increase and Multiplicative decrease has converges fast

DREAM Overview 18 Task object 1 Task object n DREAM SDN Controller 2) Accept/Reject 5) Report 1) Instantiate task 3) Configure counters 4) Fetch counters 7) Allocate / Drop 6) Estimate accuracy Resource Allocator Task type (Heavy hitter, Hierarchical heavy hitter, Change detection) Task specific parameters (HH threshold) Packet header field (source IP) Filter (src IP=10/24, dst IP=10.2/16) Accuracy bound (80%) Task type (Heavy hitter, Hierarchical heavy hitter, Change detection) Task specific parameters (HH threshold) Packet header field (source IP) Filter (src IP=10/24, dst IP=10.2/16) Accuracy bound (80%) Prototype Implementation with DREAM algorithms on Floodlight and Open vSwitches

Prototype Evaluation DREAM prototype – DREAM algorithms in Floodlight controller – 8 Open vSwitches Prototype evaluation – 256 tasks (HH, HHH, CD, combination) – 5 min tasks arriving in 20 mins – Replaying 5 hours CAIDA trace – Validate simulation using prototype 19

DREAM Conclusion Challenges with software-defined measurement – Diverse and dynamic measurement tasks – Limited resources at switches Dynamic resource allocation across tasks – Accuracy estimators for TCAM-based algorithms – Spatial and temporal resource multiplexing 20

Summary Software-defined measurement – Measurement is important, yet underexplored – SDN brings new opportunities to measurement – Time to rebuild the entire measurement stack Our work – OpenSketch:Generic, efficient measurement on sketches – DREAM: Dynamic resource allocation for many tasks 21

Thanks! 22