Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
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.
Relative Network Positioning via CDN Redirections A. Su, D. Choffnes, F. Bustamante, A. Kuzmanovic ICDCS 2008 Presented by: Imranul Hoque.
CS 4700 / CS 5700 Network Fundamentals Lecture 15: Content Delivery Networks (Over 1 billion served … each day) Revised 10/22/2014.
1 Server Selection & Content Distribution Networks (slides by Srini Seshan, CS CMU)
Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
Ao-Jan Su and Aleksandar Kuzmanovic Department of EECS Northwestern University Thinning Akamai USENIX/ACM SIGCOMM IMC ’08.
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.
One-Click Hosting Services: A File-Sharing Hideout Demetris Antoniades Evangelos P. Markatos ICS-FORTH Heraklion,
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.
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.
An Analysis of Internet Content Delivery Systems Stefan Saroiu, Krishna P. Gommadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy Proceedings of.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
1 The Content and Access Dynamics of a Busy Web Server: Findings and Implications Venkata N. Padmanabhan Microsoft Research Lili Qiu Cornell University.
Rutgers PANIC Laboratory The State University of New Jersey Self-Managing Federated Services Francisco Matias Cuenca-Acuna and Thu D. Nguyen Department.
CDNs & Replication Prof. Vern Paxson EE122 Fall 2007 TAs: Lisa Fowler, Daniel Killebrew, Jorge Ortiz.
Overlay Networks EECS 122: Lecture 18 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Understanding the Network and User-Targeting Properties of Web Advertising Networks Yong Wang 1,2 Daniel Burgener 1 Aleksandar Kuzmanovic 1 Gabriel Maciá-Fernández.
SERVER LOAD BALANCING Presented By : Priya Palanivelu.
IMC 2004Jeff Pang 1 Availability, Usage, and Deployment Characteristics of the Domain Name System Jeffrey Pang *, James Hendricks *, Aditya Akella *, Roberto.
Anycast Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
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.
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
Content Delivery Networks. History Early 1990s sees 100% growth in internet traffic per year 1994 o Netscape forms and releases their first browser.
Content Distribution Network (CDN) Performance Punit Shah CSE581 Internet Technologies OGI, OHSU 2002, Jan 16th.
CS 4700 / CS 5700 Network Fundamentals Lecture 17.5: Project 5 Hints (Getting a job at Akamai) Revised 3/31/2014.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
On the Use and Performance of Content Distribution Networks Balachander Krishnamurthy Craig Wills Yin Zhang Presenter: Wei Zhang CSE Department of Lehigh.
CSE 534 – Fundamentals of Computer Networks Lecture 11: Content Delivery Networks (Over 1 billion served … each day) Based on slides by D. NEU.
Sipat Triukose, Zhihua Wen, Michael Rabinovich WWW 2011 Presented by Ye Tian for Course CS05112.
On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.
1. 1.Charting the CDNs(locating all their content and DNS servers). 2.Assessing their server availability. 3.Quantifying their world-wide delay performance.
{ Content Distribution Networks ECE544 Dhananjay Makwana Principal Software Engineer, Semandex Networks 5/2/14ECE544.
1 One-Click Hosting Services: A File-Sharing Hideout Demetris Antoniades Evangelos P. Markatos ICS-FORTH Heraklion,
Oasis: Anycast for Any Service Michael J. Freedman Karthik Lakshminarayanan David Mazières in NSDI 2006 Presented by: Sailesh Kumar.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Taming the Torrent: A Practical Approach to Reducing Cross-ISP Traffic in Peer-to-Peer Systems David R. Choffnes and Fabián E. Bustamante Speaker: Wally.
SCAN: a Scalable, Adaptive, Secure and Network-aware Content Distribution Network Yan Chen CS Department Northwestern University.
SAINT ‘01 Proactive DNS Caching: Addressing a Performance Bottleneck Edith Cohen AT&T Labs-Research Haim Kaplan Tel-Aviv University.
Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization Yang Chen Department of Computer Science Duke University
CDN Brokering* Presented By Nick Arnold Authors Alexandros Biliris, et. Al.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Outline Introduction Overview of the Akamai platform Akamai HD network
CDN: Content Distribution Networks  References:  CS613 textbook, “Computer Networking – A Top-Down Approach”, 6 th edition. Chapter  The text.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Content distribution networks (CDNs) r The content providers are the CDN customers. Content replication r CDN company installs hundreds of CDN servers.
Measuring and Evaluating Large-Scale CDNs Huang et al. An offensive analysis Daniel Burgener John Otto F'09 - EECS 440 Adv Net - 7 Oct 2009.
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.
Drafting Behind Akamai (Travelocity-Based Detouring) Dr. Yingwu Zhu.
Network Coordinates : Internet Distance Estimation Jieming ZHU
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Information-Centric Networks Section # 3.2: DNS Issues Instructor: George Xylomenos Department: Informatics.
Globally Distributed Content Delivery Presenter: Baoning Wu 03/25/2003.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Googling the Internet (and Beyond) Aleksandar Kuzmanovic EECS Department Northwestern University
John S. Otto Mario A. Sánchez John P. Rula Fabián E. Bustamante Northwestern, EECS.
Drafting Behind Akamai (Travelocity-Based Detouring) Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic and Fabián E. Bustamante Department of EECS Northwestern.
Cluster-Based Scalable
Taming the Torrent (Can’t P2P and ISPs just get along?)
Dude, where’s that IP? Circumventing measurement-based geolocation
Content Distribution Networks
Content Delivery and Remote DNS services
Presentation transcript:

Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via CDN Redirections IEEE ICDCS 2008

Relative Network Positioning via CDN Redirections Ao-Jan Su Network Positioning Why do we need network positioning systems? –Emerging large scale distributed systems can benefit from selecting among alternative nodes Example: select an on-line gaming server –All-to-all measurements are not scalable Current approaches –Provide network positioning services in a scalable way (e.g. landmark based) –Clear tradeoffs Precision vs. overhead Precision vs. deployment And others 2

Relative Network Positioning via CDN Redirections Ao-Jan Su Observations Content distribution networks (e.g., Akamai) improve web performance by –Performing extensive network measurements –Redirecting clients to their closest replica servers –Publishing the results through DNS 3 Can we reuse those measurements collected by CDNs to build a network positioning system?

Relative Network Positioning via CDN Redirections Ao-Jan Su 4 CDNs Basics Web client’s request redirected to ‘close’ by server –Client gets web site’s DNS CNAME entry with domain name in CDN network –Hierarchy of CDN’s DNS servers direct client to 2 nearby servers Internet Web client Hierarchy of CDN DNS servers Customer DNS servers (1) (2) (3) (4) (5) (6) LDNS Client requests translation for yahoo Client gets CNAME entry with domain name in Akamai Client is given 2 nearby web replica servers (fault tolerance) Web replica servers Multiple redirections to find nearby edge servers

Relative Network Positioning via CDN Redirections Ao-Jan Su Our approach CDN-based Relative Network Positioning (CRP) Clients are redirected to currently closest replica servers in general CDN’s redirections are primarily driven by network conditions (latency) [Su et al. 2006] Inferring relative network distance by overlapping CDN replica servers 5 A B C R1R2

Relative Network Positioning via CDN Redirections Ao-Jan Su Uses of CRP Closest node selection –Select the closest node (shortest latency) from a group of candidates (e.g. select the closest on-line gaming server) –Methodology Encode redirection frequency from a node to its redirected replica servers by a vector Compare similarity (cosine similarity) of nodes’ redirection vectors to estimate proximity 6 Client Server A Server B Replica servers R1 R2 R

Relative Network Positioning via CDN Redirections Ao-Jan Su Uses of CRP (Cont.) Clustering –Select a set of nodes that are close to each other (e.g. replicate content to a group of nodes) –Methodology Select cluster centers Assign strong mapping peers to the cluster centers 7

Relative Network Positioning via CDN Redirections Ao-Jan Su Evaluation Goals Comparing the performance of CRP’s closest node selection to –Ground truth – active measurements –A state of the art network positioning system – Meridian [Wong 2005] With respect to –Accuracy –Scalability –Deployment –Overhead 8 Meridian: Closest node selection

Relative Network Positioning via CDN Redirections Ao-Jan Su Experiment Setup Globally distributed nodes –1000 DNS servers as clients –240 Planet Lab nodes as candidate servers (on the same nodes as our reference system – Meridian) Concurrent data collection –Monitoring CDN redirections by recursive DNS queries for CRP –Querying Meridian via its interface –Measuring end-to-end latencies by pings as the ground truth 9

Relative Network Positioning via CDN Redirections Ao-Jan Su Selecting the closest node 10 Clients are not close to any servers due to Limited Planet Lab nodes coverage (Meridian) Located in areas not well served by CDNs (CRP) Clients are not close to any servers due to Limited Planet Lab nodes coverage (Meridian) Located in areas not well served by CDNs (CRP) CRP’s accuracy is comparable to its alternative without active measurements and dedicated infrastructure CRP’s recommendations for 65% of nodes differ from Meridian by < 7ms CRP’s recommendations for 65% of nodes differ from Meridian by < 7ms CRP outperforms Meridian by 25% of the nodes due to larger deployment of CDN replica servers CRP outperforms Meridian by 25% of the nodes due to larger deployment of CDN replica servers

Relative Network Positioning via CDN Redirections Ao-Jan Su Selecting the closest node (Cont.) Relative Error: estimated latency – ground truth 11 80% of CRP nodes have relative error < 50ms 80% of CRP nodes have relative error < 50ms CRP’s is quite accurate comparing to ground truth, with virtually no measurement overhead

Relative Network Positioning via CDN Redirections Ao-Jan Su Rank: rank 0 is the closest server Load on CDN’s DNS System 12 Low probe frequency Smaller overhead Less accurate Miss overlapping replica servers Low probe frequency Smaller overhead Less accurate Miss overlapping replica servers 100 mins probe frequency Appropriate for 95% of nodes Much less than CDN’s DNS TTL (20 secs) Overhead is too small to impact CDN’s operations 100 mins probe frequency Appropriate for 95% of nodes Much less than CDN’s DNS TTL (20 secs) Overhead is too small to impact CDN’s operations High probe frequency Can Improve accuracy Larger overhead High probe frequency Can Improve accuracy Larger overhead

Relative Network Positioning via CDN Redirections Ao-Jan Su Load on CRP Clients 13 Large history More refined results Larger computation overhead Large history More refined results Larger computation overhead Small history Sufficient for CRP Small overhead Capture network dynamics Small history Sufficient for CRP Small overhead Capture network dynamics

Relative Network Positioning via CDN Redirections Ao-Jan Su You May Be Wondering “Will CDNs be unhappy because of CRP?” –CRP nodes behaves as regular web clients –CRP’s overhead does not impact CDN’s daily operations –Could be an additional service provided by CDNs “What if CDNs change their redirection policy?” –CRP’s goal aligns with CDNs –Our approach is not restricted to a specific CDN, CRP can reuse results from other measurement infrastructures 14

Relative Network Positioning via CDN Redirections Ao-Jan Su Summary CRP discovers relative positions of end hosts –Closest node selection –Clustering Key features of CRP –Accurate –Light-weight Reuse CDN’s network measurements –Scalable No dedicated infrastructure is required 15

Relative Network Positioning via CDN Redirections Ao-Jan Su Cosine Similarity 16