DDoS: Defense by Offense 1 DDoS Defense by Offense Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker, SIGCOMM ‘06 Presented.

Slides:



Advertisements
Similar presentations
Why Is DDoS Hard to Solve? 1.A simple form of attack 2.Designed to prey on the Internet’s strengths 3.Easy availability of attack machines 4.Attack can.
Advertisements

Using Capability to prevent Internet Denial-of-Service attacks  Tom Anderson  Timothy Roscoe  David Wetherall  Offense Team –Khoa To –Amit Saha.
 Natural consequence of the way Internet is organized o Best effort service means routers don’t do much processing per packet and store no state – they.
Phalanx: Withstanding Multimillion-Node Botnets Colin Dixon Arvind Krishnamurthy Tom Anderson University of Washington NSDI 2008.
10/10/14 INASP: Effective Network Management Workshops Unit 6: Solving Network Problems.
DDOS Defense by Offense OFFENSE Presented by: Anup Goyal Aojan Su.
DDoS Defense by Offense Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker Presented by: Boris Kurktchiev and Kimberly.
5/18/2015 Samarpita Hurkute DDoS Defense By Offense 1 DDoS Defense by Offense Michael Walfish,Mythili Vutukuru,Hari Balakrishnan,David Karger,Scott Shenker.
DDoS: Defense by Offense 1 DDoS Defense by Offense Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker, SIGCOMM ‘06 Presented.
1 DDoS Defense by Offense Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, Scott Shenker, SIGCOMM ‘06 Presented by Lianmu Chen DDoS:
Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker Presented by Sunjun Kim, Donyoung Koo 1DDoS Defense by Offense.
Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 7 “Denial-of-Service-Attacks”.
Confused, Timid and Unstable: Picking a Video Rate is Hard Te-Yuan (TY) Huang Stanford University Nov 15 th, 2012 Joint work with Nikhil Handigol, Brandon.
The Tension Between High Video Rate and No Rebuffering Te-Yuan (TY) Huang Stanford University IRTF Open 87 July 30th, 2013 Joint work Prof.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Michael Walfish, Mythili Vutukuru, Hari Balakrishanan, David Karger, Scott Shankar DDos Defense by Offense.
2005 Stanford Computer Systems Lab Flow Cookies Bandwidth Amplification as Flooding Defense Martin Casado, Pei Cao Niels Provos.
DDoS Defense by Offense Presented by: Matthew C.H. Ma Damon Chan.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Mitigating Bandwidth- Exhaustion Attacks using Congestion Puzzles XiaoFeng Wang Michael K. Reiter.
Introduction. Overview of Pushback. Architecture of router. Pushback mechanism. Conclusion. Pushback: Remedy for DDoS attack.
1 TVA: A DoS-limiting Network Architecture Xiaowei Yang (UC Irvine) David Wetherall (Univ. of Washington) Thomas Anderson (Univ. of Washington)
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
Detecting SYN-Flooding Attacks Aaron Beach CS 395 Network Secu rity Spring 2004.
L13: Sharing in network systems Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans.
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
A Criticism of: “Moving beyond end-to-end path information to optimize CDN performance” Gautam Bhawsar Alok Rakkhit.
Lecture 15 Denial of Service Attacks
Game-based Analysis of Denial-of- Service Prevention Protocols Ajay Mahimkar Class Project: CS 395T.
S ELECTION OF WEB HOST AND WEB PAGE SYSTEM. W EB HOST stores all the pages of your website and makes them available to computers connected to the Internet.
Lecture 22 Page 1 Advanced Network Security Other Types of DDoS Attacks Advanced Network Security Peter Reiher August, 2014.
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 8 – Denial of Service.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Part 2  Access Control 1 CAPTCHA Part 2  Access Control 2 Turing Test Proposed by Alan Turing in 1950 Human asks questions to another human and a computer,
Protecting Web 2.0 Services from Botnet Exploitations Cybercrime and Trustworthy Computing Workshop (CTC), 2010 Second Nguyen H Vo, Josef Pieprzyk Department.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
Micheal Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker Presented by Corey White.
Source-End Defense System against DDoS attacks Fu-Yuan Lee, Shiuhpyng Shieh, Jui-Ting Shieh and Sheng Hsuan Wang Distributed System and Network Security.
Network Security Continued. Digital Signature You want to sign a document. Three conditions. – 1. The receiver can verify the identity of the sender.
Transport over Wireless Networks Myungchul Kim
Lecture 1 Page 1 CS 239, Fall 2010 Distributed Denial of Service Attacks and Defenses CS 239 Advanced Topics in Computer Security Peter Reiher September.
Portcullis: Protecting Connection Setup from Denial-of-Capability Attacks Paper by: Bryan Parno et al. (CMU) Presented by: Ionut Trestian Gergely Biczók.
Withstanding Multimillion-Node Botnets Colin Dixon Arvind Krishnamurthy, Tom Anderson Affiliates Day, 2007.
Distributed Denial of Service (DDoS) Defending against Flooding-Based DDoS Attacks: A Tutorial Rocky K. C. Chang DDoS Defense by Offense Michael Walfish,
Adaptive Selective Verification Sanjeev Khanna, Santosh Venkatesh, UPenn Omid Fatemieh, Fariba Khan, Carl A. Gunter, UIUC IEEE INFOCOM 2008.
DDoS Defense by Offence Michael Walfish, Mithili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker MIT CSAIL, UCB and ICSI ACM SigComm 2006.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Lecture 20 Page 1 Advanced Network Security Basic Approaches to DDoS Defense Advanced Network Security Peter Reiher August, 2014.
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.
Denial of Service DoS attacks try to deny legimate users access to services, networks, systems or to other resources. There are DoS tools available, thus.
Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
1 SIGCOMM ’ 03 Low-Rate TCP-Targeted Denial of Service Attacks A. Kuzmanovic and E. W. Knightly Rice University Reviewed by Haoyu Song 9/25/2003.
Application Layer Attack. DDoS DDoS – Distributed Denial of Service Why would any one want to do this? In some cases, for bringing down service of competitors,
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Firewalls A brief introduction to firewalls. What does a Firewall do? Firewalls are essential tools in managing and controlling network traffic Firewalls.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
Lecture 17 Page 1 Advanced Network Security Network Denial of Service Attacks Advanced Network Security Peter Reiher August, 2014.
DDoS Defense by Offense1 Walfish, M., Vutukuru, M., Balakrishnan, H., Karger, D., (MIT) and Shenker, S. (UC Berkeley), SIGCOMM ’06 Presented by Ivanka.
Denial of Service Attacks Simulating Strategic Firewall Placement By James Box, J.A. Hamilton Jr., Adam Hathcock, Alan Hunt.
Providing QoS in IP Networks
Distributed Denial of Service Yi Zhang April 26, 2016.
Denial of Service A comparison of DoS schemes Kevin LaMantia COSC 316.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
25/09/2016 INASP: Effective Network Management Workshops Unit 6: Solving Network Problems.
Distributed Systems 11. Transport Layer
SPEAKER: Yu-Shan Chou ADVISOR: DR. Kai-Wei Ke
Presentation transcript:

