Master Course Computer Networks IN2097

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

Master Course Computer Networks IN2097

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley

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

PART III. Implementing Inter-Network Relationships with BGP

CS 204: BGP. Jiasi Chen Lectures: MWF 12:10-1pm Humanities and Social Sciences

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

CSCI Topics: Internet Programming Fall 2008

Master Course Computer Networks IN2097

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

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

Chapter IV: Network Layer

BGP. Autonomous system (AS) BGP version 4

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

BGP. Autonomous system (AS) BGP version 4

Inter-Autonomous-System Routing: Border Gateway Protocol

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

BGP. Autonomous system (AS) BGP version 4

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Inter-Autonomous-System Routing: Border Gateway Protocol

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

Internet inter-as routing: BGP

Inter-Domain Routing: BGP

Computer Networking Introduction

Internet Routing : Fundamentals of Computer Networks Bill Nace

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

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

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

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

Chapter 4: outline. Network Layer 4-1

Interdomain Routing. Networked Systems (H) Lecture 11

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:

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

Network Layer (Routing)

Routing on the Internet! Hierarchical Routing! The NSFNet 1989! Aggregate routers into regions of autonomous systems (AS)!

Inter-Domain Routing: BGP

DATA COMMUNICATOIN NETWORKING

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

IP Addressing & Interdomain Routing. Next Topic

Inter-Domain Routing: BGP II

Internet Routing Protocols Lecture 01 & 02

Chapter 4: Network Layer

Interdomain Routing Reading: Sections K&R EE122: Intro to Communication Networks Fall 2007 (WF 4:00-5:30 in Cory 277)

Routing on the Internet. Routing on the Internet. Hierarchical Routing. Computer Networks. Lecture 17: Inter-domain Routing and BGP

BGP. Inter-domain routing with the Border Gateway Protocol. Iljitsch van Beijnum Amsterdam, 13 & 16 March 2007

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

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

COMP/ELEC 429 Introduction to Computer Networks

CS4700/CS5700 Fundamentals of Computer Networks

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

Lecture 19: Network Layer Routing in the Internet

CSC 4900 Computer Networks: Routing Protocols

CS 268: Computer Networking. Next Lecture: Interdomain Routing

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

internet technologies and standards

TELE 301 Network Management

Next Lecture: Interdomain Routing : Computer Networking. Outline. Routing Hierarchies BGP

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)

Network layer: Overview. Network layer functions Routing IP Forwarding

BGP. Border Gateway Protocol (an introduction) Karst Koymans. Informatics Institute University of Amsterdam. (version 17.3, 2017/12/04 13:20:08)

Master Course Computer Networks IN2097

CS BGP v4. Fall 2014

Lecture 18: Border Gateway Protocol

COMP211 Chapter 5 Network Layer: The Control Plane

Lecture 17: Border Gateway Protocol

Internet Routing Protocols Lecture 03 Inter-domain Routing

Inter-Domain Routing: BGP II

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

CS Networks and Distributed Systems. Lecture 8: Inter Domain Routing

Chapter 4: Network Layer, partb

CS 457 Networking and the Internet. The Global Internet (Then) The Global Internet (And Now) 10/4/16. Fall 2016

Inter-Domain Routing: BGP

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala October 9, 2018 (a) October 18 October 9,

CSc 450/550 Computer Networks Internet Routing

Interplay Between Routing, Forwarding

Link State Routing & Inter-Domain Routing

Advanced Computer Networks

Inter-domain Routing. Outline. Border Gateway Protocol

Introduction to Communication Networks Spring Unit 16 Global Internetworking

CSCD 433/533 Network Programming Fall Lecture 14 Global Address Space Autonomous Systems, BGP Protocol Routing

BGP Protocol & Configuration. Scalable Infrastructure Workshop AfNOG2008

Dynamics of Hot-Potato Routing in IP Networks

