A polytheistic approach to securing interdomain routing Ratul Mahajan Microsoft Research.

Slides:



Advertisements
Similar presentations
Self-Managed Future Wireless Networks? Lixin Gao University of Massachusetts, Amherst.
Advertisements

Copyright © hutchinson associates 2006 Organizational Network Analysis Patti Anklam.
A simple coordination mechanism for interdomain routing Ratul Mahajan * David Wetherall Tom Anderson University of Washington ( * Microsoft Research)
WWW May EC Semantic Web Research Current Activities Horst Forster European Commission DG Information Society and Media Directorate E « Content.
14 Sep 2006NVO Summer School T HE US N ATIONAL V IRTUAL O BSERVATORY Simple SSA Query Kelly McCusker Amy Kimball Mike Koss Phil Warner Melinda Mello.
Modelling self-reliance, evacuation and fire fighting activities during a large fire in a public building – a dynamic approach Daniela Hanea MSc.:
European Week of Regions and Cities The Leader Approach from a Local Perspective Günter Salchner LAG Ausserfern/Austria.
Thomas Ball Microsoft Research. C# 3.0C# 3.0 Visual Basic 9.0Visual Basic 9.0 OthersOthers.NET Language Integrated Query LINQ to Objects LINQ to DataSets.
View the home as a computer Ratul Mahajan Microsoft Research IEEE CCW, Oct 2011 Joint work with Sharad Agarwal, AJ Brush, Colin Dixon, Bongshin Lee, Stefan.
Highway Transportation System
6 July EFET Position on Information Transparency Paul Dawson, Barclays Capital ERGEG Public Hearing on Transparency 6 th July 2006.
For ALB Conference 2006 Outsourcing: reducing operational risk Adrian Amariei CEO, Axonite Adrian Amariei CEO, Axonite.
Crack WEP Lab Last Update Copyright 2014 Kenneth M. Chipps Ph.D.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: EIGRP Advanced Configurations and Troubleshooting Scaling.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 VLSM and CIDR Routing Protocols and Concepts – Chapter 6.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 VLSM and CIDR Routing Protocols and Concepts – Chapter 6.
Sign What You Really Care About - $ecure BGP AS Paths Efficiently Yang Xiang Zhiliang Wang Jianping Wu Xingang Shi Xia Yin Tsinghua University, Beijing.
Martin Suchara in collaboration with I. Avramopoulos and J. Rexford How Small Groups Can Secure Interdomain Routing.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
A. Haeberlen Having your Cake and Eating it too: Routing Security with Privacy Protections 1 HotNets-X (November 15, 2011) Alexander Gurney * Andreas Haeberlen.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
A Measurement Framework for Pin-Pointing Routing Changes Renata Teixeira (UC San Diego) with Jennifer Rexford (AT&T)
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Security & Efficiency in Ad- Hoc Routing Protocol with emphasis on Distance Vector and Link State. Ayo Fakolujo Wichita State University.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—6-1 Connecting an Enterprise Network to an ISP Network Considering the Advantages of Using BGP.
Wen Xu and Jennifer Rexford Princeton University MIRO : Multi-path Interdomain ROuting.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Introduction Our Topic: Mobile Security Why is mobile security important?
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
1 Chapter 22 Network layer Delivery, Forwarding and Routing (part2)
Simple Multihoming Experiment draft-huitema-multi6-experiment-00.txt Christian Huitema, Microsoft David Kessens, Nokia.
Resilience of the Internet Interconnection Ecosystem Chris Hall Ross Anderson Richard Clayton Evangelos Ouzounis Panagiotis Trimintzios WEIS 14 th June.
KTH Communication Systems Design 2002.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
1.4 Open source implement. Open source implement Open vs. Closed Software Architecture in Linux Systems Linux Kernel Clients and Daemon Servers Interface.
TRICKLE: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Networks Philip Levis, Neil Patel, Scott Shenker and David.
Sign What You Really Care About -- Secure BGP AS Paths Efficiently Yang Xiang, Z. Wang, J. Wu, X. Shi, X. Yin Tsinghua University, Beijing AsiaFI 2011.
Secure Origin BGP: What is (and isn't) in a name? Dan Wendlandt Princeton Routing Security Reading Group.
Spring 2013 Performance Final Review AA1CC. Format: 2 Questions Skills Needed: - Line of Best fit -Also known as a ______________ ______ -Properties of.
Presented by: Tony Reveldez GEOFF HUSTON B.Sc., M.Sc. Australian National University MATTIA ROSSI B.Eng.,M.Sc. Leopold- Franzens- Universitaet GEOFF ARMITAGE.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 VLSM and CIDR Routing Protocols and Concepts – Chapter 6.
SIGCOMM 2012 (August 16, 2012) Private and Verifiable Interdomain Routing Decisions Mingchen Zhao * Wenchao Zhou * Alexander Gurney * Andreas Haeberlen.
Detecting Selective Dropping Attacks in BGP Mooi Chuah Kun Huang November 2006.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Lab 3-5 Debrief.
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
1.4 Open source implement. Open source implement Open vs. Closed Software Architecture in Linux Systems Linux Kernel Clients and Daemon Servers Interface.
WeekActivitySkills 1The Maths of F1 Calculating speeds using distance and time, converting between units of measure for speed, distance and time. 2Crash.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—5-1 Customer-to-Provider Connectivity with BGP Connecting a Multihomed Customer to a Single Service.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Module Summary The multihomed customer network must exchange BGP information with both ISP.
Internet Routing Verification John “JI” Ioannidis AT&T Labs – Research Copyright © 2002 by John Ioannidis. All Rights Reserved.
The U.S. Poverty Measure and the Politics of Statistics Rebecca M. Blank U.S. Department of Commerce.
CPS 82, Fall IETF: Internet Engineering Task Force l “governs” the Internet (according to some)  What does this mean? Who elects the members?
Inter-domain Routing Outline Border Gateway Protocol.
1 Internet Routing: BGP Routing Convergence Jennifer Rexford Princeton University
Connecting an Enterprise Network to an ISP Network
Net 323 D: Networks Protocols
Net 323 D: Networks Protocols
COS 561: Advanced Computer Networks
Routing Protocols and Concepts – Chapter 6
COS 561: Advanced Computer Networks
BGP Security Jennifer Rexford Fall 2018 (TTh 1:30-2:50 in Friend 006)
Fixing the Internet: Think Locally, Impact Globally
Routing Protocols and Concepts – Chapter 6
Routing Protocols and Concepts – Chapter 6
Presentation transcript:

A polytheistic approach to securing interdomain routing Ratul Mahajan Microsoft Research

ratul | wired | Much work on interdomain routing security but little deployment Myriads of security protocols S-BGP soBGP SPV Listen and Whisper IRV psBGP Pretty Good BGP …

ratul | wired | How can we explain that? Is the problem not important? Are all those approaches broken? Maybe, its futile to look for the one perfect solution One size does not fit all Coordination Incentives

ratul | wired | A polytheistic approach Instead of designing one solution for everyone, design a broad range ISPs pick zero or more, as per their needs

ratul | wired | How is this chaos secure? Lessons from the road network Different cars, drivers, skill-levels But the network is reasonably secure Two key underlying factors visibility and financial disincentives Hypothesis: routing can be secured by engineering these factors

ratul | wired | Simple changes are enough Engineering visibility Pinpoint who is sourcing and propagating bad routing updates Engineering financial disincentives Build on bilateral contracts Penalties for sending bad updates to neighbors No need for regulation

ratul | wired | The end result Appropriate aligning of incentives Each ISP does what it takes to run a secure network Security properties similar to the road network accident prevention is not guaranteed