1 Internet Path Inflation Xenofontas Dimitropoulos.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

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)
K-step Local Improvement Policy Motivation Inter-domain connectivity in the Internet is currently established on policy- based shortest-path routing. Business.
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.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
INTERDOMAIN ROUTING POLICY COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Mike Freedman
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.
Internet and Overlay Networks Ram Keralapura ECE Dept
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.
Announcement  Slides and reference materials available at  Slides and reference materials available.
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.
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
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
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Internet Routing (COS 598A) Today: Interdomain Traffic Engineering Jennifer Rexford Tuesdays/Thursdays.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
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.
Heuristics for Internet Map Discovery R. Govindan, H. Tangmunarunkit Presented by Zach Schneirov.
1 Interdomain Routing Policy Reading: Sections plus optional reading COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford.
Interdomain Routing Policy COS 461: Computer Networks Spring 2011 Mike Freedman 1.
University of Massachusetts, Amherst 1 On the Evaluation of AS Relationship Inferences Jianhong Xia and Lixin Gao Department of Electrical and Computer.
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Measuring ISP topologies with Rocketfuel Ratul Mahajan Neil Spring David Wetherall University of Washington ACM SIGCOMM 2002.
1 Network Topology Measurement Yang Chen CS 8803.
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
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
Measuring ISP Toplogies with Rocketfuel Neil Spring, Ratul Mahajan, and David Wetherall Presented By: David Deschenes March 25, 2003.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
Information-Centric Networks04a-1 Week 4 / Paper 1 Open issues in Interdomain Routing: a survey –Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure.
Introduction to BGP.
Quantifying the Causes of Path Inflation Neil Spring, Ratul Mahajan, and Thomas Anderson Presented by Luv Kohli COMP November 24, 2003.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
On AS-Level Path Inference Jia Wang (AT&T Labs Research) Joint work with Z. Morley Mao (University of Michigan, Ann Arbor) Lili Qiu (University of Texas,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
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.
CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
ICNP 2006 Inter­domain Policy Violations in Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College of Computing.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
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.
GLOBECOM 2007 Exit Policy Violations in Multi-hop Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College.
Inter-domain Routing Outline Border Gateway Protocol.
Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
1 Network Layer: Routing Intra- and Inter-Domain Routing Y. Richard Yang 4/18/2016.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
CS 3700 Networks and Distributed Systems
Border Gateway Protocol
Interdomain Traffic Engineering with BGP
No Direction Home: The True cost of Routing Around Decoys
COS 461: Computer Networks Spring 2014
Fixing the Internet: Think Locally, Impact Globally
BGP Instability Jennifer Rexford
An Empirical Evaluation of Wide-Area Internet Bottlenecks
Presentation transcript:

1 Internet Path Inflation Xenofontas Dimitropoulos

2 What path inflation is? To go from AS1 to AS8 instead of taking the shortest path: 1-> 2 -> 5 -> 6 -> 8 take a longer path like: 1-> 2-> 3 -> 4 -> 6 -> 8 AS8 AS7 AS6AS5 AS4AS3 AS2 AS1 source destination

3 Outline H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin. The impact of routing policy on Internet paths. In IEEE INFOCOM, 2001 H. Tangmunarunkit, R. Govindan, S. Shenker. Internet path inflation due to policy routing. In SPIE ITCom, 2001 L. Gao and F. Wang. The extent of AS path inflation by routing policies. In IEEE Global Internet Symposium, 2002 N. Spring, R. Mahajan, and T. Anderson. Quantifying the causes of path inflation. In ACM SIGCOMM, 2003

4 “The impact of routing policy on Internet paths” H. Tangmunarunkit, R. Govindan, S. Shenker, D. Estrin

5 Methodology Create [Mar-Apr 2000] a router level map of the Internet using Mercator. “Heuristics for Internet Map Discovery” INFOCOMM Create an AS overlay map by assigning routers to ASs. – Use RouteViews BGP tables and RADB to find ASs. Compare router level path induced by shortest AS path routing with shortest router level path.

6 Shortest AS path inflation AS8 AS7 AS5 AS4 AS2 AS1 AS9 source destination Shortest AS path Shortest router path

7 Results 20% of the node pairs have a path 5 hop longer then the shortest path

8 Results Quantified the contribution of shortest AS path routing to path inflation. They also found that longer paths are more inflated. Shortcomings: – Overlooked policies applied between ASs. – Assumed shortest path intradomain routing. – Map size (2662 ASs is very small).

9 “Internet Path Inflation due to policy routing” H. Tangmunarunkit, R. Govindan, S. Shenker

10 Methodology Re-examination of the previous work using a larger map; also consider interdomain policies. Create a router map using Mercator and an AS overlay. Infer policies between ASs. Assume a routing model and compare router level paths induced by the routing model and shortest router level paths.

11 Policies Three types of peering 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 “Interconnection, Peering and Settlements” G. Huston Internet Protocol Journal AS8 AS7 AS6AS5 AS4AS3 AS2 AS1

12 “On inferring autonomous systems relationships in the Internet” L. Gao ACM IEEE Transactions on Networking Figure taken from Lixin Gao Paths are hierarchical In a path you can have at most one 1 peer-peer link You go up the hierarchy through customer provider links (or sibling-sibling) and down the hierarchy through provider customer links (or sibling-sibling),

13 Routing Model A path transverses: – up the hierarchy through customer-provider links – down the hierarchy through provider-customer links – across the hierarchy through peer-peer links If more than one possible paths randomly pick one.

14 Results Inflation difference by realistic and simplified routing policy model.

15 Results AS path inflation caused by realistic routing model 95% of the paths have the same AS length

16 Conclusions Shortest AS path routing induces inflation Interdomain policies do not induce inflation

17 “The extent of AS path inflation by routing policies” L. Gao F. Wang

18 Methodology Create an AS map of the Internet from RouteViews data. Measure the extent of AS path inflation seen by RouteViews. Assume a routing model and measure AS path inflation.

19 Results Path inflation using a no-valley routing model.

20 Routing Model No-valley routing policy: – An AS does not provide transit between any two of its providers or peers. Prefer Customer routing policy: – Prefer the free of charge customer route over the peer or provider route. AS8 AS7 AS6AS5 AS4AS3 AS2 AS1 AS9

21 Results Path inflation using a no-valley routing model.

22 Results Path inflation using a no-valley and prefer customer routing model.

23 Conclusion Prefer customer routing model induces significant inflation. 45% of the paths are inflated by at least one AS hop.

24 “Quantifying the Causes of Path Inflation” Neil Spring Ratul Mahajan Thomas Anderson SIGCOMM 2003

25 Approach Quantify Internet Path inflation in 3 layers. For each layer find topology and policy triggered inflation. Interdomain Routing Peering Intradomain Routing Policies Shortest AS path routing Routing between adjacent networks. “Hot potato routing” and MEDs. Intradomain routing protocol

26 Methodology Infer intradomain topology of 65 ISPs using Rocketfuel, use traceroutes measured from 42 vantage points. Choose mainly large ISPs to have interesting topologies and some smaller ISPs for diversity. Extract a PoP level map from the router level map.

27 Metric: Additive Latency Intradomain Topology of an ISP, Figure taken from N. Spring

28 Metric: Additive Latency Intradomain Topology of an ISP, Figure taken from N. Spring

29 Metric: Additive Latency Intradomian Topology of an ISP, Figure taken from N. Spring

30 Intradomain layer Infer intradomain policies using a constraint based approach. Intradomain topology does not cause lot of inflation pointing to well connected topologies. Intradomain policies do not cause lot of inflation, meaning that intradomain traffic engineering is not inconsistent with link latencies.

31 Intradomain layer results Intradomain Topology Inflation mean = 3ms Intradomain Policy Inflation mean = 1ms

32 Downstream Characterize Peering Policies BGP uses MEDs to indicate preferred links. Late exit (Cold potato routing): Use the link indicated (MED) from your neighbor (B->G->F->H). Early exit (Hot potato routing): Use the link closest to the source (B->C->D->E->F->H). G F Upstream B C D E A Small ISP H source destination

33 Characterize Traces Early exit: If one peering link point is seen from each ingress. Characterize as late if the path length in the downstream ISP from peering point to destination is less than from the early exit to destination. Use this metric to classify traces in three categories: – Late exit, often (late exit for most paths) – Late exit, sometimes (late exit for the minority of the paths) – Engineered, but not late (downstream carries traffic over longer paths)

34 Characterization results Median is 57% meaning that most ISPs use early exit most of the time. Tier 1 ISPs: Late exit, often (15%) Late exit, sometimes (10%) Early-exit (19%) Single peering point (42%) Engineered but not late (13%)

35 Peering Policies Inflation They compare inflation caused by using early exit routing relative to an ideal optimal exit policy. The top 5% of the paths suffers an inflation of more than 12 ms

36 Interdomain layer methodology Infer policies using Lixin Gao Heuristics Assume No-valley and Prefer customer routing model. Find inflation caused by shortest AS path routing, no valley and no valley + prefer customer.

37 Interdomain layer SP: Shortest AS path routing NV: valley free paths PC: Prefer Customers Shortest AS path can be much longer than shortest latency paths. Prefer customer and no-valley policies cause little inflation.

38 Cumulative Results

39 Conclusion Path Inflation is caused by BGP shortest AS path routing and by inefficient peering. It is not clear if policies contribute to path inflation. Propose an informed BGP that carries location of egress links. Shortest AS path routing alternative?

40 Questions ?