King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:

Slides:



Advertisements
Similar presentations
LASTor: A Low-Latency AS-Aware Tor Client
Advertisements

Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
1 An Efficient, Hardware-based Multi-Hash Scheme for High Speed IP Lookup Hot Interconnects 2008 Socrates Demetriades, Michel Hanna, Sangyeun Cho and Rami.
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
2.1 Installing the DNS Server Role Overview of the Domain Name System Role Overview of the DNS Namespace DNS Improvements for Windows Server 2008 Considerations.
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
By Hitesh Ballani, Paul Francis, Xinyang Zhang Slides by Benson Luk for CS 217B.
King of Limitations Present by: Ao-Jan Su. Accuracy? Accuracy depends on the distance of end hosts and their authoritative name servers. Not true for.
An Engineering Approach to Computer Networking
MCDST : Supporting Users and Troubleshooting a Microsoft Windows XP Operating System Chapter 13: Troubleshoot TCP/IP.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Vivaldi Coordinate Service Justin Ma, Patrick Verkaik, Michael Vrable Department of Computer Science And Engineering UCSD CSE222A, Winter 2005.
Hitesh Ballani, Paul Francis(Cornell University) Presenter: Zhenhua Liu Date: Mar. 16 th, 2009.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Informed Detour Selection Helps Reliability Boulat A. Bash.
1 A Suite of Schemes for User-level Network Diagnosis without Infrastructure Yao Zhao, Yan Chen Lab for Internet and Security Technology, Northwestern.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
PAM A Measurement Study of Internet Delay Asymmetry Abhinav PathakPurdue University Himabindu PuchaPurdue University Ying ZhangUniversity of Michigan.
Drafting Behind Akamai (Travelocity-Based Detouring) Aleksandar Kuzmanovic Northwestern University Joint work with: A. Su, D. Choffnes, and F. Bustamante.
1 Drafting Behind Akamai (Travelocity-Based Detouring) AoJan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante Department of Electrical.
T. S. Eugene Ng Mellon University1 Global Network Positioning: A New Approach to Network Distance Prediction Tze Sing Eugene.
Evaluation of the Proximity between Web Clients and their Local DNS Servers Z. Morley Mao UC Berkeley C. Cranor, M. Rabinovich,
MCTS Guide to Microsoft Windows Server 2008 Network Infrastructure Configuration Chapter 5 Introduction to DNS in Windows Server 2008.
70-293: MCSE Guide to Planning a Microsoft Windows Server 2003 Network, Enhanced Chapter 7: Planning a DNS Strategy.
Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002.
Evaluation of the Proximity between Web Clients and their Local DNS Servers Z. Morley Mao Chuck Cranor, Fred Douglis, Misha Rabinovich, Oliver Spatscheck,
DNS. Outline r Domain Name System r DNS Hierarchy r Resolution.
Domain Name Services Oakton Community College CIS 238.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Active Network Applications Tom Anderson University of Washington.
On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.
1 Naming with the Domain Name System. 2 Internet Applications Domain Name System Electronic mail IP telephony Remote login File transfer All use client-server.
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
1. 1.Charting the CDNs(locating all their content and DNS servers). 2.Assessing their server availability. 3.Quantifying their world-wide delay performance.
Improving the Reliability of Internet Paths with One-hop Source Routing Krishna Gummadi, Harsha Madhyastha Steve Gribble, Hank Levy, David Wetherall Department.
Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.
DNS Conceptos Básicos. DNS – Conceptos Básicos Structure of Computer Names To obtain a domain, an organization must register with the Internetn autority.
Architecture of DNS CS 718 Activity 4 Submitted by Parag Abhyankar Anup S. Kunte
FIDEMO 2009, Nov. 18 A Step Towards a Planet-scale Measurements Retrieval Infrastructure In this work, we propose to design an end-to-end path and delay.
Application-Layer Anycasting By Samarat Bhattacharjee et al. Presented by Matt Miller September 30, 2002.
Paper Presentation – CAP Page 2 Outline Review - DNS Proposed Solution Simulation Results / Evaluation Discussion.
Chapter 13 Microsoft DNS Server n DNS server: A Microsoft service that resolves computer names to IP addresses, such as resolving the computer name Brown.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
October 8, 2015 University of Tulsa - Center for Information Security Microsoft Windows 2000 DNS October 8, 2015.
The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi, R. Gummadi..,S.Gribble, S. Ratnasamy, S. Shenker, I. Stoica.
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,
Performance Evaluation of ATM Shortcuts in Overlaid IP/ATM Networks Jim Kurose Don Towsley Department of Computer Science Univ. of Massachusetts, Amherst.
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.
Configuring Name Resolution and Additional Services Lesson 12.
Chelebi: Subnet-level Internet Mapper Mehmet H. Gunes University of Nevada, Reno.
LEGS: A WSRF Service to Estimate Latency between Arbitrary Hosts on the Internet R.Vijayprasanth 1, R. Kavithaa 2,3 and Raj Kettimuthu 2,3 1 Coimbatore.
24. DNS Domain Name System address 1. Name server domain name IP address ftp.cs.mit.eduxx.xx.xx.xx 24.2 Mapping Domain Names To.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
Determining the Geographic Location of Internet Hosts Venkata N. Padmanabhan Microsoft Research Lakshminarayanan Subramanian University of California at.
Mitigating DNS DoS Attacks Hitesh Ballani, Paul Francis 1.
Drafting Behind Akamai (Travelocity-Based Detouring) Dr. Yingwu Zhu.
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
1. Internet hosts:  IP address (32 bit) - used for addressing datagrams  “name”, e.g., ww.yahoo.com - used by humans DNS: provides translation between.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
John S. Otto Mario A. Sánchez John P. Rula Fabián E. Bustamante Northwestern, EECS.
© 2006 Andreas Haeberlen, MPI-SWS 1 Monarch: A Tool to Emulate Transport Protocol Flows over the Internet at Large Andreas Haeberlen MPI-SWS / Rice University.
Drafting Behind Akamai (Travelocity-Based Detouring) Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic and Fabián E. Bustamante Department of EECS Northwestern.
PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services Ming Zhang, Chi Zhang Vivek Pai, Larry Peterson, Randy Wang Princeton.
Lecture 13 – Network Mapping
Internet Indirection Infrastructure (i3)
Vivaldi: A Decentralized Network Coordinate System
Early Measurements of a Cluster-based Architecture for P2P Systems
A Measurement Study of Peer-to-Peer File Sharing Systems
A Measurement Study of Napster and Gnutella
Presentation transcript:

