Mutually Controlled Routing with Independent ISPs

Slides:



Advertisements
Similar presentations
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.
Advertisements

A simple coordination mechanism for interdomain routing Ratul Mahajan * David Wetherall Tom Anderson University of Washington ( * Microsoft Research)
Using Network Virtualization Techniques for Scalable Routing Nick Feamster, Georgia Tech Lixin Gao, UMass Amherst Jennifer Rexford, Princeton University.
Path Splicing with Network Slicing
Multihoming and Multi-path Routing
Multihoming and Multi-path Routing
Internet Protocols and Innovation John C Klensin John C Klensin and Associates
Address-based Route Reflection Ruichuan Chen (MPI-SWS) Aman Shaikh (AT&T Labs - Research) Jia Wang (AT&T Labs - Research) Paul Francis (MPI-SWS) CoNEXT.
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
A.De Santis Radiative Meeting 30/05/07 Cross section e e Antonio De Santis Simona Giovannella.
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
TU / e /AIS Group Technische Universiteit Eindhoven University of Technology Modeling Grid Workflows with Colored Petri Nets Carmen Bratosin, Wil van der.
Control-theory and models at runtime Pierre-Alain Muller 1, Olivier Barais 2, Franck Fleurey 2 1 Université de Haute-Alsace Mulhouse, France 2 IRISA /
Multihoming and Multi-path Routing CS 7260 Nick Feamster January
Fred Hills Richard Leslie McLennan Community College.
2003/04/071 Characteristic of 850-nm InGaAs/AlGaAs Vertical-Cavity Surface-Emitting Lasers Master’s thesis of Yuni Chang Speaker:Han-Yi Chu National Changhua.
New Opportunities for Load Balancing in Network-Wide Intrusion Detection Systems Victor Heorhiadi, Michael K. Reiter, Vyas Sekar UNC Chapel Hill UNC Chapel.
Traffic Engineering with Forward Fault Correction (FFC)
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Advanced Networks 1. Delayed Internet Routing Convergence 2. The Impact of Internet Policy and Topology on Delayed Routing Convergence.
Dongkee LEE 1 Understanding BGP Misconfiguration Ratul Mahajan, David Wetherall, Tom Anderson.
User-level Internet Path Diagnosis Ratul Mahajan, Neil Spring, David Wetherall and Thomas Anderson Designed by Yao Zhao.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
1 BGP Anomaly Detection in an ISP Jian Wu (U. Michigan) Z. Morley Mao (U. Michigan) Jennifer Rexford (Princeton) Jia Wang (AT&T Labs)
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
1 Internet Path Inflation Xenofontas Dimitropoulos.
A Study of Multiple IP Link Failure Fang Yu
1 In VINI Veritas: Realistic and Controlled Network Experimentation Jennifer Rexford with Andy Bavier, Nick Feamster, Mark Huang, and Larry Peterson
Traffic Engineering With Traditional IP Routing Protocols
A Routing Control Platform for Managing IP Networks Jennifer Rexford Computer Science Department Princeton University
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Mutually Controlled Routing with Independent ISPs Offense Gary Bramwell Zhaosheng Zhu.
Wresting Control from BGP: Scalable Fine-grained Route Control UCSD / AT&T Research Usenix —June 22, 2007 Dan Pei, Tom Scholl, Aman Shaikh, Alex C. Snoeren,
1 Design and implementation of a Routing Control Platform Matthew Caesar, Donald Caldwell, Nick Feamster, Jennifer Rexford, Aman Shaikh, Jacobus van der.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Economic Incentives in Internet Routing Jennifer Rexford Princeton University
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Tesseract A 4D Network Control Plane
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Augmenting Mobile 3G Using WiFi Aruna Balasubramanian Ratul Mahajan Arun Venkataramani University of Massachusetts Microsoft Research.
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
Computer Networks Layering and Routing Dina Katabi
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
By Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenker Presented by Fei Jia Revisiting IP Multicast.
Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
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‡
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
THE IMPACT OF OSPF ROUTING ON MILITARY MANETS BY ROCCO LUPOI UNDER THE GUIDANCE OF DR. GRANT WIGLEY THESIS - BACHELOR OF COMPUTER SCIENCE (HONOURS) - LHIS.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
Network Computing Laboratory Load Balancing and Stability Issues in Algorithms for Service Composition Bhaskaran Raman & Randy H.Katz U.C Berkeley INFOCOM.
SIP Overload Control draft-hilt-sipping-overload-00 Volker Hilt Daryl Malas Indra Widjaja
Doing Don’ts: Modifying BGP Attributes within an Autonomous System Luca Cittadini, Stefano Vissicchio, Giuseppe Di Battista Università degli Studi RomaTre.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Working at a Small-to-Medium Business or ISP – Chapter 6
Architecture and Algorithms for an IEEE 802
COS 561: Advanced Computer Networks
Introduction to Internet Routing
ISP and Egress Path Selection for Multihomed Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Working at a Small-to-Medium Business or ISP – Chapter 6
Process Wind Tunnel for Improving Business Processes
Presentation transcript:

