End-to-End Routing Behavior in the Internet Vern Paxson Presented by Zhichun Li.

Slides:



Advertisements
Similar presentations
Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Advertisements

End to End Routing Behavior in the Internet Vern Paxson Network Research Group Lawrence Berkeley National Laboratory University of California, Berkeley.
1 End-to-End Routing Behavior in the Internet Internet Routing Instability Presented by Carlos Flores Gaurav Jain May 31st CS 6390 Advanced Computer.
1 Locating Internet Bottlenecks: Algorithms, Measurement, and Implications Ningning Hu (CMU) Li Erran Li (Bell Lab) Zhuoqing Morley Mao (U. Mich) Peter.
1 Transport Protocols & TCP CSE 3213 Fall April 2015.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
CS 268: Routing Behavior in the Internet Ion Stoica February 18, 2003.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Courtesy: Nick McKeown, Stanford
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.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
TCP Stability and Resource Allocation: Part II. Issues with TCP Round-trip bias Instability under large bandwidth-delay product Transient performance.
Next Step In Signaling (NSIS) and Internet Routing Dynamics Charles Shen and Henning Columbia University in the City of New York Internet.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
CS Summer 2003 CS672: MPLS Architecture, Applications and Fault-Tolerance.
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
On the Constancy of Internet Path Properties Yin Zhang, Nick Duffield AT&T Labs Vern Paxson, Scott Shenker ACIRI Internet Measurement Workshop 2001 Presented.
Measurement Study of Low- bitrate Internet Video Streaming Dmitri Loguinov and Hayder Radha CS Dept at CUNY NY and EE/ECE at MSU. In Proceedings of ACM.
Network Traffic Measurement and Modeling CSCI 780, Fall 2005.
Internet Routing Instability Labovitz et al. Sigcomm 1997 Largely adopted from Ion Stoica’s slide at UCB.
E2E Routing Behavior in the Internet Vern Paxson Sigcomm 1996 Slides are adopted from Ion Stoica’s lecture at UCB.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Network Traffic Measurement A focus of networking research for 20+ years Collect.
Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Routing.
14 – Inter/Intra-AS Routing
1 Reliability & Flow Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
TCP Congestion Control
End-to-End Issues. Route Diversity  Load balancing o Per packet splitting o Per flow splitting  Spill over  Route change o Failure o policy  Route.
Observations from Router-level Traces Lisa Amini IBM T. J. Watson Research Center Joint with Henning Schulzrinne, Aurel Lazar Columbia University.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
CS 268: Lecture 18 Measurement Studies on Internet Routing Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
15-744: Computer Networking L-20 Network Measurements.
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Internet Routing Dynamics and NSIS Related Considerations draft-shen-nsis-routing-00.txt Charles Shen, Henning Schulzrinne, Sung-Hyuck Lee IETF#61 – Washington.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Measurement and Modeling of Packet Loss in the Internet Maya Yajnik.
Resilient Overlay Networks By David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT RON Paper from ACM Oct Advanced Operating.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Network Layer4-1 Distance Vector Algorithm Bellman-Ford Equation (dynamic programming) Define d x (y) := cost of least-cost path from x to y Then d x (y)
1 Seminar / Summer Semester 2000 Internet Connectivity Christian A. Plattner,
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
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,
Detection of Routing Loops and Analysis of Its Causes Sue Moon Dept. of Computer Science KAIST Joint work with Urs Hengartner, Ashwin Sridharan, Richard.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
Presentation by Michael Smathers, Usman Jafarey CS395/495 IMRE, April 24, 2006 PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.
1 Version 3.1 Module 6 Routed & Routing Protocols.
End-to-End Routing Behavior in the Internet Vern Paxson Presented by Sankalp Kohli and Patrick Wong.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
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,
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1 Internet Traffic Measurement and Modeling Carey Williamson Department of Computer Science University of Calgary.
Dynamic Behavior of Slowly Responsive Congestion Control Algorithms (Bansal, Balakrishnan, Floyd & Shenker, 2001)
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Detection of Routing Loops and Analysis of Its Causes
Routing.
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Measurement and Classification of Out-of-Sequence Packets in a Tier-1 IP Backbone Sharad Jaiswal, Gianluca Iannaccone, Member, IEEE, Christophe Diot, Jim.
COS 461: Computer Networks
Computer Networks Protocols
Routing.
Presentation transcript:

End-to-End Routing Behavior in the Internet Vern Paxson Presented by Zhichun Li

Idea Use end-to-end measurement to determine: Route pathologies Route stability Route symmetry Key property (N 2 scale) Use N sites to measure N 2 Internet pathes

Definitions Virtual path: network level abstraction of “direct link” between two hosts. At the network layer, it is realized by a single route. Autonomous system (AS): collection of routers and hosts controlled by a single administrative entity.