King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by: Amit Mondal

A Question: What can we do with a tool that could estimate latency between any two arbitrary hosts accurately? A B C C can measure latency between A and B

Potential uses of such a tool  Building topologically sensitive overlays  Selecting a close replica server  Scaling wide-area measurement studies involving latency estimation Detour etc., current state of the art techniques allow at most a few hundred end hosts to be measured

Current state of the art  Use techniques like IDMaps and GNP inaccuracy in estimates: We need a tool that can measure latency rather than compute it issues with deployment: IDMaps requires additional infrastructure;  Use shared measurement infrastructure e.g., trace-route servers, PlanetLab,

King: a new measurement tool  Estimate latency between arbitrary end hosts  Requires no additional infrastructure leverage existing DNS infrastructure enabling a large fraction of Internet hosts to be measured  Provides highly accurate latency estimates  Fast and light-weight requires only a few DNS queries per estimate

Outline  Motivation  How King works  Evaluation of King  Conclusions

Name Server near Host A Name Server near Host B Host BHost A Actual Latency Between End Hosts Latency Estimated By King How King Works: The Basic Idea  Challenge 1: How to find name servers that are close to end hosts  Challenge 2: How to estimate latency between two name servers

Challenge 2: How do we estimate the latency between name servers? Our Client C (King) Name Server B foo.bar Name Server A 1. Request Q: Resolve xyz.foo.bar 4. Reply Q (Forwarded) 2. Request Q (Forwarded) 3. Reply Q: IP addr of xyz.foo.bar

