Mutually Controlled Routing with Independent ISPs Offense Gary Bramwell Zhaosheng Zhu.

Slides:



Advertisements
Similar presentations
Mutually Controlled Routing with Independent ISPs
Advertisements

Quality of Service CS 457 Presentation Xue Gu Nov 15, 2001.
Micro-loop Prevention Methods draft-bryant-shand-lf-conv-frmwk-00.txt draft-zinin-microloop-analysis-00.txt.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
Restoration by Path Concatenation: Fast Recovery of MPLS Paths Anat Bremler-Barr Yehuda Afek Haim Kaplan Tel-Aviv University Edith Cohen Michael Merritt.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
The need for BGP AfNOG Workshops Philip Smith. “Keeping Local Traffic Local”
Advanced Topics of WAN Compiled from Previous ISQS 6341 Project November 2003.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
EIGRP routing protocol Omer ben-shalom Omer Ben-Shalom: Must show how EIGRP is dealing with count to infinity problem Omer Ben-Shalom: Must.
DYNAMICS OF PREFIX USAGE AT AN EDGE ROUTER Kaustubh Gadkari, Dan Massey and Christos Papadopoulos 1.
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian* Matthew Caesar* Cheng Tien Ee*, Mark Handley° Morley Maoª, Scott Shenker*
Practical and Configuration issues of BGP and Policy routing Cameron Harvey Simon Fraser University.
Tutorial 5 Safe Routing With BGP Based on: Internet.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
(c) Anirban Banerjee, Winter 2005, CS-240, 2/1/2005. The Impact of Internet Policy and Topology on Delayed Routing convergence C. Labovitz, A. Ahuja, R.
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
Feedback Based Routing By Dapeng Zhu, Mark Gritter, and David R. Cheriton.
Wireless Sensor Network for Tracking the Traffic in INTERNET Network Routers Part 2 Supervisor:Mark Shifrin Students:Yuri Kipnis Nir Bar-Or Date:30 September.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
NEtwork MObility By: Kristin Belanger. Contents Introduction Introduction Mobile Devices Mobile Devices Objectives Objectives Security Security Solution.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Better by a HAIR: Hardware-Amenable Internet Routing Brent Mochizuki University of Illinois at Urbana-Champaign Joint work with: Firat Kiyak (Illinois)
Computer Networks Layering and Routing Dina Katabi
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
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),
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
How Secure are Secure Inter- Domain Routing Protocols? SIGCOMM 2010 Presenter: kcir.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
ATM Switches Cells Scalable QoS Perspective Virtual Circuits.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
A Case Study in Understanding OSPFv2 and BGP4 Interactions Using Efficient Experiment Design David Bauer†, Murat Yuksel‡, Christopher Carothers† and Shivkumar.
U Innsbruck Informatik - 1 CADPC/PTP in a nutshell Michael Welzl
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
ESRT: Event to Sink Reliable Transport in Sensor Networks Yogesh S., O. Akan, I. Akyildiz (GaTech) ECE 256 Spring 2009.
Network-Coding Multicast Networks With QoS Guarantees Yuanzhe Xuan and Chin-Tau Lea, Senior Member, IEEE IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19,
1 Quantifying Path Exploration in the Internet Ricardo Oliveira, Rafit Izhak-Ratzin, Lixia Zhang, UCLA Beichuan Zhang, UArizona Dan Pei, AT&T Labs -- Research.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
Michael Schapira Yale and UC Berkeley Joint work with P. Brighten Godfrey, Aviv Zohar and Scott Shenker.
Two-Tier Resource Management Designed after the Internet’s two-tier routing hierarchy Separate packet forwarding from admission and resource allocation.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
Routers Operate in a Mesh –Many possible alternative routes between two stations Only One of Many Possible Alternative Routes Packet.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
Fast recovery in IP networks using Multiple Routing Configurations Amund Kvalbein Simula Research Laboratory.
1 Version 3.1 Module 6 Routed & Routing Protocols.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—5-1 Customer-to-Provider Connectivity with BGP Understanding Customer-to-Provider Connectivity.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Redundancy. Single point of failure Hierarchical design produces many single points of failure Redundancy provides alternate paths, but may undermine.
1 On the Interaction between Dynamic Routing in the Native and Overlay Layers Infocom2006 Srinivasan Seetharaman and Mostafa Ammar College of Computing.
Yiting Xia, T. S. Eugene Ng Rice University
Link-Level Internet Structures
New Directions in Routing
Power Prefixes Prioritization for Smarter BGP Reconvergence
Introduction to Internet Routing
Routing: Distance Vector Algorithm
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 461: Computer Networks
Presentation transcript:

Mutually Controlled Routing with Independent ISPs Offense Gary Bramwell Zhaosheng Zhu

2 Good for every ISP? r They say in nearly every case it brings benefit for every ISPs.  Admits that some ISPs lose “The graph shows that a handful of ISPs do lose a little. These are small, edge ISPs for whom the changed routing pattern represents a minor loss according to our measure.” r What is a “minor loss”? r It makes path selection sensitive to the concerns of both ISPs. But why is this win-win? No proof

3 Is it stable r One link cost change will cost time to converge r Link costs change with traffic m Delay and congestion never constant m Recalculation will be frequent and expensive

4 Why Global?  How to define a global optimization? Someone prefer minimal path length while someone prefer minimal loss rate.  What is the goal of global optimization?  Should ISPs care about this?  ISPs care about local optimization over global

5 Implementation Issues r Using one router to re-normalize costs m Drastically increases convergence time m Other routers behave as if changes don’t occur until calculation is complete m Lowering priority of the calculation enhances these issues m Single point of failure

6 Win-Win? r Claims that Wiser is win-win for everyone m Some ISPs still have a loss m No motivation to implement protocol r Counterclaim - re-negotiate normalizations for ISPs who lose m Increases complexity for ISPs over current BGP agreements r What is ‘Gain’? m Not clearly defined

7 Cheating r Harder to detect cheating vs. BGP m BGP just considers reachability, but Wiser allows costs to be cheated as well m Harder to determine, as ISPs rely on data from one another to determine costs m Several ISPs working together to cheat not tested

8 Cheating r Pair of ISPs studied, % of ISPs cheating makes no sense

9 Convergence r Convergence takes far longer for Wiser than BGP m Several orders of magnitude worse m Unacceptable for QoS

10 Convergence

11 Conclusion r Wiser still creates a loss for some ISPs r Stability issues still need to be addressed m Convergence time m Points of failure for calculating changes r Cheating must be investigated more r Not enough motivation for ISPs to adopt m Benefits not clearly defined