DDoS: Defense by Offense 1 DDoS Defense by Offense Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David Karger, and Scott Shenker, SIGCOMM ‘06 Presented by Karl Deng, Zhaosheng Zhu

DDoS: Defense by Offense 2 Outline Introduction Design Implementation Evaluation Concerns Conclusions

DDoS: Defense by Offense 3 Introduction

DDoS: Defense by Offense 4 Basic Idea Defense against application level DDoS attacks –Way of dealing with attack as it occurs, not a prevention scheme

DDoS: Defense by Offense 5 Application-level attacks Attacker sends legitimate-looking requests to waste server ’ s resources Overwhelms server, not access links Cheaper than link-level attacks (for the attacker) Attack traffic is harder to identify

DDoS: Defense by Offense 6 Application-level attacks Current defenses focus on slowing down attackers/stopping the attack. But good clients are totally drowned out in these defense systems – it ’ s time for them to speak-up.

DDoS: Defense by Offense 7 3 Types of Defenses 1.Overprovision computation resources massively 2.Detect and block attackers Rate-limit, filter, capability 3.Charge all clients a currency (scare resource) Such resources can be: –Digital payment (micro-payment) –Computational work (proof of work) e.g, solving a puzzle –Human attention (proof of humanity) e.g., CAPTCHA (Completely Automated Public Turing Test to Tell Computers and Humans Apart)