Success of Recursive DNS  For King to work, name servers must support recursive queries in a large random sample, > 75% of name servers supported recursion translates to > 90% success rate given a pair as we can measure from A->B, or B->A

Challenge 1: How to find DNS servers nearby the end hosts  Assumption: Authoritative name servers for the host are closeby (topologically and geographically)  This assumption may not always hold, but our evaluation shows that it is true in general e.g., AOL is an exception  To find an authoritative name server given host name, use forward name resolution given host IP, use reverse lookup in in-addr.arpa domain

Selecting a close name server  When multiple authoritative name servers are deployed, how do we choose a close one? select the server with longest matching DNS suffix and IP prefix with end host

Outline  Motivation  How King works  Evaluation of King  Conclusions

Evaluation of King  How accurate is King?  What are the causes of inaccuracy?  Can King identify its own inaccurate estimates?  Does King preserve order among its estimates?

Accuracy of King  Compare the accuracy of King with IDMaps  Methodology Measure true latency between 50 public Traceroute servers and 50 end hosts using Traceroute Estimate latency between the same endpoints using King and IDMaps Compare estimated latency with measured latency Metric used : Estimated Latency Measured Latency

Accuracy of King  King is far more accurate than IDMaps  King tends to under-estimate latencies typically, name servers have higher BW and lower latency last hop links than end hosts

Evaluation of King  How accurate is King?  What are the causes of inaccuracy?  Can King identify its own inaccurate estimates?  Does King preserve order among its estimates?

Causes of Inaccuracy in King  Authoritative name servers may not be close to end hosts  Latency estimation between the name servers might be inaccurate application level latency at DNS servers to resolve the query

Are authoritative name servers close to their end hosts?  In a random sample, 70-80% of end hosts and their name servers are separated by less than msec  Our conclusion contradicts earlier studies !!  Possible explanations: We looked at more metrics divergent path hop count – a misleading metric used primarily in other studies; divergent path latency – tells a different story Unknown bias in our random samples

Application level latency for DNS servers  Methodology: selected a large number sample of name servers measured latency to servers using Ping and DNSPing (iterative DNS query) over time Query resolution latency = DNSPing – Ping  Application level latency negligible Implication: King estimates between name servers are very highly accurate

Evaluation of King  How accurate is King?  What are the causes of inaccuracy?  Can King identify its own inaccurate estimates?  Does King preserve order among its estimates?

Can King identify its own inaccurate estimates?  Primary cause of error in King authoritative name servers far from their end host  Simple heuristics based on the lengths of DNS suffix and IP prefix match work well

Evaluation of King  How accurate is King?  What are the causes of inaccuracy?  Can King identify its own inaccurate estimates?  Does King preserve order among its estimates?

Does King preserve order among its estimates?  Sometimes preserving order among estimates is more important than their accuracy Applications like server selection  King does very well at preserving order among its estimates very high correlation coefficient (>0.8) between the orderings of estimated and true latencies large latency last hops do not effect order

Summary of evaluation  King is far more accurate than IDMaps King errors more when it under-estimates due to large last hop latencies of end hosts accuracy of estimates between name servers is even higher  The primary cause of error is the authoritative name servers that are far from their end hosts King uses heuristics to identify such errors  King preserves excellent order among its estimates

Validating King’s utility for wide-area measurement studies  The Detour study showed that default routes are inefficient, and alternate routes can have better latency. they were limited to 35x35 data points  We repeated study using King we gathered 193x193 data points The data points were name servers chosen using King’s self- evaluation heuristics it took less than 4-5 hours using a single machine our results were consistent with those from earlier study

Conclusions  We presented King; a new measurement tool that can estimate latency between arbitrary Internet end hosts does not require any additional infrastructure as it leverages existing DNS infrastructure fast and light-weight  Our evaluation of King confirms that it is accurate it preserves order among its estimates  We showed that King can be used in scaling wide- area measurement studies

Thank you!