IPv4/IPv6 BGP Routing Workshop. Organized by:

Border Gateway Protocol - BGP

This appendix contains supplementary Border Gateway Protocol (BGP) information and covers the following topics:

Department of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri

Multihoming Complex Cases & Caveats

BGP101. Howard C. Berkowitz. (703)

CSCE 463/612 Networks and Distributed Processing Spring 2018

CNT Computer and Network Security: BGP Security

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Border Gateway Protocol. Version: Demo

Interdomain routing with BGP4 Part 4/5

CS321: Computer Networks Unicast Routing

Interdomain routing CSCI 466: Networks Keith Vertanen Fall 2011

Advanced Computer Networks

Routing Unicast routing protocols

Routing. Jens A Andersson Communication Systems

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

ISP Border Definition. Alexander Azimov

FAQ. Version: Copyright ImageStream Internet Solutions, Inc., All rights Reserved.

Transcription:

Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Chair for Network Architectures and Services Department of Computer Science Technische Universität München http://www.net.in.tum.de

Outline q Interdomain Routing BGP: Border Gateway Protocol Business considerations Policy routing Traffic engineering Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 2

Interdomain Routing BGP - Border Gateway Protocol Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 3

Hierarchical Routing q Aggregate routers into regions called autonomous systems (short: AS; plural: ASes) One AS one ISP / organisation q Routers within one AS run same routing protocol = intra-as routing protocol (also called intradomain ) Routers in different ASes can run different intra-as routing protocols q ASes are connected: via gateway routers Direct link to [gateway] router in another AS = inter-as routing protocol (also called interdomain ) Warning: Non-gateway routers may need to know about inter-as routing as well! Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 4

Interconnected ASes 3c 3a 3b AS3 1a 1c 1d 1b Intra-AS Routing algorithm AS1 Forwarding table Inter-AS Routing algorithm 2a 2c AS2 2b q Forwarding table configured by both intra- and inter-as routing algorithm: Intra-AS sets entries for internal destinations Inter-AS and intra-as set entries for external destinations Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 5

Inter-AS tasks q Suppose router in AS1 receives datagram destined outside of AS1: Router should forward packet to gateway router but to which one? AS1 must: 1. learn which destinations are reachable through AS2, which through AS3 2. propagate this reachability info to all routers in AS1 (i.e., not just the gateway routers) Job of inter-as routing! 3c 3a 3b AS3 1a 1c 1d 1b AS1 2a 2c AS2 2b Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 6

Example: Setting Forwarding Table in Router 1d q Suppose AS1 learns (via inter-as protocol) that subnet x is reachable via AS3 (gateway 1c) but not via AS2. q Inter-AS protocol propagates reachability info to all internal routers. q Router 1d determines from intra-as routing info that its interface I (i.e., interface to 1a) is on the least cost path to 1c. installs forwarding table entry (x,i) 3c 3a 3b AS3 1a x l 1c 1d 1b AS1 2a 2c AS2 2b Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 7

Example: Choosing among multiple ASes q Now suppose AS1 learns from inter-as protocol that subnet x is reachable from AS3 and from AS2. q To configure forwarding table, router 1d must determine towards which gateway it should forward packets for destination x. Do we like AS2 or AS3 better? Also the job of inter-as routing protocol! 3c 3a 3b AS3 x 1c 1a 1d 1b AS1 2a 2c AS2 2b Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 8

Interplay of Inter-AS and Intra-AS Routing q Inter-AS routing Only for destinations outside of own AS Used to determine gateway router Also: Steers transit traffic (from AS x to AS y via our own AS) q Intra-AS routing Used for destinations within own AS Used to reach gateway router for destinations outside own AS Often, routers need to run both types of routing protocols even if they are not directly connected to other ASes! Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 9

