Inferring Autonomous System Relationships in the Internet Lixin Gao Dept. of Electrical and Computer Engineering University of Massachusetts, Amherst.

Slides:



Advertisements
Similar presentations
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Advertisements

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.
Inferring Autonomous System Relationships in the Internet Lixin Gao Dept. of Electrical and Computer Engineering University of Massachusetts, Amherst
Inferring Autonomous System Relationships in the Internet Lixin Gao.
Inferring Autonomous System Relationships in the Internet Lixin Gao Presented by Santhosh R Thampuran.
1 Internet Path Inflation Xenofontas Dimitropoulos.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Progress in inferring business relationships between ASs Dmitri Krioukov 4 th CAIDA-WIDE Workshop.
Traffic Engineering With Traditional IP Routing Protocols
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Practical and Configuration issues of BGP and Policy routing Cameron Harvey Simon Fraser University.
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
A View of the AS Hierarchy Provider - customer. A View of the AS Hierarchy No transitivity No SP concatenation Provider - customerData path.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
Traffic Engineering for ISP Networks Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park, NJ
Stable Internet Routing Without Global Coordination Jennifer Rexford Princeton University Joint work with Lixin Gao (UMass-Amherst)
On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.
Characterizing the Internet Hierarchy from Multiple Vantage Points Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park,
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
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.
University of Massachusetts, Amherst 1 On the Evaluation of AS Relationship Inferences Jianhong Xia and Lixin Gao Department of Electrical and Computer.
Characterizing the Internet Hierarchy from Multiple Vantage Points Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park,
1 Internet Topology COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
AGG-NANOG IP Network Traffic Engineering Albert Greenberg Internet and Networking Systems Research Lab AT&T Labs - Research; Florham Park, NJ See.
Inter-domain Routing Outline Border Gateway Protocol.
Internet Routing: Measurement, Modeling, and Analysis Dr. Jia Wang AT&T Labs Research Florham Park, NJ 07932, USA
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
Introduction to BGP.
Quantifying the Causes of Path Inflation Neil Spring, Ratul Mahajan, and Thomas Anderson Presented by Luv Kohli COMP November 24, 2003.
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
IP is a Network Layer Protocol Physical 1 Network DataLink 1 Transport Application Session Presentation Network Physical 1 DataLink 1 Physical 2 DataLink.
Multi-path Interdomain ROuting by Xu and Rexford Alan Dunn Topics in Network Protocol Design March 5, 2010.
Lecture 4: BGP Presentations Lab information H/W update.
Traffic Engineering for ISP Networks Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park, NJ
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
Advancements in the Inference of AS Relationships Xenofontas Dimitropoulos (Fontas) (CAIDA/GaTech) Dmitri Krioukov Bradley Huffaker k claffy George Riley.
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.
© 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.
Inter-domain Routing Outline Border Gateway Protocol.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
New Directions in Routing
Keeping local stuff local
Border Gateway Protocol
CS590B/690B Detecting Network Interference
No Direction Home: The True cost of Routing Around Decoys
Introduction to Internet Routing
Lixin Gao ECE Dept. UMASS, Amherst
Routing.
Connecting an Enterprise Network to an ISP Network
CS 4700 / CS 5700 Network Fundamentals
Routers Routing algorithms
CS 3700 Networks and Distributed Systems
CS 3700 Networks and Distributed Systems
COS 461: Computer Networks Spring 2014
Fixing the Internet: Think Locally, Impact Globally
Computer Networks Protocols
Routing.
Stable and Practical AS Relationship Inference with ProbLink
Presentation transcript:

Inferring Autonomous System Relationships in the Internet Lixin Gao Dept. of Electrical and Computer Engineering University of Massachusetts, Amherst http://www-unix.ecs.umass.edu/~lgao

Outline Internet Architecture and Routing AS Relationships Heuristic Algorithms Experimental Results

AS Commercial Relationships Provider-customer: customer pays its provider for transit services Peer-peer: exchange traffic between customers no money exchange Sibling-sibling: have mutual transit agreement merging ISPs, Internet connection backup

