Can Economic Incentives Make the ‘Net Work? Jennifer Rexford Princeton University

Slides:



Advertisements
Similar presentations
Does BGP Solve the Shortest Paths Problem? Timothy G. Griffin Joint work with Bruce Shepherd and Gordon Wilfong Bell Laboratories, Lucent Technologies.
Advertisements

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 and Games Hagay Levin, Michael Schapira and Aviv Zohar The Hebrew University.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
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.
SCHOOL OF INFORMATION UNIVERSITY OF MICHIGAN si.umich.edu Searching for Stability in Interdomain Routing Rahul Sami (University of Michigan) Michael Schapira.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Neighbor-Specific BGP (NS-BGP): More Flexible Routing Policies While Improving Global Stability Yi Wang, Jennifer Rexford Princeton University Michael.
Announcement  Slides and reference materials available at  Slides and reference materials available.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Putting BGP on the Right Path: A Case for Next-Hop Routing Michael Schapira (Yale University and UC Berkeley) Joint work with Yaping Zhu and Jennifer Rexford.
STABLE PATH PROBLEM Presented by: Sangeetha A. J. Based on The Stable Path Problem and Interdomain Routing Timothy G. Griffin, Bruce Shepherd, Gordon Wilfong.
Game Theoretic and Economic Perspectives on Interdomain Routing Michael Schapira Yale University and UC Berkeley.
BGP Safety with Spurious Updates Martin Suchara in collaboration with: Alex Fabrikant and Jennifer Rexford IEEE INFOCOM April 14, 2011.
Traffic Engineering With Traditional IP Routing Protocols
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
New Routing Architectures Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao (UMass-Amherst)
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
1 Future Internet Architectures: Toward an Architecture-Agnostic Architecture Jennifer Rexford Princeton University
On the Stability of Rational, Heterogeneous Interdomain Route Selection Hao Wang Yale University Joint work with Haiyong Xie, Y. Richard Yang, Avi Silberschatz,
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
1 Different Strokes for Different Folks (Or, How I Learned to Stop Worrying and Love Virtualization) Jennifer Rexford, Princeton University Joint work.
Economic Incentives in Internet Routing Jennifer Rexford Princeton University
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
1 Interdomain Routing Policy Reading: Sections plus optional reading COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford.
Building a Strong Foundation for a Future Internet Jennifer Rexford Princeton University
Building a Strong Foundation for a Future Internet Jennifer Rexford Princeton University
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
The Future of the Internet Jennifer Rexford ’91 Computer Science Department Princeton University
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)
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Inter-domain Routing Outline Border Gateway Protocol.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
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.
1 Controlling IP Spoofing via Inter-Domain Packet Filters Zhenhai Duan Department of Computer Science Florida State University.
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.
1 Cabo: Concurrent Architectures are Better than One Jennifer Rexford Princeton University Joint work with Nick Feamster.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
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.
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao,
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
CSci5221: BGP Policies1 Inter-Domain Routing: BGP, Routing Policies, etc. BGP Path Selection and Policy Routing Stable Path Problem and Policy Conflicts.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
1 Internet Routing: BGP Routing Convergence Jennifer Rexford Princeton University
1 Internet Routing 4/12/2012. Admin. r Exam 2 date: m Wednesday, May 2 at 2:00 p.m. m If you want to take the exam in another day (e.g. due to travel),
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
New Directions in Routing
COS 561: Advanced Computer Networks
Can Economic Incentives Make the ‘Net Work?
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
BGP Policies Jennifer Rexford
COS 461: Computer Networks
COS 561: Advanced Computer Networks
Fixing the Internet: Think Locally, Impact Globally
BGP Instability Jennifer Rexford
Presentation transcript:

Can Economic Incentives Make the ‘Net Work? Jennifer Rexford Princeton University

2 What is an Internet? A “network of networks” –Networks run by different institutions Autonomous System (AS) –Collection of routers run by a single institution ASes have their own local goals –E.g., different views of which paths are good Interdomain routing reconciles those views –Computes end-to-end paths through the Internet Wonderful problem setting for game theory and mechanism design

3 Three Parts to This Talk Today’s interdomain routing –Protocol allows global oscillation to occur –Yet, rational behavior ensures global stability Improving today’s interdomain routing –Today’s routing system is not flexible enough –Allow greater flexibility while ensuring stability Rethinking the Internet routing architecture –Refactoring the business relationships entirely –Raising a host of new open questions…

4 Autonomous Systems (ASes) Client Web server Path: 6, 5, 4, 3, 2, 1 Around 35,000 ASes today…

5 Border Gateway Protocol (BGP) ASes exchange reachability information –Destination: block of IP addresses –AS path: sequence of ASes along the path Policies “programmed” by network operators –Path selection: which path to use? –Path export: which neighbors to tell? 1 23 d “I can reach d” “I can reach d via AS 1” data traffic

6 Stable Paths Problem (SPP) Model Model of routing policy –Each AS has a ranking of the permissible paths Model of path selection –Pick the highest-ranked path consistent with neighbors Flexibility is not free –Global system may not converge to a stable assignment –Depending on the way the ASes rank their paths 1 2 d 1 d 2 3 d 2 d 3 1 d 3 d d

7 Policy Conflicts  Convergence Problems In the meantime, data traffic is going every which way… Only choice! Top choice! Only choice! Better choice! Only choice! Better choice!

