Modelling Inter-Domain Routing

Similar documents
Building an AS-Topology Model that Captures Route Diversity

Modeling the Routing of an ISP

Building an AS-topology model that captures route diversity

Modeling the Routing of an ISP with C-BGP

Interdomain routing with BGP4 C BGP. A new approach to BGP simulation. (1/2)

Inter-Autonomous-System Routing: Border Gateway Protocol

Lecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011

Communication Networks

Dynamics of Hot-Potato Routing in IP Networks

Inter-Autonomous-System Routing: Border Gateway Protocol

Border Gateway Protocol (an introduction) Karst Koymans. Monday, March 10, 2014

Interdomain routing with BGP4 Part 4/5

BGP Attributes and Path Selection

In Search for an Appropriate Granularity to Model Routing Policies

CS4450. Computer Networks: Architecture and Protocols. Lecture 15 BGP. Spring 2018 Rachit Agarwal

ISP Border Definition. Alexander Azimov

Interdomain Routing. Networked Systems (H) Lecture 11

BGP Routing and BGP Policy. BGP Routing. Agenda. BGP Routing Information Base. L47 - BGP Routing. L47 - BGP Routing

Professor Yashar Ganjali Department of Computer Science University of Toronto.

BGP. Autonomous system (AS) BGP version 4

Quantifying the BGP routes diversity inside a tier-1 network

COM-208: Computer Networks - Homework 6

BGP. Autonomous system (AS) BGP version 4

BGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)

State of routing research

Advanced Computer Networks

BGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013

Border Gateway Protocol (an introduction) Karst Koymans. Tuesday, March 8, 2016

DE-CIX Academy: BGP - Multihoming

Master Course Computer Networks IN2097

Modeling the Routing of an Autonomous System with C-BGP

Backbone Networks. Networking Case Studies. Backbone Networks. Backbone Topology. Mike Freedman COS 461: Computer Networks.

Inter-Domain Routing: BGP II

BGP. Autonomous system (AS) BGP version 4

TELE 301 Network Management

Evaluating the Benefits of the Locator/Identifier Separation

Interdomain Routing Reading: Sections P&D 4.3.{3,4}

BGP-aware IGP Link Weight Optimization in Presence of Route Reflectors

Providing scalable NH-diverse ibgp route redistribution to achieve sub-second switch-over time

BGP. Autonomous system (AS) BGP version 4. Definition (AS Autonomous System)

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

BGP Route Propagation between Neighboring Domains

Lecture 19: Network Layer Routing in the Internet

Master Course Computer Networks IN2097

BGP Diverse Path Using a Diverse-Path Route Reflector

Impact of Routing Parameters on Route Diversity and Path Inflation

PART III. Implementing Inter-Network Relationships with BGP

How the Internet works? The Border Gateway Protocol (BGP)

COMP211 Chapter 5 Network Layer: The Control Plane

Internet Routing : Fundamentals of Computer Networks Bill Nace

Network-Wide Prediction of BGP Routes

Testing the reachability of (new) address space

Inter-AS routing and BGP. Network Layer 4-1

Inter-Domain Routing: BGP II

Lab Guide 2 - BGP Configuration

Internet Routing Protocols Lecture 01 & 02

BGP Routing inside an AS

Lecture 18: Border Gateway Protocol

Stable Internet Route Selection

A performance evaluation of BGP-based traffic engineering

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

Internet inter-as routing: BGP

Chapter 4: outline. Network Layer 4-1

Structural Evolution of the Internet Topology

On the Sensitivity of Transit ASes to Internal Failures

CS519: Computer Networks. Lecture 4, Part 5: Mar 1, 2004 Internet Routing:

Lecture 16: Border Gateway Protocol

Internet Routing Protocols Lecture 03 Inter-domain Routing

L11 : Inter-domain Routing with BGP Lecture14 Michaelmas, 2016

internet technologies and standards

Inter-Domain Routing: BGP

Internet Measurements. Motivation

Some Foundational Problems in Interdomain Routing

CSc 450/550 Computer Networks Internet Routing

CSCI-1680 Network Layer: Inter-domain Routing Rodrigo Fonseca

TO CONTROL the flow of traffic through their networks,

Border Gateway Protocol

Introduction to Computer Networks

Routing(2) Inter-domain Routing

Chapter IV: Network Layer

LARGE SCALE IP ROUTING LECTURE BY SEBASTIAN GRAF

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Luca Cittadini, Roma Tre University Stefano Vissicchio, UCLouvain Benoit Donnet, Université de Liege

CS BGP v4. Fall 2014

Back to basics J. Addressing is the key! Application (HTTP, DNS, FTP) Application (HTTP, DNS, FTP) Transport. Transport (TCP/UDP) Internet (IPv4/IPv6)

CSE 561 Lecture 6, Spring David Wetherall

Chapter 4: Network Layer

Introduc)on to Computer Networks

Computer Networking Introduction

Introduction to BGP ISP/IXP Workshops

Lecture 17: Border Gateway Protocol

Lecture 3: Packet Forwarding

BGP. Border Gateway Protocol A short introduction. Karst Koymans. Informatics Institute University of Amsterdam. (version 18.3, 2018/12/03 13:53:22)

Outline Computer Networking. Inter and Intra-Domain Routing. Internet s Area Hierarchy Routing hierarchy. Internet structure

Getting Familiar with the C-BGP Simulator

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella

Lecture 16: Interdomain Routing. CSE 123: Computer Networks Stefan Savage