Internet inter-as routing: BGP q q q BGP (Border Gateway Protocol): The de facto standard for inter-as routing BGP provides each AS a means to: 1. Obtain subnet reachability information from neighboring ASes 2. Propagate reachability information to all AS-internal routers 3. Determine good routes to subnets based on reachability information and policy Allows an AS to advertise the existence of an IP prefix to rest of Internet: This subnet is here Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 10

BGP Basics q Pairs of routers (BGP peers) exchange routing info over semi-permanent TCP connections: BGP sessions BGP sessions need not correspond to physical links! q When AS2 advertises an IP prefix to AS1: AS2 promises it will forward IP packets towards that prefix AS2 can aggregate prefixes in its advertisement (e.g.: 10.11.12.0/26, 10.11.12.64/26, 10.11.12.128/25 into 10.11.12.0/24) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 11

ebgp and ibgp q External BGP: between routers in different ASes q Internal BGP: between routers in same AS Remember: In spite of intra-as routing protocol, all routers need to know about external destinations (not only border routers) q Not different protocols just slightly different configurations! 3c x 3a 3b AS3 1a AS1 1c 1d ebgp session ibgp session 1b 2a 2c AS2 2b Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 12

Distributing reachability info q Using ebgp session between 3a and 1c, AS3 sends reachability information about prefix x to AS1. 1c can then use ibgp to distribute new prefix information to all routers in AS1 1b can then re-advertise new reachability information to AS2 over 1b-to-2a ebgp session q When router learns of new prefix x, it creates entry for prefix in its forwarding table. 3c x 3a 3b AS3 1a AS1 1c 1d ebgp session ibgp session 1b 2a AS2 2c 2b Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 13

AS Numbers q How do we express a BGP path? q ASes identified by AS Numbers (short: ASN) Examples: Leibnitz-Rechenzentrum = AS12816 Deutsche Telekom = AS3320 AT&T = AS7018, AS7132, AS2685, AS2686, AS2687 q ASNs used to be 16bit, but also have 32bit nowadays May have problems with 16bit ASNs on very old routers q ASN assignment: similar to IP address space ASN space administered IANA Local registrars, e.g., RIPE NCC in Europe Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 14

Path attributes & BGP routes q Advertised prefix includes [many] BGP attributes prefix + attributes = route q Most important attributes: AS-PATH: contains ASes through which prefix advertisement has passed: e.g., AS 67, AS 17, AS 7018 NEXT-HOP: indicates specific internal-as router to next-hop AS (may be multiple links from current AS to next-hop-as) q When gateway router receives route advertisement, it uses an import policy to accept/decline the route More on this later Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 15

How does BGP work? q BGP = path++ vector protocol q BGP messages exchanged using TCP Possible to run ebgp sessions not on border routers q BGP message types: OPEN: set up new BGP session, after TCP handshake NOTIFICATION: an error occurred in previous message tear down BGP session, close TCP connection KEEPALIVE: null data to prevent TCP timeout/auto-close; also used to acknowledge OPEN message UPDATE: Announcement: inform peer about new / changed route to some target Withdrawal: (inform peer about non-reachability of a target) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 16

BGP updates q Update (Announcement) message consists of Destination (IP prefix) AS Path (=Path vector) Next hop (=IP address of our router connecting to other AS) q but update messages also contain a lot of further attributes: Local Preference: used to prefer one gateway over another Origin: route learned via { intra-as inter-as unknown } MED (MULTI_EXIT_DISC): used on external (inter-as) links to discriminate among multiple exit or entry points Community: tags applied to prefixes for common treatment Not a pure path vector protocol: More than just the path vector q Local configuration uses much more information than what is exchanged in messages BGP is an information hiding protocol (quote from Randy Bush) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 17

BGP update: Very simple example q Type: Announcement Either this is a new route to the indicated destination, or the existing route has been changed q Destination prefix: 10.11.128.0/17 q AS Path: 7018 3320 4711 815 12816 Current AS q Next Hop: 192.168.69.96 Originator: The AS that owns 10.11.128.0/17 The router that connects the current AS to AS 3320 How the update travelled How the IP packets will be forwarded (if this route gets chosen) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 18