8 Ways to Achieve Global Stability Detect conflicting rankings of paths? –Computationally intractable (NP-hard) –Requires global coordination Restrict the policy configuration languages? –In what way? How to require this globally? –What if the world should change, and the protocol can’t? Rely on economic incentives? –Policies typically driven by business relationships –E.g., customer-provider and peer-peer relationships –Sufficient conditions to guarantee unique, stable solution

9 Bilateral Business Relationships Provider-Customer –Customer pays provider for access to the Internet Peer-Peer –Peers carry traffic between their respective customers d Provider-Customer Peer-Peer Valid paths: “1 2 d” and “7 d” Invalid path: “5 8 d” Valid paths: “6 4 3 d” and “8 5 d” Invalid paths: “6 5 d” and “1 4 3 d”

10 Act Locally, Prove Globally Global topology –Provider-customer relationship graph is acyclic –Peer-peer relationships between any pairs of ASes Route export –Do not export routes learned from a peer or provider –… to another peer or provider Route selection –Prefer routes through customers –… over routes through peers and providers Guaranteed to converge to unique, stable solution

11 Rough Sketch of the Proof Two phases –Walking up the customer-provider hierarchy –Walking down the provider-customer hierarchy d Provider-Customer Peer-Peer

12 Trade-offs Between Assumptions Three kinds of assumptions –Route export, route selection, global topology –Relax one, must tighten the other two Are these assumptions reasonable? –Could business practices change over time? Two unappealing features –An AS picks a single best route –An AS must prefer routes through customers

13 A Case For Customized Route Selection ISPs usually have multiple paths to the destination Different paths have different properties Different neighbors may prefer different routes 13 Bank VoIP provider School Most secure Shortest latency Lowest cost

14 Neighbor-Specific Route Selection A node has a ranking function per neighbor 14 is node i’s ranking function for neighbor node j.

15 Stability Conditions for NS-BGP Surprisingly, NS-BGP improves stability! –Neighbor-specific selection is more flexible –Yet, requires less restrictive stability conditions “Prefer customer” assumption is not needed –Choose any “permissible” route per neighbor That is, need just two assumptions –No cycle of provider-customer relationships –An AS does not export routes learned from one peer or provider to other peers or providers

16 Why Do Weaker Conditions Work? An AS always tells its neighbor a route –If it has any route that is permissible for that neighbor

17 Customized Route Selection Customized route selection as a service –Select a different best route for different neighbors Different menu options –Cheapest route (e.g., “prefer customer”) –Best performing routes –Routes that avoid undesirable ASes (e.g., censorship) Nice practical features of NS-BGP –An individual AS can deploy NS-BGP alone –… and immediately gain economic value –Without compromising global stability!

18 Looking Forward: “Cloud Networking” –In Today’s Internet Competing ASes with different goals must coordinate Tomorrow’s Internet Hosting “virtual networks” over infrastructure owned by many parties Infrastructure providers: Own routers, links, data centers Service providers: Offer end-to-end services to users Economics play out vertically on a coarser timescale.

19 Advantages of Virtual Networks Simplifies deployment of new technologies –Easier to deploy in a single (virtual) network –Multicast, quality-of-service, security, IPv6, … Enables the use of customized protocols –Secure addressing & routing for online banking –Anonymity for Web browsing –Low delay for VoIP and gaming Greater accountability –Direct relationship with infrastructure providers –Account for performance/reliability of virtual links

20 Conclusions Internet is a network of networks –Tens of thousands of Autonomous Systems (ASes) Network protocols are very flexible –To enable autonomy and extensibility Global properties are not necessary ensured –Stability, efficiency, reliability, security, managability, … Economic incentives sometimes save the day –E.g., rational local choices ensure global stability Are we willing to rely on economic motivations? –Do we have any choice?

21 References Related to This Talk “The stable paths problem and interdomain routing” –Tim Griffin, Bruce Shepherd, and Gordon Wilfong – “Stable Internet routing without global coordination” –Lixin Gao and Jennifer Rexford – "Neighbor-Specific BGP: More flexible routing policies while improving global stability“ –Yi Wang, Michael Schapira, and Jennifer Rexford – "How to lease the Internet in your spare time" –Nick Feamster, Lixin Gao, and Jennifer Rexford –

22 Other Related Research Papers Inherently Safe Backup Routing with BGP – Design Principles of Policy Languages for Path Vector Protocols – griffin.pdfhttp://conferences.sigcomm.org/sigcomm/2003/papers/p61- griffin.pdf Implications of Autonomy for the Expressiveness of Policy Routing – Metarouting – An Algebraic Theory of Interdomain Routing – Searching for Stability In Interdomain Routing –

23 Related Papers With Game Theory Interdomain Routing and Games – Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP – Incentive-Compatible Interdomain Routing – Mechanism Design for Policy Routing – The Complexity of Game Dynamics: BGP Oscillations, Sink Equlibria, and Beyond – Specification Faithfulness in Networks with Rational Nodes – Distributed Algorithmic Mechanism Design – Partially Optimal Routing –

24 Background on Interdomain Economics /about_cisco_ipj_archive_article09186a00800c83a5.htmlhttp:// 01/about_cisco_ipj_archive_article09186a00800c83a5.html 00/about_cisco_ipj_archive_article09186a00800c8900.htmlhttp:// 00/about_cisco_ipj_archive_article09186a00800c8900.html