Routing Protocols Interior Gateway Protocol (IGP): routing protocol for entities within the same AS. Border Gateway Protocol (BGP): for inter-AS routing. Each AS keeps a routing table with reachable hosts and corresponding costs. Upon detected changes, only affected part of routing table is shared.

Methodology Run Network Probes Daemon (NPD) on a number of Internet sites (37)

Methodology Each NPD site periodically measure the route to another NPD site, by using traceroute Two sets of experiments D1 – measure each virtual path between two NPD’s with a mean interval of 1-2 days, Nov-Dec 1994 D2 – measure each virtual path using a bimodal distribution inter-measurement interval, Nov-Dec % with mean of 2 hours 40% with mean of 2.75 days Measurements in D2 were paired Measure A=>B and then B<= A

Methodology Links traversed during D1 and D2

Methodology Exponential sampling Unbiased sampling – measures instantaneous signal with equal probability PASTA principle – Poisson Arrivals See Time Averages Is data representative? Argue that sampled AS’s are on half of the Internet routes Confidence intervals for probability that an event occurs

Limitations Just a small subset of Internet paths Just two points at a time Difficult to say why is something happened, only with end-to-end measurements 5%-8% of time couldn’t connect to NPD’s Introduces bias toward underestimation, why?

Routing Pathologies Persistent routing loops Temporary routing loops Erroneous routing Connectivity altered mid-stream Temporary outages (> 30 sec)

Routing Loops & Erroneous Routing Persistent routing loops (10 in D1 and 50 in D2) Several hours long (e.g., > 10 hours) Largest: 5 routers All loops intra-domain Transient routing loops (2 in D1 and 24 in D2) Several seconds Usually occur after outages Erroneous routing (one in D1) A route UK=>USA goes through Israel

Route Changes Connectivity change in mid-stream (10 in D1 and 155 in D2) Route changes during measurements Recovering bimodal: (1) 100’s msec to seconds; (2) order of minutes Route fluttering Rapid route oscillation Very little fluttering was seen and only happened within the AS.

Example of Route Fluttering wustl (St. Loutis) to umann(Mannheim, Germany) Solid: 17 hops, dotted: 29 hops

Problems with Fluttering Path properties difficult to predict This confuses RTT estimation in TCP, may trigger false retransmission timeouts Packet reordering TCP receiver generates DUPACK’s, may trigger spurious fast retransmits These problems are bad only for large scale flutter; for localized flutter is usually ok

Infrastructure Failures “host unreachable” from router well inside the network. 0.21% in D1, estimate availability rate 99.8%. This dropped to 99.5% in D2.

NPD’s unreachable due to many hops (6 in D2) Unreachable more than 30 hops Path length not necessary correlated with distance 1500 km end-to-end route of 3 hops 3 km (MIT – Harvard) end-to-end route of 11 hops

Temporary Outages Sequence of traceroute packets lost due to temporary loss of connectivity or heavy congestion. In D1(D2), 55% (43%) had 0 losses, 44% (55%) had 1 to 5 losses, and 0.96% (2.2%) had 6 or more.

Distribution of Long Outages (>30 sec )

Time-of-Day patterns Mean time-of-day between source and destination is associated with each measurement. Temporary outages: min (0.4%) occurred during the 1:00-2:00 h, max (8.0%) during the 15:00-16:00 h. Infrastructure failures: min (1.2%) at 9:00- 10:00 h, peak during 15:00-16:00 h.

Pathology Summary

Routing Stability Two definitions of stability: Prevalence: likelihood to observe a particular route Steady state probability that a virtual path at an arbitrary point in time uses a particular route Conclusion: In general Internet paths are strongly dominated by a single route Persistence: how long a route remains unchanged Affects utility of storing state in routers Conclusion: routing changes occur over a wide range of time scales, i.e., from minutes to days

Routing Stability Routing Prevalence Let  r be the steady-state probability that a VP uses route r at an arbitrary time. Due to PASTA, an unbiased estimator of  r can be computed as The prevalence of the dominant route is analyzed.

Routing Prevalence In general, Internet paths are strongly dominated by a single route, especially if observed at higher granularity.

Routing Persistence The notion of persistence depends on what is deemed persistent. A series of measurements are undertaken to classify routes according to their alternation frequency.

Routing Symmetry Sources of Routing Asymmetry Link cost metrics contain an asymmetry themselves along the two directions. “hot potato” routing problem due to the competing providers.

Routing Symmetry Analysis of Routing Symmetry Measurements were paired to ensure that an asymmetry is actually being captured. Asymmetry is quite common (49% on a city granularity, 30% AS granularity). Size of Asymmetries Majority confined to one hop (one city or AS)

Summary Pathologies doubled during 1995 Asymmetry is quite common Paths heavily dominated by a single route Over 2/3 of Internet paths are reasonable stable (> days). The other 1/3 varies over many time scales