SDN: Systemic Risks due to Dynamic Load Balancing Vladimir Marbukh IRTF SDN.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Data and Computer Communications
Jaringan Komputer Lanjut Packet Switching Network.
CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
School of Information University of Michigan Network resilience Lecture 20.
December 4, 2000© 2000 Fernando L. Alvarado1 Reliability concepts and market power Fernando L. Alvarado Professor, The University of Wisconsin Invited.
Stability of computer network for the set delay Jolanta Tańcula.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
Small-world Overlay P2P Network
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
AHOP Problem and QoS Route Pre-computation Adam Sachitano IAL.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
TCP Stability and Resource Allocation: Part I. References The Mathematics of Internet Congestion Control, Birkhauser, The web pages of –Kelly, Vinnicombe,
Traffic Forecasting Medium Access TRANSFORMA Vladislav Petkov Katia Obraczka 1.
Data Communications Packet Switching.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Models for Measuring and Hedging Risks in a Network Plan
Dynamic routing – QoS routing Load sensitive routing QoS routing.
On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Buffer Management for Shared- Memory ATM Switches Written By: Mutlu Apraci John A.Copelan Georgia Institute of Technology Presented By: Yan Huang.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Robust Regression for Minimum-Delay Load-Balancing F. Larroca and J.-L. Rougier 21st International Teletraffic Congress (ITC 21) Paris, France, September.
Minimum-Delay Load-Balancing Through Non-Parametric Regression F. Larroca and J.-L. Rougier IFIP/TC6 Networking 2009 Aachen, Germany, May 2009.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Chapter 12 Routing in Switched Networks. Routing in Packet Switched Network  key design issue for (packet) switched networks  select route across network.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
Network management Reinhard Laroy BIPT European Parliament - 27 February 2012.
On the Adoption Paths and Competition of Network Applications Soumya Sen ESE, UPenn March 4, 2009.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
Development of a New Efficient and Accurate Available Bandwidth Estimation Method Péter Hága Attila Pásztor István Csabai Darryl Veitch Viktória Hunyadi.
1. Process Gather Input – Today Form Coherent Consensus – Next two months.
Computer Networks with Internet Technology William Stallings
Deeply Embedded Large Scale Networks Specify and Control Emerging Behavior.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Valuation of Travel Time Uncertainty & Delays Joel P. Franklin Assistant Professor, KTH – Transport and Location Analysis.
Appointment Systems - a Stochastic and Fluid Approach Michal Penn The William Davidson Faculty of Industrial Engineering and Management Technion - Israel.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
1 Analysis of a window-based flow control mechanism based on TCP Vegas in heterogeneous network environment Hiroyuki Ohsaki Cybermedia Center, Osaka University,
William Stallings Data and Computer Communications 7th Edition
An Adaptive Routing Protocol with Congestion Avoidance for Opportunistic Networks 王冉茵.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
The Influence of Realism on Congestion in Network Simulations* K. Mills (joint work with C. Dabrowski) NIST December 1, 2015 *For more details see: NIST.
1 Bottleneck Routing Games on Grids Costas Busch Rajgopal Kannan Alfred Samman Department of Computer Science Louisiana State University.
Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.
Mining Resource-Scheduling Protocols Arik Senderovich, Matthias Weidlich, Avigdor Gal, and Avishai Mandelbaum Technion – Israel Institute of Technology.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
Improving OBS Efficiency Li, Shuo, Meiqian Wang. Eric W. M. Wong, Moshe Zukerman City University of Hong Kong 1.
William Stallings Data and Computer Communications
TCP Congestion Control
Continuous improvement is the process by which organizations frequently review their procedures, aiming to correct errors or problems. The most effective.
Data and Computer Communications
Buffer Management for Shared-Memory ATM Switches
Reducing Forks in the Blockchain via Probabilistic Verification
Towards Predictable Datacenter Networks
Presentation transcript:

SDN: Systemic Risks due to Dynamic Load Balancing Vladimir Marbukh IRTF SDN

2 Abstract SDN facilitates dynamic load balancing Systemic benefits of dynamic load balancing: -economic: higher resource utilization, higher revenue,.. -resilience/robustness to failures, demand variability,.. Systemic risks of dynamic load balancing: -robust to small yet fragile to large-scale failures/overload -possibility of abrupt cascading overload -persistent/metastable systemically congested states Necessity to manage SDN systemic risk/benefit tradeoff

3 Congestion-aware Routing in a Delay Network Congestion-aware routing robust to small yet fragile to large-scale congestion Benefit: lower network congestion for medium exogenous load from A1 to A2 Risk: hard/severe network overload (discontinuous phase transition) at A2 Economics drives system to the stability boundary A2. queue length at node i Exogenous load Network congestion level P. Echenique, J. Gomez-Gardenes, and Y. Moreno, “Dynamics of jamming transitions in complex networks,” h=1: congestion oblivious (minimum hop count) routing h=0: congestion aware routing Minimum-cost routing Route cost: # hops from node i to the destination

4 Congestion-aware Routing in Loss Network Combination of selfish requests & variable demand => emergence of congested metastable (persistent) state => robust (to local) yet fragile (to large-scale congestion) Arriving request is routed directly if possible, otherwise an available 2-link transit route. Performance: request loss rate L. Positive feedback: load increase  more transit routes  load increase.. = Cascading overload Metastability/Cascading overload [F. Kelly] Loss under mean-field approximation [F. Kelly] Fully connected network

5 Cloud with Dynamic Load Balancing Problems: exogenous load uncertain, other uncertainties. Possible solution: dynamic load balancing based on dynamic utilization, e.g., numbers of occupied servers, queue sizes, etc. Problem: serving non-native requests is less efficient: where utilization is Static load balancing is possible if: and according to A.L. Stolyar and E. Yudovina (2013) this may cause instability of “natural” dynamic load balancing Server group : operational with prob. non-operational with prob. Failures/recoveries on much slower time scale than job arrivals/departures and

6 (a)As level of resource sharing exceeds certain threshold, metastable/persistent congested equilibrium emerges, making Cloud robust to local overload yet fragile to large-scale overload (b)With further increase in resource sharing, performance of the normal metastable equilibrium improves, while of the congested metastable equilibrium worsens. Dynamic Load Balancing in Cloud [V. Marbukh, 2014] Figure. Lost revenue vs. exogenous load for different levels of resource sharing Figure. Provider perspective: lost revenue vs. resource sharing level. (a)Economics of the “normal” equilibrium drives Cloud from robust to fragile and eventually to stability boundary of the normal equilibrium. (b)This creates inherent tradeoff between lost revenue: and systemic risk of large scale overload

7 Systemic Performance/Risk Tradeoff in Cloud Figure. Risk/Performance tradeoff: Implication: Uncertainty makes systemic Risk/Performance tradeoff essential Question: How can one-dimensional analysis describe a heterogeneous Cloud? Answer: Perron-Frobenius theory due to congestion dynamics being non-negative Since “normal” equilibrium loses stability as Perron-Frobenius eigenvalue of the linearized system crosses point from below, it is natural to quantify the system stability margin and risk of cascading overload by Word of caution: the above results are obtain under mean-field approximation.

8 Future Research Verification/validation results obtained under mean-field approximation through simulations, measurements on networks and rigorous analysis (doubtful). Possibility of online measurement of the Perron-Frobenius eigenvalue for the purpose of using it as a basis for “early warning system.” Possibility of controlling networks, especially through pricing, based on the Perron-Frobenius eigenvalue.

9 Thank you!