1 Action Breakout Session Anil, AP, Nina Bhatti, Charles Berdnall, Joe Hellerstein, Wei Hu, Anthony Joseph, Randy Katz, Li, Machi Mukund Kimmo Raatikanen,

Slides:



Advertisements
Similar presentations
Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
Advertisements

Distributed Systems Major Design Issues Presented by: Christopher Hector CS8320 – Advanced Operating Systems Spring 2007 – Section 2.6 Presentation Dr.
Silberschatz and Galvin  Operating System Concepts Module 16: Distributed-System Structures Network-Operating Systems Distributed-Operating.
CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Introducing WatchGuard Dimension. Oceans of Log Data The 3 Dimensions of Big Data Volume –“Log Everything - Storage is Cheap” –Becomes too much data –
Workloads Experimental environment prototype real sys exec- driven sim trace- driven sim stochastic sim Live workload Benchmark applications Micro- benchmark.
Ao-Jan Su and Aleksandar Kuzmanovic Department of EECS Northwestern University Thinning Akamai USENIX/ACM SIGCOMM IMC ’08.
1 Routing and Scheduling in Web Server Clusters. 2 Reference The State of the Art in Locally Distributed Web-server Systems Valeria Cardellini, Emiliano.
1 Quality of Service vs. Any Service at All 10th IEEE/IFIP Conference on Network Operations and Management Systems (NOMS 2006) Vancouver, BC, Canada April.
High speed links, distributed services, can’t modify routers  Lack of visibility But, need for more visibility and control  Increased number and complexity.
Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.
Network Operating Systems Users are aware of multiplicity of machines. Access to resources of various machines is done explicitly by: –Logging into the.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
Quality of Service in IN-home digital networks Alina Albu 7 November 2003.
1 Controlling High Bandwidth Aggregates in the Network.
PSMC Proxy Server-based Multipath Connection CS 526 Advanced Networking - Richard White.
DFence: Transparent Network-based Denial of Service Mitigation CSC7221 Advanced Topics in Internet Technology Presented by To Siu Sang Eric ( )
OCT1 Principles From Chapter One of “Distributed Systems Concepts and Design”
Beyond the perimeter: the need for early detection of Denial of Service Attacks John Haggerty,Qi Shi,Madjid Merabti Presented by Abhijit Pandey.
EEC-681/781 Distributed Computing Systems Lecture 3 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
Differentiated Multimedia Web Services Using Quality Aware Transcoding S. Chandra, C.Schlatter Ellis and A.Vahdat InfoCom 2000, IEEE Journal on Selected.
Dynamic routing – QoS routing Load sensitive routing QoS routing.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
ISCSI Performance Experiments Li Yin EECS Department U.C.Berkeley.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
ASP.NET 2.0 Chapter 6 Securing the ASP.NET Application.
1 Web Content Delivery Reading: Section and COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Ioannis Avramopoulos Instructor:
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
Computer Science Cataclysm: Policing Extreme Overloads in Internet Applications Bhuvan Urgaonkar and Prashant Shenoy University of Massachusetts.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
Active Network Applications Tom Anderson University of Washington.
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 8 – Denial of Service.
Performance of Web Applications Introduction One of the success-critical quality characteristics of Web applications is system performance. What.
SEDA: An Architecture for Well-Conditioned, Scalable Internet Services
Computer Measurement Group, India Optimal Design Principles for better Performance of Next generation Systems Balachandar Gurusamy,
This document is for informational purposes only, and Tekelec reserves the right to change any aspect of the products, features or functionality described.
Web Application Firewall (WAF) RSA ® Conference 2013.
1 06/00 Questions 10/6/2015 QoS in DOS ECOOP 2000John Zinky BBN Technologies ECOOP 2000 Workshop on Quality of Service in Distributed Object Systems
What are the main differences and commonalities between the IS and DA systems? How information is transferred between tasks: (i) IS it may be often achieved.
Software Performance Testing Based on Workload Characterization Elaine Weyuker Alberto Avritzer Joe Kondek Danielle Liu AT&T Labs.
Workshop on the Future of Scientific Workflows Break Out #2: Workflow System Design Moderators Chris Carothers (RPI), Doug Thain (ND)
10/20/2015 ©2006 Scott Miller, University of Victoria 1 User Authentication Content Generation The Use of Cookies Content Pooling Rev 1.5.
Computing Infrastructure for Large Ecommerce Systems -- based on material written by Jacob Lindeman.
Thomas Dreibholz Institute for Experimental Mathematics University of Duisburg-Essen, Germany University of Duisburg-Essen, Institute.
CMSC 414 Computer and Network Security Lecture 20 Jonathan Katz.
Denial of Service Attack 발표자 : 전지훈. What is Denial of Service Attack?  Denial of Service Attack = DoS Attack  Service attacks on a Web server floods.
Chapter 7 Denial-of-Service Attacks Denial-of-Service (DoS) Attack The NIST Computer Security Incident Handling Guide defines a DoS attack as: “An action.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
6.894: Distributed Operating System Engineering Lecturers: Frans Kaashoek Robert Morris
CoopNet: Cooperative Networking
Denial of Service Attacks Simulating Strategic Firewall Placement By James Box, J.A. Hamilton Jr., Adam Hathcock, Alan Hunt.
Lecture 4 Page 1 CS 111 Summer 2013 Scheduling CS 111 Operating Systems Peter Reiher.
Operating Systems Distributed-System Structures. Topics –Network-Operating Systems –Distributed-Operating Systems –Remote Services –Robustness –Design.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
University of Maryland College Park
SEDA: An Architecture for Scalable, Well-Conditioned Internet Services
Action Breakout Session
Regulating Data Flow in J2EE Application Server
Storage Virtualization
COS 561: Advanced Computer Networks
Speaker: Jin-Wei Lin Advisor: Dr. Ho-Ting Wu
NeST: Network Storage Technologies
Specialized Cloud Architectures
Control Theory in Log Processing Systems
Performance-Robust Parallel I/O
Presentation transcript:

