Data-Plane Accountability with In-Band Path Diagnosis Murtaza Motiwala, Nick Feamster Georgia Tech Andy Bavier Princeton University.

Slides:



Advertisements
Similar presentations
Secure Routing Panel FIND PI Meeting (June 27, 2007) Morley Mao, Jen Rexford, Xiaowei Yang.
Advertisements

Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
1 An Update on Multihoming in IPv6 Report on IETF Activity IPv6 Technical SIG 1 Sept 2004 APNIC18, Nadi, Fiji Geoff Huston.
Security Issues In Mobile IP
Wenke Lee and Nick Feamster Georgia Tech Botnet and Spam Detection in High-Speed Networks.
Wenke Lee and Nick Feamster Georgia Tech Botnet and Spam Detection in High-Speed Networks.
Path Splicing with Network Slicing
Improving Internet Availability with Path Splicing Nick Feamster Georgia Tech Joint work with Murtaza Motiwala and Santosh Vempala.
Challenges in Making Tomography Practical
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Research Summary Nick Feamster. The Big Picture Improving Internet availability by making networks easier to operate Three approaches –From the ground.
Using VINI to Test New Network Protocols Murtaza Motiwala, Georgia Tech Andy Bavier, Princeton University Nick Feamster, Georgia Tech Santosh Vempala,
Network Support for Accountability Nick Feamster Georgia Tech Collaborative Response with David Andersen (CMU), Hari Balakrishnan (MIT), Scott Shenker.
Path Splicing Nick Feamster, Murtaza Motiwala, Megan Elmore, Santosh Vempala.
Multihoming and Multi-path Routing
Network Support for Sharing. 2 CABO: Concurrent Architectures are Better than One No single set of protocols or functions –Different applications with.
Improving Internet Availability. Availability of Other Services Carrier Airlines (2002 FAA Fact Book) –41 accidents, 6.7M departures – % availability.
Network Troubleshooting: rcc and Beyond Nick Feamster Georgia Tech (joint with Russ Clark, Yiyi Huang, Anukool Lakhina)
1 Resonance: Dynamic Access Control in Enterprise Networks Ankur Nayak, Alex Reimers, Nick Feamster, Russ Clark School of Computer Science Georgia Institute.
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Theory Lunch. 2 Problem Areas Network Virtualization for Experimentation and Architecture –Embedding problems –Economics problems (markets, etc.) Network.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Nick Feamster Georgia Tech
A Narrow Waist for Multipath Routing Murtaza Motiwala Bilal Anwer, Mukarram bin Tariq David Andersen, Nick Feamster.
Multihoming and Multi-path Routing
1 Resonance: Dynamic Access Control in Enterprise Networks Ankur Nayak, Alex Reimers, Nick Feamster, Russ Clark School of Computer Science Georgia Institute.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Logically-Centralized Control COS 597E: Software Defined Networking.
June 4, 2004 A Robust Reputation System for P2P and Mobile Ad-hoc Networks Sonja Buchegger 1 A Robust Reputation System for P2P and Mobile Ad-hoc Networks.
Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
User-level Internet Path Diagnosis Ratul Mahajan, Neil Spring, David Wetherall and Thomas Anderson Designed by Yao Zhao.
Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Anand Patwardhan Jim.
Internet Control Message Protocol (ICMP)
1 Path Splicing Author: Murtaza Motiwala, Megan Elmore, Nick Feamster and Santosh Vempala Publisher: SIGCOMM’08 Presenter: Hsin-Mao Chen Date:2009/12/09.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
User-level Internet Path Diagnosis R. Mahajan, N. Spring, D. Wetherall and T. Anderson.
Stealth Probing: Efficient Data- Plane Security for IP Routing Ioannis Avramopoulos Princeton University Joint work with Jennifer Rexford.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
A victim-centric peer-assisted framework for monitoring and troubleshooting routing problems.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
NET-REPLAY: A NEW NETWORK PRIMITIVE Ashok Anand Aditya Akella University of Wisconsin, Madison.
Formal checkings in networks James Hongyi Zeng with Peyman Kazemian, George Varghese, Nick McKeown.
Internet Control Message Protocol (ICMP). Objective l IP and ICMP l Why need ICMP? l ICMP Message Format l ICMP fields l Examples: »Ping »Traceroute.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 Countering DoS Through Filtering Omar Bashir Communications Enabling Technologies
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
A Dynamic Packet Stamping Methodology for DDoS Defense Project Presentation by Maitreya Natu, Kireeti Valicherla, Namratha Hundigopal CISC 859 University.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
1 An Error Reporting Mechanism (ICMP). 2 IP Semantics IP is best-effort Datagrams can be –Lost –Delayed –Duplicated –Delivered out of order –Corrupted.
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
Packet-Marking Scheme for DDoS Attack Prevention
BZUPAGES.COM Presentation On SWITCHING TECHNIQUE Presented To; Sir Taimoor Presented By; Beenish Jahangir 07_04 Uzma Noreen 07_08 Tayyaba Jahangir 07_33.
End-to-End Principle Brad Karp UCL Computer Science CS 6007/GC15/GA07 25 th February, 2009.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Multi Node Label Routing – A layer 2.5 routing protocol
Chapter 2: Static Routing
CS 457 – Lecture 12 Routing Spring 2012.
Intra-Domain Routing Jacob Strauss September 14, 2006.
Chapter 2: Static Routing
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
ECSE-4670: Computer Communication Networks (CCN)
BGP Interactions Jennifer Rexford
Achieving Resilient Routing in the Internet
Presentation transcript:

