15-849: Hot Topics in Networking Policy and Networks Srinivasan Seshan 1.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

A Policy Framework for a Secure Future Internet Jad Naous (Stanford University) Arun Seehra (UT Austin) Michael Walfish (UT Austin) David Mazières (Stanford.
Does BGP Solve the Shortest Paths Problem? Timothy G. Griffin Joint work with Bruce Shepherd and Gordon Wilfong Bell Laboratories, Lucent Technologies.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Tussle in cyberspace: Defining tomorrow ’ s internet (2002) D.Clark, J. Wroclawski, K. Sollins & R. Braden Presented by: Gergely Biczok (Slides in courtesy.
Lecture 14: Inter-domain Routing Stability CS 268 class March 8 th, 2004 (slides from Timothy Griffin’s tutorial and Craig Labovitz’s NANOG talk)
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
Interdomain Routing and The Border Gateway Protocol (BGP) Courtesy of Timothy G. Griffin Intel Research, Cambridge UK
CS 268: Future Internet Architectures Ion Stoica May 1, 2006.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao (UMass-Amherst)
BGP EE122 Discussion 11/7/11.
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Tussle in cyberspace: Defining tomorrow ’ s internet D.Clark, J.Wroclawski, K.Sollins & R.Braden Presented by: Ao-Jan Su (Slides in courtesy of: Baoning.
IP Routing CS 552 Richard Martin (with slides from S. Savage and S. Agarwal)
Computer Networking Lecture 10: Inter-Domain Routing
Future Research Directions Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Internet Routing (COS 598A) Today: Interdomain Traffic Engineering Jennifer Rexford Tuesdays/Thursdays.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Economic Incentives in Internet Routing Jennifer Rexford Princeton University
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
BGP Border Gateway Protocol EE122 Section 3. Border Gateway Protocol Protocol for inter-domain routing Designed for policy and privacy Why not distance-vector?
Inter-domain Routing Outline Border Gateway Protocol.
Information-Centric Networks04a-1 Week 4 / Paper 1 Open issues in Interdomain Routing: a survey –Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure.
Egress Route Selection for Interdomain Traffic Engineering Design considerations beyond BGP.
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
Tussel in Cyberspace Based on Slides by I. Stoica.
1 Interdomain Routing (BGP) By Behzad Akbari Fall 2008 These slides are based on the slides of Ion Stoica (UCB) and Shivkumar (RPI)
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Req1 - Separability Old: –An RO scheme MUST have the ability to be bypassed by traffic types that desire to use bidirectional tunnels through an HA. New:
How Secure are Secure Inter- Domain Routing Protocols? SIGCOMM 2010 Presenter: kcir.
CS 268: Lecture 9 Inter-domain Routing Protocol Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
Lecture 4: BGP Presentations Lab information H/W update.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Policy and mechanism in the future Internet Michael Walfish The University of Texas at Austin in collaboration with: Arun Seehra (UT Austin), Jad Naous.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
CS 268: Lecture 11 Inter-domain Routing Protocol Karthik Lakshminarayanan UC Berkeley (substituting for Ion Stoica) (*slides from Timothy Griffin and Craig.
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao,
Approaches to Multi6 An Architectural View of Multi6 proposals Geoff Huston March 2004.
Concerns with Network Research Funding S.Floyd & R. Atkinson, Editors Internet Architecture Board draft-iab-research-funding-02.txt.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
15-744: Computer Networking
Inter-domain Routing Outline Border Gateway Protocol.
CSci5221: BGP Policies1 Inter-Domain Routing: BGP, Routing Policies, etc. BGP Path Selection and Policy Routing Stable Path Problem and Policy Conflicts.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
1 Internet Routing: BGP Routing Convergence Jennifer Rexford Princeton University
A policy framework for the future Internet
COS 561: Advanced Computer Networks
Can Economic Incentives Make the ‘Net Work?
A policy framework for the future Internet
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
An Update on Multihoming in IPv6 Report on IETF Activity
COS 561: Advanced Computer Networks
BGP Policies Jennifer Rexford
COMP/ELEC 429/556 Introduction to Computer Networks
BGP Interactions Jennifer Rexford
COS 461: Computer Networks
COS 561: Advanced Computer Networks
Fixing the Internet: Think Locally, Impact Globally
BGP Instability Jennifer Rexford
Presentation transcript:

15-849: Hot Topics in Networking Policy and Networks Srinivasan Seshan 1

Key Questions 1.Type of policies: Consider the motivation behind different policies (economic, security, application stability, etc.). What properties of each of these can we leverage in designing policy support in the network. 2.Stakeholders: Who are all the stakeholders that we need to consider. Is there an obvious prioritization among these or should everyone have equal weight/veto power. 3.Negotiation: Is policy static or something that is dynamically negotiated (i.e. everything has a price)? If so, what role does this place on policy support. 4.Efficiency and stability. 5.Privacy: Must I reveal my policies? 2

3 Policy with BGP BGP provides capability for enforcing various policies Policies are not part of BGP: they are provided to BGP as configuration information BGP enforces policies by choosing paths from multiple alternatives and controlling advertisement to other AS’s Import policy What to do with routes learned from neighbors? Selecting best path Export policy What routes to announce to neighbors? Depends on relationship with neighbor

4 Examples of BGP Policies A multi-homed AS refuses to act as transit Limit path advertisement A multi-homed AS can become transit for some AS’s Only advertise paths to some AS’s Eg: A Tier-2 provider multi-homed to Tier-1 providers An AS can favor or disfavor certain AS’s for traffic transit from itself

5 Export Policy An AS exports only best paths to its neighbors Guarantees that once the route is announced the AS is willing to transit traffic on that route To Customers Announce all routes learned from peers, providers and customers, and self-origin routes To Providers Announce routes learned from customers and self- origin routes To Peers Announce routes learned from customers and self- origin routes

6 Import Routes From peer From peer From provider From provider From customer From customer provider routecustomer routepeer routeISP route

7 Export Routes To peer To peer To customer To customer To provider From provider provider routecustomer routepeer routeISP route filters block

8 Key Problem - Stability Varadhan, Govindan, & Estrin, “Persistent Route Oscillations in Interdomain Routing”, 1996

9 Limits to Policy? Permit only two business arrangements Customer-provider Peering Constrain both filtering and ranking based on these arrangements to guarantee safety Surprising result: these arrangements correspond to today’s (common) behavior Gao & Rexford, “Stable Internet Routing without Global Coordination”, IEEE/ACM ToN, 2001

Other Considerations (Tussle) Design for variation in outcome Allow design to be flexible to different uses/results Isolate tussles QoS designs uses separate ToS bits instead of overloading other parts of packet like port number Separate QoS decisions from application/protocol design Provide choice  allow all parties to make choices on interactions Creates competition Fear between providers helps shape the tussle 10

Who should control communications? What should they control? Many Internet stakeholders: senders, receivers, transit providers, edge providers, middleboxes, … Each has many valid policy goals Where do your sympathies lie?

Prior proposals: large union, small intersection Proposals generally choose particular concerns To the exclusion of other concerns Our community: lots of sympathy, little consensus x o o o o o source routing BGP o x o - - o x o o - o x o o o o x o o o o x o o o o x NIRA o x TVA o x o - - o o - - o x o NUTSS - - o - - x i3, DOALSRR o o o o x - o o o x - - o o x o x

So what options does our community have? Embrace the status quo: do nothing This is architectural abdication Make a hard choice: select the “right” subset This would be a gamble On a choice that must last another 30 years By a community not known for accurate predictions Choose “all of the above”: take the union of controls This preserves our options; no picking winners/losers The late binding avoids guesses about unknowables

Key Questions 1.Type of policies: Consider the motivation behind different policies (economic, security, application stability, etc.). What properties of each of these can we leverage in designing policy support in the network. 2.Stakeholders: Who are all the stakeholders that we need to consider. Is there an obvious prioritization among these or should everyone have equal weight/veto power. 3.Negotiation: Is policy static or something that is dynamically negotiated (i.e. everything has a price)? If so, what role does this place on policy support. 4.Efficiency and stability. 5.Privacy: Must I reveal my policies? 14