BGP route selection q q Router may learn about more than 1 route to some prefix Router must select the best one among these Elimination rules (simplified): 1. Local preference value attribute: policy decision 2. Shortest AS-PATH 3. Closest NEXT-HOP router outside AS: hot potato routing 4. Additional criteria Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 19

Business and Hot-potato routing q Interaction between Inter-AS and Intra-AS routing Business: If traffic is destined for other AS, get rid of it ASAP Technical: Intra-AS routing finds shortest path to gateway q Multiple transit points asymmetrical routing q Asymmetrical paths are very common on the Internet Host A AS 7018 Atlantic ocean AS 3320 Host B Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 20

Terminology: Transit AS, Stub AS, Multi-homed AS Transit AS: Relays traffic between other Ases (Only about 15% of all ASes are Transit ASes.) Stub AS: Buys transit from only one other AS, but does not offer transit for other ASes Multi-homed AS: Buys transit from 2 other ASes, but does not offer transit for other ASes Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 21

Business relationships q q q q q Internet = network of networks (ASes) Many thousands of ASes Not every network connected to every other network BGP used for routing between ASes Differences in economical power/importance Some ASes huge, intercontinental (AT&T, Cable&Wireless) Some ASes small, local (e.g., München: M-Net, SpaceNet) Small ASes customers of larger ASes: Transit traffic Smaller AS pays for connecting link + for data = buys transit Business relationship = customer provider Equal-size/-importance ASes Usually share cost for connecting link[s] Business relationship = peering (specific transit traffic is for free) Warning: peering ( equal-size AS) peers of a BGP connection (also may be customer or provider) peer-to-peer network Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 22

Business and policy routing (1) q Basic principle #1 (Routing) Prefer routes that incur financial gain q Corollary: If you have the choice, then routes via a customer are better than routes via a peer, which are better than routes via a provider. q Basic principle #2 (Route announcement) Announce routes that incur financial gain if others use them Others = customers Announce routes that reduce costs if others use them Others = peers Do not announce routes that incur financial loss ( as long as alternative paths exist) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 23

Business and policy routing (2) q A tells C all routes it uses to reach other ASes The more traffic comes from C, the more money A makes A provider customer C Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 24

Business and policy routing (3) q A and B tell C all routes they use to reach other ASes The more traffic flows from C to A, the more money A makes The more traffic flows from C to B, the more money B makes C will pick the one with the cheaper offer / better quality / A B provider customer C provider customer Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 25

Business and policy routing (4) q C tells A its own prefixes; C tells B its own prefixes C wants to be reachable from outside q C does not tell A routes learned from/via B C does not tell B routes learned from/via A C does not want to pay money for traffic A C B A B provider customer C provider customer Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 26

Business and policy routing (5): AS path prepending q C tells A its own prefixes q C may tell B its own prefixes but inserts C multiple times into AS path. Why? Result: Route available, but longer path = less attractive Technique is called AS path prepending A B cheap provider customer C expensive provider customer Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 27

AS path prepending q The same ASN subsequently within an AS path does not constitute a loop q Recall the elimination rule for selecting from multiple path alternatives Prefer the shortest AS path is rule 2 Only ignored if Local Pref value is set AS path prepending makes a route less attractive will then only be used when there is no alternative q How many times to repeat the AS number? Usually just 1 or 2 repetitions More than 5 is useless Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 28

Business and policy routing (6) q What should C announce here? q C tells A about its own prefixes q C tells A about its route to D s prefixes: loses money to A, but gains money from D A provider customer C provider customer D Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 29

Business and policy routing (7) q What should C announce here? q C tells peering partner E about its own prefixes and route to D: no cost on link to E, but gains money from D C provider customer peering D E Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 30

