On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.

Slides:



Advertisements
Similar presentations
T. S. Eugene Ng Mellon University1 Towards Global Network Positioning T. S. Eugene Ng and Hui Zhang Department of Computer.
Advertisements

Traffic Dynamics at a Commercial Backbone POP Nina Taft Sprint ATL Co-authors: Supratik Bhattacharyya, Jorjeta Jetcheva, Christophe Diot.
pathChirp Efficient Available Bandwidth Estimation
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
Authors: Venkata N. Padmanabhan and Lakshminarayanan Subramanian Publisher: SIGCOMM 2001 Presenter: Chai-Yi Chu Date: 2013/03/06 1.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
Traffic Engineering for ISP Networks Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park, NJ
CS335 Networking & Network Administration Tuesday, May 18, 2010.
PAM A Measurement Study of Internet Delay Asymmetry Abhinav PathakPurdue University Himabindu PuchaPurdue University Ying ZhangUniversity of Michigan.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
Variance of Aggregated Web Traffic Robert Morris MIT Laboratory for Computer Science IEEE INFOCOM 2000’
On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
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.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
Observations from Router-level Traces Lisa Amini IBM T. J. Watson Research Center Joint with Henning Schulzrinne, Aurel Lazar Columbia University.
INTERNET TOPOLOGY MAPPING INTERNET MAPPING PROBING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks Locations.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
(jeez y) Where is the Internet? Answers from : (G. Whilikers) Out there. (Mike) the way I see it, the "internet" has to be somewhere. a router collects.
Oasis: Anycast for Any Service Michael J. Freedman Karthik Lakshminarayanan David Mazières in NSDI 2006 Presented by: Sailesh Kumar.
Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Application-Layer Anycasting By Samarat Bhattacharjee et al. Presented by Matt Miller September 30, 2002.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
IDMaps: A Global Internet Host Distance Estimation Service P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, L. Zhang Presenter: Zhenying Liu.
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.
TDTS21: Advanced Networking Lecture 7: Internet topology Based on slides from P. Gill and D. Choffnes Revised 2015 by N. Carlsson.
Internet Measurement 5.4 State of the art ECE Department, University of Tehran Fall 2009.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Paper Group: 20 Overlay Networks 2 nd March, 2004 Above papers are original works of respective authors, referenced here for academic purposes only Chetan.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
Microsoft Windows Server 2003 TCP/IP Protocols and Services Technical Reference Slide: 1 Lesson 7 Internet Protocol (IP) Routing.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Click to edit Master subtitle style Chapter 1:Introduction to Networks Instructor:Thomas W Bell.
Internet Tomography and Geography What is this area all about? Related work in the area Main Paper WEBMAPPER’s features How WEBMAPPER works WEBMAPPER results.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Determining the Geographic Location of Internet Hosts Venkata N. Padmanabhan Microsoft Research Lakshminarayanan Subramanian University of California at.
N. Hu (CMU)L. Li (Bell labs) Z. M. Mao. (U. Michigan) P. Steenkiste (CMU) J. Wang (AT&T) Infocom 2005 Presented By Mohammad Malli PhD student seminar Planete.
PathChirp Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
WSP: A Network Coordinate based Web Service Positioning Framework for Response Time Prediction Jieming Zhu, Yu Kang, Zibin Zheng and Michael R. Lyu The.
Chapter 17 - Clients + Servers = Distributed Computing Introduction Large Computers Use Networks For Input and Output Small Computers Use Networks To Interact.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
1 Distributed Monitoring CERNET's experience Xing Li
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
A Detailed Path-latency Model for Router Geolocation* Internetes hosztok mérés alapú geolokalizációja Sándor Laki, Péter Mátray, Péter Hága, István Csabai.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
Distance Vector Routing
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Lecture 13 – Network Mapping
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute of Technology and Prasun Sinha Bell Labs., Lucent Technologies

Outline Internet Distance Off line metrics –Geographic distance, #hops, # AS, depth Linear Regression for Internet distance estimation Multi-variable linear regression Accuracy of picking closest mirror site The next step

Internet Distance Internet Distance: one way delay between hosts Components of Internet Distance –Dynamic Server Load Network Congestion / Router Load –Static propagation delay over the links Router processing delay Edge-router processing delay Goal: To study the power of estimating the Static Internet Distance using off-line metrics

Importance of Internet Distance Estimation Picking closest mirror-site/cache For use in Content Distribution Networks

Approaches Dynamic –Dynamic probing [Dykes et. al. Infocom ’00] –Passive monitoring [Andrews et. al. Infocom ’02] Static –Semi-active probing (IDMAPs) [Jamin et. al. Infocom ’00] Other relevant work: –Geographic Distance and RTT: [Padmanabhan Sigcomm ‘02]

Static Internet Distance Propagation delay: geographical distance Router processing delay: # hops Edge-router processing delay: # AS Static Internet Distance =  geo-distance +  hop-count +  AS-count ? AS #1AS #2AS #3 AS: Autonomous System Core Router Edge Router

Data Collection Clients: 2500 public libraries in US Servers (mirrors/caches): 8 traceroute locations in US The location (latitude, longitude) is known for every host. For every client-server pair –Run multiple (10) traceroutes –Pick the traceroute result with the smallest RTT –Compute Geo-distance: based on latitude and longitude Hop-count: from traceroute AS-count: from traceroute based on names of routers and IP Address Prefixes

Linear Regression (Geo-distance and Hop-count) minRTT vs. Geo-distance SE (Std. Error) = minRTT vs. Hop-count SE (Std. Error) = 25.71

Multiple Linear Regression (Multiple metrics) minRTT vs. Geo-distance, Hop-count SE = minRTT vs. Geo-distance, AS-count SE = 23.80

minRTT =  geo-distance +  hop-count +  AS-count ? TermCoefficientp-value Geo-distance12.53 (  ) < Hop-count2.45 (  ) < AS-count-0.64 (  ) High correlation between hop-count and AS-count (highest among any other pair of metrics) Hop-count and AS-count should not be used together

A new Off-line metric: Depth Hop-count: requires dynamic probing Introduce an alternate metric: Depth –Average Hop-count to the nearest backbone network (a hand-made list of 30 big core networks) –Constant per host (client/server) –Alternately, measure in units of time rather than hops –(Client depth + Server depth) as a metric

Linear Regression (Depth) minRTT vs. Depth SE = minRTT vs. Depth and Geo-distance SE = 24.52

Squared Errors in Estimating minRTT Metric SE (Standard Error) Geo-distance, Hop-count21.52 Geo-distance, AS-count23.80 Geo-distance, Depth24.52 Hop-count25.71 Geo-Distance26.93 Depth41.02

Accuracy of picking the nearest mirror site Allowed Delta Random Geo- distance Hop-count Geo- distance, Hop-count Geo- distance, Depth %37.84%44.32%38.41%33.98% 10ms21.15%53.07%58.98%55.91%50.45% 20ms33.75%73.18%76.70%74.89%70.91% 30ms46.25%90.91%88.75%91.36%89.43% 880 clients and 8 servers

Summary Combination of hop-count and geographic distance improves over individual metrics Using Depth along with Geo-distance improves performance and is completely off-line For closest mirror selection with 30 ms allowed deviation, almost any metric gives 90% accuracy Is there much space to improve?

The Next Step Global Data –Collection and analysis of data based on clients and servers spread across the globe Using both off-line and on-line –Techniques to combine the power of off line estimation with on-line estimation.