Route Propagation Policy Constrained by contractual commercial agreements between administrative domains Regional ISP B Regional ISP A University C e.g., An AS does not provide transit services between its providers

Why Infer AS Relationships? Crucial part of Internet structure Connectivity does not imply reachability Connectivity alone can not fully characterize structural properties of Internet No registry of AS relationships Many ISPs are not willing to reveal their relationships to others in IRR Relationships are evolving; hard to be up-to-date

Applications of AS Relationships Construct distance map Place proxy or mirror site servers Potentially avoid route divergence Help ISPs or domain administrators to achieve load balancing and congestion avoidance Help ISPs or companies to plan for future contractual agreements Help ISPs to reduce effect of misconfiguration and to debug router configuration files

AS Relationship Graph AS1 AS3 AS2 AS5 AS4 AS7 AS6 provider-to-customer edge peer-peer edge sibling-sibling edge

Route Propagation Rule An AS or a set of ASes with sibling relationship does not provide transit services between any two of its providers and peers BGP routing table entries have certain patterns

Routing Table Entry 704 702 701 1849 1

Routing Table Entry Patterns ui+1 un-1 un ui uphill top provider downhill top provider

Heuristic Algorithms Infer provider-customer and sibling-sibling basic refined Infer peer-peer final

Basic Algorithms Heuristics: Top provider has largest degree Based on patterns on BGP routing table entries Consecutive AS pairs on the left of top provider are customer-to-provider or sibling-sibling edges Consecutive AS pairs on the right of top provider are provider-to-customer or sibling-sibling edges

Initialize Consecutive AS Pair Relationship uj uj+1 u2 un-1 Maximum degree AS u1 un

uj uj+1 u2 un-1 u1 un

ub ua uc uj uj+1 ud u2 un-1 u1 un

ub ua uc ud u2 u1

Assign relationship to AS pairs ub ua Assign relationship to AS pairs uc uj uj+1 ud u2 un-1 Sibling-sibling[u1,u2] = 1 u1 un

Refined Algorithm Bogus Routing Entries Each routing table entry votes on AS relationships Ignore sibling-to-sibling relationship concluded by only one entry

Inferring Peer-Peer Relationships Peer-peer edge is between top provider and one of its neighbors only Heuristics: peer-to-peer edge is between top provider and its higher degree neighbor degrees of two peers do not differ significantly < R times

degree[uj-1] < degree[uj+1] Final Algorithm uj uj+1 uj-1 un-2 degree[uj-1] < degree[uj+1] u2 un-1 Fdsgfdsgfeg hjll u1 un

Final Algorithm uj uj+1 uj-1 un-2 u2 un-1 u1 un degree[uj] / degree[uj+1] < R and degree[uj] / degree[uj+1] > 1/R u2 un-1 Fdsgfdsgfeg hjll u1 un

Experimental Verification Routing table from Route Views Connected to 22 ISPs at 24 locations Daily routing table dump Routing table from 3 days 1999/9/27, 2000/1/2, 2000/3/9 ~1 million routing entries

Inference Results

Verification of Inferred Relationships by AT&T Comparing inference results from Basic and Final(R= ) with AT&T internal information 8

Verification of Inferred Relationships by AT&T Comparing inference results from Refined and Final(R= ) with AT&T internal information 8

Verification of Inferred Relationships by AT&T Comparing inference results from Basic and Final(R=60) with AT&T internal information

WHOIS Lookup Service Supplies name and address of company that owns an AS AS pair might have sibling-sibling relation if belong to the same company or two merging companies belong to two small companies located closeby

Verification by WHOIS lookup Service Confirm 101 of 186 inferred sibling-sibling relationships (> 50%) Some unconfirmed sibling-sibling relationships might be due to WHOIS service is not up to date Not enough information Bogus Routes: Router configuration typo: 7018 3561 7057 7075 7057 Misconfiguration of small ISPs:1239 11116 701 7018 ...

Conclusions and Further Work AS relationships are inherent aspect of Internet architecture Our heuristic algorithm is based on routing entry pattern derived from policy rules Verification: AT&T (99%) Whois services (>50%) Further Work: Policy effect on AS path length AS relationship evolution