Mutually Controlled Routing with Independent ISPs Ratul Mahajan Microsoft Research David Wetherall University of Washington Intel Research Tom Anderson University of Washington

Conflict in Internet routing today ISPs simultaneously cooperate and compete in a contractual framework Paths are usually decided by upstream ISPs ISPs have little control over incoming traffic End-to-end paths can be longer than necessary ratul | nsdi | '07

A real incident Sprint ATT overload Seattle Sprint ATT San Francisco overload Paths are longer than necessary because ATT unilaterally controls paths ratul | nsdi | '07

Goal: Provide joint control over routing Constraints due to ISP independence Be individually beneficial (“win-win”) Not require ISPs to disclose sensitive info Enable ISPs to optimize for their criteria Retain contractual framework and low overhead ratul | nsdi | '07

On protocol design in systems with competing interests “The most important change in the Internet architecture over the next few years will probably be the development of a new generation of tools for management of resources in the context of multiple administrations.” -- David Clark, 1988 ratul | nsdi | '07

Our solution: Wiser Operates in shortest-path routing framework 1 7 D [1] D 3 2 D [3] S 1 11 D [11] Operates in shortest-path routing framework Downstream ISPs advertise “agnostic” costs Upstream ISPs select paths based on their own and received costs ratul | nsdi | '07

Problems with vanilla shortest-path routing Can be easily gamed ISPs can lie about their costs ISPs may ignore others’ costs May not be win-win ISPs’ costs may be incomparable ratul | nsdi | '07

Normalize costs so no ISP dominates 1 0.7 10 7 3 30 2 2 5 11 1 7.3 110 4.3 ratul | nsdi | '07

Monitoring the behavior of upstream ISPs 0.7 7 2/3.3 2 2 1 7.3 7.3/3.3 Downstream ISPs monitor the ratio of average cost of paths used and average announced cost Contractually limit this ratio ratul | nsdi | '07

Wiser across multiple ISPs c3 = c1l + internal path cost D, {OG}, c3 O c1l c3l D, {OG}, c4 D, {G}, c1 c4l G S D, {G}, c2 D B c5l D, {YG}, c5 c2l Y Select paths based on local and received costs Convert incoming costs using the normalization factor Add internal costs while propagating routes Announce costs in routing messages ratul | nsdi | '07

Going from BGP to Wiser Simple, backward-compatible extensions Embed costs in non-transitive BGP communities Border routers jointly compute normalization factors and log cost usage Slightly modified path selection decision Retains today’s contractual framework Benefits even the first two ISPs that deploy it A prototype in XORP is publicly available ratul | nsdi | '07

Evaluation What is the benefit of Wiser? How much can ISPs gain by cheating? What is the overhead of Wiser? Methodology: Combine measured data and realistic models Topology: city-level maps of 65 ISPs ratul | nsdi | '07

Some paths are very long with BGP % length inflation 50 1.0 10 1.4 5 2.0 1 5.9 cumulative % of flows BGP path length inflation relative to optimal ratul | nsdi | '07

Wiser paths are close to optimal BGP Wiser % length inflation BGP Wiser 50 1.0 10 1.4 1.1 5 2.0 1.2 1 5.9 1.5 cumulative % of flows BGP Wiser path length inflation relative to optimal ratul | nsdi | '07

Wiser requires less capacity to handle failures BGP cumulative % of ISPs additional capacity (%) relative to stable load ratul | nsdi | '07

Wiser limits the impact of cheating Dishonest ISP Honest ISP Cumulative % of ISPs Cumulative % of ISPs ISP gain (%) relative to BGP ISP gain (%) relative to BGP ISP gain (%) relative to BGP two honest ISPs (Wiser) one dishonest ISP (no constraints) one dishonest ISP (Wiser) ratul | nsdi | '07

Overhead of Wiser Implementation complexity Computational requirements Two implementations: XORP and SSFNet (simulator) Less than 6% additional LoC (base ~ 30k) Computational requirements 15-25% higher than BGP for normal workload Convergence time Higher than BGP but acceptable even for large failures Routing message rate Comparable to BGP ratul | nsdi | '07

Concluding thoughts Wiser provides joint control over routing to ISPs Competing interests don’t lead to significant efficiency loss in Internet routing Evidence that practical protocols can harness competing interests ratul | nsdi | '07