IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.

Slides:



Advertisements
Similar presentations
P2P Market Conference March 2009 Mitchell Edwards CFO & GC BitTorrent, Inc.
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
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.
Broadband Internet Performance: A View from the Gateway Srikanth Sundaresan, Walter de Donato, Nick Feamster, Renata Teixeira, Sam Crawford, Antonio Pescapè.
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
By Hitesh Ballani, Paul Francis, Xinyang Zhang Slides by Benson Luk for CS 217B.
The Frog-Boiling Attack: Limitations of Secure Network Coordinate Systems IS523 Class Presentation KAIST Seunghoon Jeong 1.
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Identifying Performance Bottlenecks in CDNs through TCP-Level Monitoring Peng Sun Minlan Yu, Michael J. Freedman, Jennifer Rexford Princeton University.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
© 2006 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice S 3 : A Scalable Sensing Service.
Vivaldi Coordinate Service Justin Ma, Patrick Verkaik, Michael Vrable Department of Computer Science And Engineering UCSD CSE222A, Winter 2005.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
An Algebraic Approach to Practical and Scalable Overlay Network Monitoring Yan Chen, David Bindel, Hanhee Song, Randy H. Katz Presented by Mahesh Balakrishnan.
King : Estimating latency between arbitrary Internet end hosts Krishna Gummadi, Stefan Saroiu Steven D. Gribble University of Washington Presented by:
1 Network Tomography Venkat Padmanabhan Lili Qiu MSR Tab Meeting 22 Oct 2001.
1 End-to-End Detection of Shared Bottlenecks Sridhar Machiraju and Weidong Cui Sahara Winter Retreat 2003.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Comparing Hybrid Peer-to-Peer Systems Beverly Yang and Hector Garcia-Molina Presented by Marco Barreno November 3, 2003 CS 294-4: Peer-to-peer systems.
Fixing the Embarrassing Slowness of OpenDHT on PlanetLab Sean Rhea, Byung-Gon Chun, John Kubiatowicz, and Scott Shenker UC Berkeley (and now MIT) December.
High Performance Cooperative Data Distribution [J. Rick Ramstetter, Stephen Jenks] [A scalable, parallel file distribution model conceptually based on.
Computer Science 1 Characterizing Link Properties Using “Loss-pairs” Jun Liu (joint work with Prof. Mark Crovella)
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
Content Delivery Networks. History Early 1990s sees 100% growth in internet traffic per year 1994 o Netscape forms and releases their first browser.
A Criticism of: “Moving beyond end-to-end path information to optimize CDN performance” Gautam Bhawsar Alok Rakkhit.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
Path selection Packet scheduling and multipath Sebastian Siikavirta and Antti aalto.
IPlane Status Harsha V. Madhyastha University of California San Diego.
Content Distribution March 8, : Application Layer1.
Can Network Coding Help in P2P Networks? Dah Ming Chiu, Raymond W Yeung, Jiaqing Huang and Bin Fan Chinese University of Hong Kong Presented by Arjumand.
1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.
1 One-Click Hosting Services: A File-Sharing Hideout Demetris Antoniades Evangelos P. Markatos ICS-FORTH Heraklion,
Dynamic Network Emulation Security Analysis for Application Layer Protocols.
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.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
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.
Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.
L-24 Adaptive Applications 1. State of the Art – Manual Adaptation Objective: automating adaptation ? CaliforniaNew York 2.
A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance Purvi Shah, Jehan-François Pâris, Jeffrey Morgan and John Schettino IEEE.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
Network Coordinates : Internet Distance Estimation Jieming ZHU
On the Impact of Clustering on Measurement Reduction May 14 th, D. Saucez, B. Donnet, O. Bonaventure Thanks to P. François.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Peer-to-Peer Result Dissemination in High-Volume Data Filtering Shariq Rizvi and Paul Burstein CS 294-4: Peer-to-Peer Systems.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
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.
9/29/04 GGF Random Thoughts on Application Performance and Network Characteristics Distributed Systems Department Lawrence Berkeley National Laboratory.
Proposal Presentation Inferring Geographic proximity of the Internet Node using a Compound Metric M. Kamran Nishat.
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.
Drafting Behind Akamai (Travelocity-Based Detouring) Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic and Fabián E. Bustamante Department of EECS Northwestern.
University of Maryland College Park
Data Center Network Architectures
Hybrid Cloud Architecture for Software-as-a-Service Provider to Achieve Higher Privacy and Decrease Securiity Concerns about Cloud Computing P. Reinhold.
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Congestion Control, Quality of Service, & Internetworking
EE 122: Lecture 22 (Overlay Networks)
An Empirical Evaluation of Wide-Area Internet Bottlenecks
Presentation transcript:

iPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri

Do we really need a new plane? The Internet is already quite complex Existing applications are working well Why try to change it by adding another plane?

Already many studies! KnowledgePlane by Clark et al. Reverse Engineering the Internet by Spring et al. Sophia: An information plane for networked systems by Wawrzoniak et al.

Many solutions already exist! IDMaps GNP Vivaldi Meridian PlanetSeer

Anything new in this paper? Just an integration of past work “Previous research efforts have proposed specific ways to measure each of these properties; our goal is to integrate these techniques into a useful prediction system”

Usability Network today is over-provisioned – Only 3% of the bandwidth is used End nodes are the bottleneck – Only the internet core is studied – How much percentage of the Internet applications find this really useful? – Creating a new Internet plane for a handful of applications?

CDN CDNs are mainly concerned with load balancing Unless there is a dense CDN you will end up sending data through the bottleneck link.

Path Prediction Path Prediction highly depends on the vantage points location Closer the vantage point the tighter the bound will be Measuring routes to remote places (eg. Alaska) will induce a significant error – Since no close by vantage point

Edge Measurement Bandwidth that iPlane observes might just be a fraction – BitTorrent clients may have multiple connections open – Only upload bandwidth is considered – Noise in traffic is not considered – What if there is a delayed response from the P2P client?

Measurement Measurement data and results not very convincing Compared the performance of speculative RTT and throughput to the ground truth data – Not even close to the ground truth What is the point of your measurement?

Measurement … 2 Measurement techniques not very accurate – “We can predict the AS path exactly right for around 70% of the paths evaluated” – “For 77% of paths, iPlane’s latency estimates have error less than 20ms, and for 82% of paths, loss rate estimates have error about 10%” – “For 80% of the nodes, the correlation coefficient of TCP Throughput is greater than 0.7”

PlanetLab for Measurement Uses PlanetLab for most of its measurement and evaluation – Ofcourse, we agree that it is inevitable Evaluating in a more controlled environment – Obviously results of the tests are likely to be better than in real world It would be best if none of the sites hosting vantage points are used as clients for evaluation – They do not mention that in the paper.

Comparing BitTorrent & Vivaldi CDFs of BitTorrent download completion times with and without informed peer selection at the tracker

Not Real-time

Scalability Maintenance of many vantage points is difficult What if multiple vantage points go down? – The load of measurement shifts to other vantage points – But can they handle it efficiently?

Security Assume that Traceroute servers provide unbiased data – Not under our control – Could be compromised – No verification in place

Query Interface Not feasible to download the complete atlas of the Internet On-the-fly queries are expensive – Time intensive – CPU intensive

Conclusion Put together lot of random thoughts to make up this paper – Frontier alg, BFS, Clustering alg, SQL Old wine in a new bottle

Questions? Thank you!