DDoS: Defense by Offense 8 Speak-up It ’ s a currency-based defense that uses bandwidth as the currency –Claim: attackers use most of their available bandwidth during attacks, victims don ’ t –Use encouragement to make victims send more traffic so they are better represented at the server

DDoS: Defense by Offense 9 Two conditions to make it work … Adequate Link Bandwidth: there must be enough spare bandwidth to allow for speak-up inflated traffic Adequate Client Bandwidth: the aggregate bandwidth of all good clients must be on the same order as the attackers ’

DDoS: Defense by Offense 10 Three conditions where it wins … No predefined clientele: Makes filtering impossible, so use speak-up. Non-human clientele: Makes “ human ” tests (type in the word, etc) impossible, so use speak-up. Unequal requests or spoofing or smart bots: No method for dealing with the first, can ’ t use methods for the second two … use speak-up!!!

DDoS: Defense by Offense 11 Design

DDoS: Defense by Offense 12 Design Goal Allocate resources to competing clients in proportion to bandwidth [math]

DDoS: Defense by Offense 13 3 Required Mechanisms 1. Way to limit the total requests to the server to its max, c 2. Mechanism to reveal available bandwidth/provide encouragement 3. Proportional allocation mechanism – let clients in proportional to delivered bandwidth Hence, the thinner appears.

DDoS: Defense by Offense 14 Explicit Payment Channel Thinner pads client traffic with dummy bytes, but how many should we pad with? We don ’ t need to know that information!

DDoS: Defense by Offense 15 Explicit Payment Channel When server is overloaded, thinner asks clients to open separate payment channels (virtual auction) Client sends bytes on this channel, becomes a contender Thinner tracks how much each contender sends When server is free, thinner admits the highest bidder and closes the channel

DDoS: Defense by Offense 16 Heterogeneous requests Charging the same amount for unequal requests gives unfair advantage to attacker So charge per time chunk instead of per request

DDoS: Defense by Offense 17 Heterogeneous requests Charge ongoing request Instead of closing the bid channel after accepting a client, keep it open until request is served Every unit of service time, reopen the auction

DDoS: Defense by Offense 18 Heterogeneous requests 1.At time t, v is active connection, u is the highest contender 2.u > v, SUSPEND v, ADMIT (RESUME) u 3.v > u, let v continue sending, but reset its payment counter for time t+1 4.ABORT requests that have been suspended too long

DDoS: Defense by Offense 19 Implementation

DDoS: Defense by Offense 20 Implementation

DDoS: Defense by Offense 21 Evaluation

DDoS: Defense by Offense 22 Evaluation Validating the thinner ’ s allocation Latency and byte cost Adversarial advantage Heterogeneous network conditions Good and bad clients sharing bottlenecks Impact of speak-up on other traffic

DDoS: Defense by Offense 23 Validating the thinner ’ s allocation Question 1: Do groups get service in proportion to bandwidth? Setup: 50 clients over 100 Mb/s LAN Each gets 2Mb/s c = 100 req/s Vary f, the fraction of good clients

DDoS: Defense by Offense 24 Validating the thinner ’ s allocation

DDoS: Defense by Offense 25 Validating the thinner ’ s allocation Speak-up defended clients are always a little behind ideal Always fare better than undefended

DDoS: Defense by Offense 26 Validating the thinner ’ s allocation Question 2: What happens when we vary the capacity of the server? Setup: 25 good clients, 25 bad clients cid = 100 c = 50, 100, 200

DDoS: Defense by Offense 27 Validating the thinner ’ s allocation

DDoS: Defense by Offense 28 Validating the thinner ’ s allocation

DDoS: Defense by Offense 29 Validating the thinner ’ s allocation Good clients do best when the server has ability to process all requests (i.e., large c) Service proportional to bandwidth even when server can ’ t process all requests

DDoS: Defense by Offense 30 Latency cost Same setup as last experiment Measures the length of time clients spend uploading dummy bytes