1 Action Breakout Session Anil, AP, Nina Bhatti, Charles Berdnall, Joe Hellerstein, Wei Hu, Anthony Joseph, Randy Katz, Li, Machi Mukund Kimmo Raatikanen, Siva

2 Breakout Goal Identify research questions and issues related to adaptive action invocation to enhance the dependability and security of distributed systems Customer is the “system administrator,” not the end user

3 Breakout Process Define actions by example Discuss cross-layer interaction and coordination Distill underlying principles

4 Key Observations Distinguish between control actions (e.g., “slow down”) and data actions (e.g., “drop packets”) Distinguish between internal/locally performed actions and actions that affect global behavior Control loops operating in multiple levels, regionally and globally Performance-related actions are the basic building block Control system itself can be target of an adversarial attack

5 Working Examples Network Storage Service; Media Streaming Service –Multiple instances of service various places in network –Direct requests to best available service instance –Balance requests among service instances –Fall back to alternative service instance in the face of failure or DOS attack –Coordinate measurements on client-side and server-side to reduce load through admission control and content adaptation –Distinguish between server overload and network overload –For clients “not in the loop” (heterogeneous clients, adversarial clients), proxy the necessary behavior inside the network Network Denial of Service –Overload data traffic and starve control traffic –Secondary performance effects: session resets, router CPUs driven to high utilization, etc.

6 Control Theoretic Viewpoint Black boxes that are managed by a control system –Actuation points that can acted upon to control the system –E.g., Apply backpressure to clients to slow down request rate (control); degrade content quality (data) –E.g., Prioritize/reserve bandwidth for control traffic; Policy settings are control actions, enforcement of policy are data actions –Single vs. independent control loops: which is better? –Theory provides tools for managing “disturbances” –Note that the control system can itself be the target of attack Hellerstein: Action is a change to a configuration –E.g., buffer pool size, weights in load balancer –E.g., uninstall/reinstall software

7 General Observations Causality and Visibility –Actions can lead to cascaded actions –Can interactions/side effects be modeled/made explicit? –Action graph model: probability that a following action will be invoked as the result of a given current action »In general, difficult to determine in advance »Could it be learned via observe/analyze? –Feasible to place action points at every potential bottleneck site? »Note that routers are badly designed black boxes, difficult and time consuming to extract their internal state –Tradeoff between centralized collection of state that may be “complete” but out-of-date vs. decentralized collection that may be more timely but globally incomplete »Principle of containment: first do no harm, local actions potential less disastrous than global actions

8 General Observations Managing Disturbances –Instabilities arise where delays in taking action are introduced »Latencies in response »Imperfect knowledge of the state –Tradeoff in making decisions based on longer intervals spanning more state vs. shorter intervals spanning less state »Time intervals adapt … short time to ensure useful work always being done »E.g., Disk scheduling in Storage Server You can only do work you are aware of Keep the queues short to achieve best performance

9 General Observations Predictive actions –Waiting too long to detect problem limits ability to respond –Characterize workload/response changes as signature of impending system performance failure »Response to workload changes: “gradual” vs. cliff degradation »E.g., as I/O workload grows, predict increases in response latency »E.g., IBM detects changes to slope of activity to trigger resource allocation to manage flash crowds in web server farms

10 General Observations Don’t ignore the human decision maker –Human operators in the loop –Research challenge: visualizing the configuration and state of the system to a human decision maker –Higher order configuration and administration tools and frameworks