BGP made easy. John van Oppen Spectrum Networks / AS11404

Transcription:

Modelling Inter-Domain Routing Olaf Maennel University of Adelaide Wolfgang MühlbauerM Technical University Munich Anja Feldmann Technical University Munich Steve Uhlig Université catholique de Louvain Matthew Roughan University of Adelaide

Outline 1. Why modelling inter-domain routing? 2. A model of the Internet 3. Some results 4. Conclusion

Outline 1. Why modelling inter-domain routing? 2. A model of the Internet 3. Some results 4. Conclusion

Why modelling inter-domain routing? Create models which are able to answer what-if questions Understand policies and their impact

Typology of what-if questions Goal of our inter-domain model is to potentially predict an outcome of changes For that we need to know how routes propagate through the network which policies are applied on alternative paths Knowing that helps to predict impact of policy changes to predict traffic flows or to debug the network

What-if: BGP policies Understand potential impact of changes in policy: Impact of cancelled peering? How to identify good new peerings? Possibilities to improve policy config, e.g., check outcome of network configuration formulate abstract AS-wide routing policy Poor path selection, e.g., identify highly asymmetric paths identify long paths changed connectivity between ASes

What-if: traffic flows Predict traffic flow with the help of simulations: Inter-domain: Predict where traffic enters/leaves the network? How can I balance traffic among my neighbors? Intra-domain: How traffic flows within my network? by simulating end-to-end traceroutes IGP/BGP interactions

What-if: debugging Optimize network performance Locate Internet routing instabilities Detect problematic routing conditions Tim Griffin s s BGP wedgies Checking what you are doing: check if the current state is the desired one emulate a planned configuration/policy change

Outline 1. Why modelling inter-domain routing? 2. A model of the Internet 3. Some results 4. Conclusion

Where do we start from? Model Simulation init Refinement real routing information

Where do we start from? Model Simulation init Refinement real routing information Build a model of the inter-domain routing system

Where do we start from? Model Simulation init Refinement real routing information Simulate BGP path propagation

Where do we start from? Model Simulation init Refinement real routing information Compare observable (real) AS paths to simulation

Simply reproducing observable paths Model Simulation init Premise: Only observable paths give us information about the AS-level topology and potential routing policies Refinement real routing information Goal: Reproduce paths in C-BGP simulator

The C-BGP simulator Full BGP policies and decision process Model Simulation Parse Cisco and Juniper configs Parser for Cisco/Juniper router config BGP MRT dumps Network topology Input Filters C-BGP (routing solver) configuration available routes init Decision Process Output Filters best routes Refinement real routing information compute routes for each router towards each prefix

What to do? Recall best path selection process: Model Simulation init Refinement 1. Local-pref 2. Shortest AS-path 3. Origin type 4. Lowest MED value 5. ebgp over ibgp 6. Lowest IGP cost ( hot-potato( hot-potato routing) 7. Tie-break (e.g., Lowest router-id) real routing information

What to do? Split AS, if multiple paths must be propagated Filter, if longer paths must be propagated init Model Refinement Simulation real routing information Get rid of random decisions (lowest( router-id), when supporting information is available

Splitting ASes prefix p Multiple paths must be propagated => need multiple routers in model!

How to propagate longer paths? longer path router prefix p shorter path router How to apply our policies?? => filter shorter path on longer path router (at ingress)

How to propagate longer paths? longer path router prefix p shorter path router Propagate paths to appropriate neighbors!

How to propagate longer path? longer path router prefix p shorter path router Filter also on egress -part of shorter path router.

Lowest Neighbor ID lowest neighbor ID decision sim. obs. prefix p The decision was made by cbgp randomly => Fix random decision, if supporting information available

Outline 1. Why modelling inter-domain routing? 2. A model of the Internet 3. Some results 4. Conclusion

Terminology Best match: RIB-IN: not found: simulation selects a path that was observed in reality simulation learns a path that was observed in reality, but did not pick that path as best No router at the considered AS in the simulation learns about the path that was observed in reality training data set: paths that were used to build model (real observed paths) validation data set: paths that were unknown to the model, but that are real observed paths

Observation points Training-Data-Set : used as input to model Validation-Data-Set -Set : NOT used as input Source training validation total Akamai 600 302 902 RIPE 239 120 359 RouteViews 65 28 93 GEANT 16 6 22 Abilene 8 2 10 SpaceNet 4 1 5 total 932 459 1391

Initial Results Training Data-Set RIB-IN (learned) best path (selected) Validation Data-Set RIB-IN (learned) best path (selected) % unique paths 99.99% 99.98% 93.84 % 63 %

Lessons learned Possible to model observable paths selecting the correct best path propagate path among possible alternatives Requirement: sufficient information enough observation points diverse location of observation points => It is possible to construct a model that can answers some what-if questions

What next? 63% of the paths in the validation data-set were correctly predicted. Reasons: We do not reverse engineer the Internet! We do not know the real policies! We only have policies which are consistent with our observations => It is not easy to reverse engineer policies of any AS without sufficient observation points!

Outline 1. Why modelling inter-domain routing? 2. A model of the Internet 3. Some results 4. Conclusion

Conclusion C-BGP is a scalable simulator for large intra- and inter-domain topologies To answer what-if questions three information sources are required: intra-domain topology (incl.. router configs) inter-domain topology (incl( incl.. local BGP views) traffic information To make this practical, we need your help! Thanks for your attention!