Data-Plane Accountability with In-Band Path Diagnosis Murtaza Motiwala, Nick Feamster Georgia Tech Andy Bavier Princeton University

2 Internet Routing Lacks Accountability Control Plane: Messages can be falsified –Misconfiguration: AS 7007, ConEdison route leak –Malice: Spammers stealing address space Data Plane: Data traffic is not guaranteed to travel where the routing protocol indicates –Paths may not perform well –Even if a faulty path cold be located, no recourse This talk: Detecting and isolating faulty elements and nodes. Some discussion about recourse.

3 What is Data-Plane Accountability? Mechanisms to detect and locate sources (and causes of bad behavior) Causes may be benign or malicious –Congestion –Faulty links –Denial of service attack Recourse to avoid faulty or malicious elements –Scalable network support for path diversity

4 Possible Mechanism: Out-of-Band Approach: Send additional probe traffic to capture network conditions –Ping, traceroute, pathchar, etc. Problem: Measured performance may not reflect conditions experienced by data traffic –May not capture transient faults –Probes may be treated differently –Introduces additional probe traffic, which may affect observed performance

5 The research agenda in measurement must change to consider measurement solutions which enlist the cooperation of routers. The need is so urgent that the deployment...can be finessed by cooperation between a few key ISPs. There is a rich vein of technical problems, hitherto considered only from an active measurement perspective, for which there can be new and effective...solutions. Varghese and Estan, The Measurement Manifesto

6 Alternative: In-Band Path Diagnosis Store information about network diagnostics in the packet itself. Advantage: Diagnostic information reflects information actually experienced by data traffic. Challenges –Lost data packets mean lost diagnostics –Distinguishing loss and reordering –Recovering diagnostic information (from the receiver) –Packet marking and storage requirements

7 Design Considerations Localization granularity: With what precision should a fault be located? –From within a few ASes to actual network element Statistics granularity: With what precision should statistics be captured? –From coarse, per-flow statistics to per-packet statistics Storage: How much state should be stored, and where should it be stored? –In the router vs. in the packet

8 Design Considerations (cont.) Modifications to packet format: Modify packet format, or squeeze data into existing headers? Robustness to malice: Should the scheme be robust in the face of malice? –Off-path: Hosts or routers off of the data path try to disrupt communication –On-path: Malicious hosts or routers on-path may lie

9 Data-Plane Accountability Problem: Network elements drop packets, fail, and otherwise give rise to poor performance One Solution: In-Band Path Diagnosis Routers keep track of number of packets seen per flow Each router stamps each packet with current flow counter value If current counter value does not equal routers expected packet count for that flow, router marks packet IP Header New Shim Header Transport header High-level Overview

10 Detailed Operation Suppose R2 and R3 have each lost one packet Next packet: R2 sees gap in counter value –Marks packet with its ID, updates flow counter value Subsequent packets contain marks for packets further downstream

11 Analysis of Accuracy Partially accurate: Faulty element identified, but not the correct number of lost packets –Example: Counter overflow Misleading: Network fault is attributed to the incorrect network element –Example: Packets containing information about packet loss are also lost No information: No information reported

12 Implementation and Evaluation Implementation in Click –Two main elements: ModifyIng, ModifyPkt Deployment on PL-VINI Evaluation under direct packet drops and induced routing instability

13 Coping: Scalable Path Diversity Problem: Hosts need mechanisms for recourse when a path does not perform as expected –For example, routing around faulty elements Solution: Additional bits in the packet header –End host sets bits to indicate Question: How to scalably provide this function?

14 Coping Mechanism: Multi-Path Deflection: Bits indicate to routers that the path should change (but not how) –Advantage: Simple –Disadvantage: Limited path diversity without introducing possibility for loops Path splicing: Bits indicate, at each hop, whether a router should use an alternative path –Challenge: Scalable dissemination and storage of information about alternate paths

15 Conclusion Routing protocols require better accountability, both in the control plane and the data plane Data-plane accountability requires complementary in- band mechanisms Orchid: In-band path diagnosis scheme based on packet marking and counters at routers –Implementation and deployment on PL-VINI –Accurate detection and location of packet loss –Extensible to other properties Next step: Coping mechanisms