Business and policy routing (8a) q Which route should C select? q B tells C about route to prefix p (lose money) q E tells C about route to prefix p (± 0) q C prefers route via E provider B customer C peering E p Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 31

Business and policy routing (8b) q Which route should C select? q B tells C about route to prefix p (lose money) q E tells C about route to prefix p (± 0) q D tells C about route to prefix p (gain money) q C prefers route via D B provider customer C peering E provider D customer p Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 32

Business and policy routing (9) q What should C announce here? C announces to F and E: its own prefixes and D s routes C does not announce to E: routes going via F Otherwise: E could send traffic towards F but wouldn t pay anything, F wouldn t pay either, and C s network gets loaded with additional traffic C does not announce to F: routes going via E Same reason F peering C peering E provider customer D Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 33

Policy routing: Valley-Free Routing (Idealised) Results: Packets always travel 1. upstream: sequence of C P links (possibly length = 0) 2. then possibly across one peering link 3. then downstream: sequence of P C links (possibly length = 0) But: horizontal sibling sibling edges may occur provider at any position on provider a packet s path customer customer peering provider customer provider customer Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 34

Siblings q Not everything is provider/customer or peering q Sibling = mutual transit agreement Provide connectivity to the rest of the Internet for each other very extensive peering q Examples Two small ASes close to each other that cannot / do not want to afford additional Internet services Merging two companies Merging two ASes into one = difficult, Keeping two ASes and exchanging everything for free = easier Example: AT&T has five different AS numbers (7018, 7132, 2685, 2686, 2687) Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 35

Business and policy routing (10): Tiers / DFZ q Big players have no providers, only customers and peers Tier-1 ISPs or Default-Free Zone (DFZ - have no default route to a provider ) q Each Tier-1 peers with each other peering Telekom peering Sprint peering Tata provider provider provider customer C customer Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 36

Tier-1, Tier-2, Tier-3 etc. q Tier-1/DFZ = only peerings, no providers q Tier-2 = only peerings and one or more Tier-1 providers q Tier-3 = at least one Tier-2 as a provider q Tier-n = at least one Tier-(n-1) provider q defined recursively q n 4: Rare in Western Europe, North America, East Asia q Tier-1.5 = almost a Tier-1 but pays money for some links Example: Deutsche Telekom used to pay money to Sprint, but is now Tier-1 Marketing purposes: Tier-1 sounds better Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 37

BGP Policy Routing: Technical summary 1. Receive BGP update 2. Apply import policies q Filter routes q Tweak attributes (advanced topic ) 3. Best route selection based on attribute values q Policy: Local Pref settings and other attributes q Install forwarding tables entries for best routes q Possibly transfer to Route Reflector (RR is alternative to logical full mesh of ibgp sessions) 4. Apply export policies q Filter routes q Tweak attributes 5. Transmit BGP updates Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 38

BGP policy routing: Business relationship summary q Import Policy = Which routes to use Select path that incurs most money Special/political considerations (e.g., Iranian AS does not want traffic to cross Israeli AS; other kinds of censorship) q Export Policy = Which routes to propagate to other ASes Not all known routes are advertised: Export only If it incurs revenue If it reduces cost If it is inevitable q Policy routing = Money, Money, Money Route import and export driven by business considerations But not driven by technical considerations! Example: Slower route via peer may be preferred over faster route via provider Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 39

Where to Peer (Here: Peering = having a BGP relationship) A) Private peering q The obvious solution: Let s have a cable from your server room to our server room B) At public peering locations (Internet Exchange Point, IX, IXP) q A room full of switches that many providers connect to q Configure VLAN connections in switch, instead of having to put in O(n²) separate wires q Examples: q DE-CIX, Frankfurt (purportedly largest in world) q AMS-IX, Amsterdam q LINX, London q MSK-IX, Moscow Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 40

q Source: de-cix.net Network IN2097 - Master Security, Course WS 2008/09, Computer Chapter Networks, 9 WS 2013/2014 41