DDoS: Defense by Offense 31 Latency cost

DDoS: Defense by Offense 32 Latency cost With a large c, cost isn ’ t very high Even with a small c, worst added delay is 1s. –Pretty bad, but not as bad as getting no service during an attack, right?

DDoS: Defense by Offense 33 Byte Cost Still the same setup Measure the average number of bytes uploaded for served requests

DDoS: Defense by Offense 34 Byte Cost

DDoS: Defense by Offense 35 Byte Cost Bad clients do end up paying more than good clients

DDoS: Defense by Offense 36 Heterogeneous Network Conditions First, look at varied bandwidth 5 client categories, 10 clients in each category Bandwidth for category i = 0.5i Mbps (1 <= i <= 5) All clients are good clients c = 10

DDoS: Defense by Offense 37 Heterogeneous Network Conditions

DDoS: Defense by Offense 38 Heterogeneous Network Conditions Roughly proportional to bandwidth of clients Close to ideal

DDoS: Defense by Offense 39 Heterogeneous Network Conditions Now look at effect of varied RTT 5 client categories, with 10 clients in each RTT for category i = 100i ms (1 <= i <= 5) Bandwidth per client = 2 Mbps c = 10 Run with all good or all bad clients

DDoS: Defense by Offense 40 Heterogeneous Network Conditions

DDoS: Defense by Offense 41 Heterogeneous Network Conditions Good clients with long RTTs do worse than any bad clients

DDoS: Defense by Offense 42 Good and Bad Sharing a Bottleneck 30 clients, each with 2 Mbps, connect to thinner through link l l ‘ s bandwidth = 40 Mbps 10 good, 10 bad clients, each with 2Mbps, connect directly to thinner C = 50 req/s Vary number of good/bad behind l

DDoS: Defense by Offense 43 Good and Bad Sharing a Bottleneck

DDoS: Defense by Offense 44 Good and Bad Sharing a Bottleneck Clients behind l capture half of the server ’ s capacity Good behind l suffer some, especially with greater number of bad clients Effect on good clients greater when bottleneck is smaller

DDoS: Defense by Offense 45 Impact of speak-up on other traffic Bottleneck, m, shared between speak- up clients and TCP endpoint, H Run with H as a sender, m is shared fairly Run with H as a receiver, H ’ s ACKs will get lost, H ’ s requests will be delayed

DDoS: Defense by Offense 46 Impact of speak-up on other traffic Experimented specifically with H as a receiver 10 good speak-up clients, 1 HTTP client downloading with wget m = 1Mbps, rest = 2Mbps c = 2

DDoS: Defense by Offense 47 Impact of speak-up on other traffic

DDoS: Defense by Offense 48 Impact of speak-up on other traffic Huge impact on H “ Pessimistic ” result according to authors Only happens during attack, might be worth it to help “ defend the Internet ”

DDoS: Defense by Offense 49 Concerns

DDoS: Defense by Offense 50 Concerns/Cautions/Objections Does speak-up hurt small sites? –Yes, for current sized botnets –But this might get better with smaller botnets Does speak-up hurt the whole Internet? –Not really –Only for servers under attack –Core over-provisioning dampens the effect –Congestion control will keep speak-up under control

DDoS: Defense by Offense 51 Concerns/Cautions/Objections Bandwidth envy –Only “ more better off ” during attacks –ISPs could offer high bw proxies to low bw clients Variable bandwidth costs –Again, offer a high bw proxy –Or let customers decide whether or not to bid

DDoS: Defense by Offense 52 Concerns/Cautions/Objections Incentives for ISPs –The basic goodness of society will protect us!!! Solving the wrong problem –Cleaning up botnets is good, but we need to do something in the meantime Flash crowds –Reasonable to treat them as attacks

DDoS: Defense by Offense 53 Conclusions

DDoS: Defense by Offense 54 Conclusions Not sure who wants/needs speak-up –Survey to find out Speak-up does what it proposes to do

DDoS: Defense by Offense 55 Conclusions Main advantages –Network elements don ’ t need to change –Only need to modify servers and add thinners Main disadvantages –Everyone floods, so harder to detect bad clients –Hurts edge networks –Rendered useless if access links to thinner are saturated