TDTS21: Advanced Networking Lecture 7: Internet topology Based on slides from P. Gill and D. Choffnes Revised 2015 by N. Carlsson.

Slides:



Advertisements
Similar presentations
1 Interdomain Traffic Engineering with BGP By Behzad Akbari Spring 2011 These slides are based on the slides of Tim. G. Griffin (AT&T) and Shivkumar (RPI)
Advertisements

CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
CSE390 Advanced Computer Networks Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes (NEU), C.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Let the Market Drive Deployment A Strategy for Transitioning to BGP Security Phillipa Gill University of Toronto Sharon Goldberg Boston University Michael.
CS 4700 / CS 5700 Network Fundamentals Lecture 16: IXPs (The Underbelly of the Internet) Revised 3/23/2015.
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.
Quantitative Analysis of BGP Route Leaks Benjamin Wijchers Benno Overeinder.
TDTS21 Advanced Networking Lecture 6: BGP and Inter-domain Routing (It’s all about the Money) Based on slides from P. Gill, D. Choffnes, J. Rexford, and.
Inferring Autonomous System Relationships in the Internet Lixin Gao.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Ten Years in the Evolution of the Internet Ecosystem
University of Nevada, Reno Ten Years in the Evolution of the Internet Ecosystem Paper written by: Amogh Dhamdhere, Constantine Dovrolis School of Computer.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Analysis of BGP Routing Tables
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
Characterizing the Internet Hierarchy from Multiple Vantage Points Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park,
Let the Market Drive Deployment A Strategy for Transitioning to BGP Security Phillipa Gill University of Toronto Sharon Goldberg Boston University Michael.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Internet Routing (COS 598A) Today: Interdomain Topology Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
1 Internet Topology COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak
Measuring ISP topologies with Rocketfuel Ratul Mahajan Neil Spring David Wetherall University of Washington ACM SIGCOMM 2002.
Interdomain Routing and the Border Gateway Protocol (BGP) Reading: Section COS 461: Computer Networks Spring 2011 Mike Freedman
1 Network Topology Measurement Yang Chen CS 8803.
Inter-domain Routing Outline Border Gateway Protocol.
IPlane Status Harsha V. Madhyastha University of California San Diego.
1 Studying Black Holes on the Internet with Hubble Ethan Katz-Bassett, Harsha V. Madhyastha, John P. John, Arvind Krishnamurthy, David Wetherall, Thomas.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Lecture 8 Page 1 Advanced Network Security Review of Networking Basics: Internet Architecture, Routing, and Naming Advanced Network Security Peter Reiher.
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.
CSE 461: Interdomain Routing
How Secure are Secure Inter- Domain Routing Protocols? SIGCOMM 2010 Presenter: kcir.
Issues with Inferring Internet Topological Attributes Lisa Amini ab, Anees Shaikh a, Henning Schulzrinne b a IBM T.J. Watson Research Center b Columbia.
Advanced Networking Lab. Given two IP addresses, the estimation algorithm for the path and latency between them is as follows: Step 1: Map IP addresses.
CS 447 Networks and Data Communication Department of Computer Science Southern Illinois University Edwardsville Fall, 2015 Dr. Hiroshi Fujinoki
BGP topics to be discussed in the next few weeks: –Excessive route update –Routing instability –BGP policy issues –BGP route slow convergence problem –Interaction.
By, Matt Guidry Yashas Shankar.  Analyze BGP beacons which are announced and withdrawn, usually within two hour intervals.  The withdraws have an effect.
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 16 PHILLIPA GILL - STONY BROOK U.
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.
Securing BGP Bruce Maggs. BGP Primer AT&T /8 Sprint /16 CMU /16 bmm.pc.cs.cmu.edu Autonomous System Number Prefix.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
Inferring AS Relationships. The Problem  One view  AS relationships  BGP route tables  The other view  BGP route tables  AS relationships  Available.
One Hop for RPKI, One Giant Leap for BGP Security Yossi Gilad (Hebrew University) Joint work with Avichai Cohen (Hebrew University), Amir Herzberg (Bar.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
1 On the Impact of Route Monitor Selection Ying Zhang* Zheng Zhang # Z. Morley Mao* Y. Charlie Hu # Bruce M. Maggs ^ University of Michigan* Purdue University.
CS590B/690B Detecting Network Interference
Border Gateway Protocol
COMP 3270 Computer Networks
BGP supplement Abhigyan Sharma.
Interdomain Traffic Engineering with BGP
No Direction Home: The True cost of Routing Around Decoys
Net 323 D: Networks Protocols
Net 323 D: Networks Protocols
(How the routers’ tables are filled in)
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
CS590B/690B Detecting network interference (Spring 2018)
BGP Instability Jennifer Rexford
Presentation transcript:

TDTS21: Advanced Networking Lecture 7: Internet topology Based on slides from P. Gill and D. Choffnes Revised 2015 by N. Carlsson

Measuring the Internet’s topology 2  What do we mean by topology?  Internet as graph  Edges? Nodes?  Node = Autonomous System (AS); edge = connection.  Edges labeled with business relationship  Customer  Provider  Peer -- Peer SBU AT&T Sprint

The outputs … p2c p2c p2c p2c p2c p2c p2c p2c p2c p2c p2c 15413…

So how do we measure this graph? 4  Passive approach: BGP route monitors  Coverage of the topology  Amount of visibility provided by each neighbor  Active approach: Traceroute  From where?  Traceroute gives series of IP addresses not ASes  Active approach: TransitPortal  Much more control over what we see  …scalability/coverage?

Passive approach: BGP Route Monitors 5  Receive BGP announcements from participating ASes at multiple vantage points Regional ISP

Going from BGP Updates to a Topology 6  Example update:  TIME: 03/22/11 12:10:45  FROM: AS7018  TO: AS6447  ASPATH:  /20 AT&T (AS7018) it telling Routeviews (AS 6447) about this route. AT&T (AS7018) it telling Routeviews (AS 6447) about this route. This /20 prefix can be reached via the above path

Going from BGP Updates to a Topology 7  Key idea  The business relationships determine the routing policies  The routing policies determine the paths that are chosen  So, look at the chosen paths and infer the policies  Example: AS path “ ” implies  AS 4134 allows AS 7018 to reach AS 9318  China Telecom allows AT&T to reach Hanaro Telecom  Each “triple” tells something about transit service

Why are peering links hard to see?  The challenge: do not reflect complete connectivity  BGP announcements do not reflect complete connectivity information  They are an agreement to transit traffic for the AS they are advertised to… Local ISP Regional ISP Small business Small business Local ISP, Google $ Local ISP, Small business no valley routing policy lack of monitors in stub ASes up to 90% Combination of no valley routing policy and a lack of monitors in stub ASes mean missing up to 90% of peering links of content providers! (Oliveria et al. 2008)

Active approach: Traceroute 9  Issue: Need control over end hosts to run traceroute  How to get VPs?   Collection of O(100) servers that will run traceroute  Hosted by ISPs/other network operators (e.g. universities)  RIPE Atlas  Distribute specialized hardware to volunteers  O(1000s) of probes  Dasu  Bittorrent plug in that does measurements  O(200) ASes with Dasu clients

10

Traceroute vs Announced Path China Telecom China Telecom ISP 1 Verizon Wireless Verizon Wireless Level 3 AS / /16 VZW, /16 Level3, VZW, /16 ChinaTel /16

Traceroute vs Announced Path China Telecom China Telecom ISP 1 Verizon Wireless Verizon Wireless Level 3 AS / /16 VZW, /16 Level3, VZW, /16 ChinaTel /16 Interception typically results in differences between – Announced AS-PATH – Data path (traffic) Policy checks if legit reason(s)

Traceroute vs Announced Path Telstra Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path AS-PATH: /21| Telstra Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path AS-PATH: /21| Telstra Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path AS-PATH: /21| Traceroute:... (initial hops) 9. telstraglobal.net ( ) ms 10 impsat.net.br ( ) ms 11 spo.gvt.net.br ( ) ms 12 spo.gvt.net.br ( ) ms 13 host.gvt.net.br ( ) ms 14 isimples.com.br ( ) ms Telstra Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path AS-PATH: /21| AS HOPS in traceroute: Telstra Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path Telstra AS-PATH: /21| AS HOPS in traceroute: Traceroute-PATH: Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

Traceroute vs Announced Path Telstra AS-PATH: /21| AS HOPS in traceroute: Traceroute-PATH: Sometimes differences – Announced AS-PATH – Data path (traffic) Many legit reason(s)

20

Zipf popularity and long tails Rank (r) Degree (v)

Zipf popularity and long tails Rank (r) Degree (v) log v log r

Zipf popularity and long tails Rank (r) Degree (v) log v log r

Zipf popularity and long tails Rank (r) Degree (v) log v log r

Zipf popularity and long tails Rank (r) Degree (v) log v log r y(x) = x 0 --  x

Zipf popularity and long tails Rank (r) Degree (v) log v log r y(x) = x 0 --  x

Zipf popularity and long tails Rank (r) Degree (v) log v log r

Power law, Pareto, and Zipf  Power-law, Pareto, Zipf (in some sense the same)  Power-law: f(x)  x -  (probability of value x )  Pareto: F(x) = P[X > x] =  f(x) dx  x -  (cumulative prob.)  Zipf: v r  r -  (discrete representation; frequency v r of rank r )  Parameters related as:  =  -1 = 1/  E.g., paper and references therein: “A Tale of the Tails: Power-laws in Internet Measurements”, IEEE Network, Mahanti et al., 2013

Heavy-tail distributions …  “A probability distribution is said to have a heavy tail if the tail is not exponentially bounded”  … and then there are many many other “heavy tail” distributions, variations and generalizations, including distributions such as log-normal, various generalized Zipf/Pareto distributions, etc. 29

30