On the Impact of Clustering on Measurement Reduction May 14 th, 2009 D. Saucez, B. Donnet, O. Bonaventure Thanks to P. François.

Slides:



Advertisements
Similar presentations
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
Advertisements

New Directions in Traffic Measurement and Accounting Cristian Estan – UCSD George Varghese - UCSD Reviewed by Michela Becchi Discussion Leaders Andrew.
REVEALING MIDDLEBOXES INTERFERENCE WITH TRACEBOX Gregory Detal*, Benjamin Hesmans*, Olivier Bonaventure*, Yves Vanaubel° and Benoit Donnet°. *Université.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.
Opportunities and Research Challenges of Hybrid Software Defined Networks ACM SIGCOMM Computer Communication Review table of contents archive Volume 44.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
Enabling Flow-level Latency Measurements across Routers in Data Centers Parmjeet Singh, Myungjin Lee Sagar Kumar, Ramana Rao Kompella.
Geometry of large networks (computer science perspective) Dmitri Krioukov (CAIDA/UCSD) AIM, November 2011.
REDUNDANCY IN NETWORK TRAFFIC: FINDINGS AND IMPLICATIONS Ashok Anand Ramachandran Ramjee Chitra Muthukrishnan Microsoft Research Lab, India Aditya Akella.
1 Internet Path Inflation Xenofontas Dimitropoulos.
Detecting Traffic Differentiation in Backbone ISPs with NetPolice Ying Zhang Zhuoqing Morley Mao Ming Zhang.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Server-based Inference of Internet Performance V. N. Padmanabhan, L. Qiu, and H. Wang.
Can ISPs and P2P Users Cooperate for Improved Performance? Vinay Aggarwal, Anja Feldmann (German Telecom Laboratories) Christian Scheideler (TU, Munchen)
Communication-Efficient Distributed Monitoring of Thresholded Counts Ram Keralapura, UC-Davis Graham Cormode, Bell Labs Jai Ramamirtham, Bell Labs.
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
Evaluation of the Proximity between Web Clients and their Local DNS Servers Z. Morley Mao UC Berkeley C. Cranor, M. Rabinovich,
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
Measuring Network Performance of Multi-Core Multi-Cluster (MCMCA) Norhazlina Hamid Supervisor: R J Walters and G B Wills PUBLIC.
A victim-centric peer-assisted framework for monitoring and troubleshooting routing problems.
Network-Aware Clustering of Web Clients Advanced IP Topics Seminar, Fall 2000 Supervisor: Anat Bremler Speaker: Zotenko Elena.
INTERNET TOPOLOGY MAPPING INTERNET MAPPING PROBING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University.
A Machine Learning-based Approach for Estimating Available Bandwidth Ling-Jyh Chen 1, Cheng-Fu Chou 2 and Bo-Chun Wang 2 1 Academia Sinica 2 National Taiwan.
Position Statement Debbie Perouli, PhD Student Sonia Fahmy, Associate Professor Computer Science Department Purdue University WODNAFO 10.
On the Power of Off-line Data in Approximating Internet Distances Danny Raz Technion - Israel Institute.
Similar problems ALTO BOF - IETF 72 Dublin - July 29, 2008 D. Saucez¹, D. Papadimitriou², S. Previdi³, O. Bonaventure¹ ¹ Université catholique de Louvain.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
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.
Quantifying the Causes of Path Inflation Neil Spring, Ratul Mahajan, and Thomas Anderson Presented by Luv Kohli COMP November 24, 2003.
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization Yang Chen Department of Computer Science Duke University
1 Next Few Classes Networking basics Protection & Security.
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.
1 Passive Network Tomography Using Bayesian Inference Lili Qiu Joint work with Venkata N. Padmanabhan and Helen J. Wang Microsoft Research Internet Measurement.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
1 - GEC8, San Diego, July 20-22, 2010 Measurement Tools in PlanetLab Europe Tanja Zseby (Fraunhofer FOKUS, Berlin, Germany) (some slides from other OneLab.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
1 Vivaldi: A Decentralized Network Coordinate System Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris Presented by: Chen Qian.
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
April 4th, 2002George Wai Wong1 Deriving IP Traffic Demands for an ISP Backbone Network Prepared for EECE565 – Data Communications.
Interdomain Traffic Engineering in a Loc/Id Separation Context INM'08 October 19, D. Saucez, B. Donnet, L. Iannone, O. Bonaventure.
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.
LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
1 Distributed Monitoring CERNET's experience Xing Li
On Improving the Efficiency and Manageability of NotVia Ang Li †, Pierre Francois ‡, and Xiaowei Yang † † UCIrvine ‡ Université catholique de Louvain CoNext.
BGP Routing Stability of Popular Destinations Jennifer Rexford, Jia Wang, Zhen Xiao, and Yin Zhang AT&T Labs—Research Florham Park, NJ All flaps are not.
1 Effective Diagnosis of Routing Disruptions from End Systems Ying Zhang Z. Morley Mao Ming Zhang.
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Topology Discovery Using an Address Prefix Stopping Rule Benoit Donnet Joint work with Timur Friedman Eunice 2005 – Madrid (Spain)
1 On the Impact of Route Monitor Selection Ying Zhang* Zheng Zhang # Z. Morley Mao* Y. Charlie Hu # Bruce M. Maggs ^ University of Michigan* Purdue University.
A CIDR Prefix Stopping Rule for Topology Discovery Benoit Donnet joint work with Timur Friedman Algotel 2005 – Presqu'Ile de Giens.
Fall, 2001CS 6401 Switching and Routing Outline Routing overview Store-and-Forward switches Virtual circuits vs. Datagram switching.
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
BGP Routing Stability of Popular Destinations
Improved Algorithms for Network Topology Discovery
Vivaldi: A Decentralized Network Coordinate System
On the Scale and Performance of Cooperative Web Proxy Caching
Early Measurements of a Cluster-based Architecture for P2P Systems
Are We There Yet? On RPKI Deployment and Security
Presentation transcript:

On the Impact of Clustering on Measurement Reduction May 14 th, D. Saucez, B. Donnet, O. Bonaventure Thanks to P. François Université catholique de Louvain

Measurements to Improve netapps/service performance Bandwidth? Delay? Loss?

3 ? ? ? ? ? ? ? ? ? ? ? ? Scalability issues with large-scale measurements

4 How to reduce the measurement overhead? Limit the number of measured destinations  Clustering Limit the number of measuring sources  Collaboration

5 Limit the number of measured destinations Group destinations into Clusters

6 Clustering techniques Geographic Clustering  Group nodes by city n-agnostic clustering [1]  group nodes by /n prefix AS Clustering [2]  group nodes by Autonomous System BGP Clustering [3]  group nodes by longest match BGP prefix [1] Szymaniak, M. et al., Practical large-scale latency estimation. Computer Networks, 2008 [2] Krishnamurthy, B., Wang, J., Topology modeling via cluster graphs. ACM SIGCOMM Workshop on Internet Measurement (IMW), 2001 [3 ]Krishnamurthy, B., Wang, J., On network-aware clustering of web clients. ACM SIGCOMM, 2000

7 How clustering impacts the accuracy?

8 Evaluation setup Maxmind + Routeviews  1month traceroute traces (Archipelago)‏ Two monitors:  san-us (San Diego, US)‏  bcn-es (Barcelona, SP)‏*

9 RTT error (bcn-es)‏ Geographic, AS n-agnostic, BGP 15% with more than 100% error 10% with more than 200% error 90% with less than 50% error 50% with less than 10% error

10 Clustering reduces the number of measured destinations without loosing too much accuracy can we reduce the number of source of measurements?

11 Limit the number of measuring sources Make measurement sources collaborating

12 Collaboration fundamentals Popular destinations are measured by several nodes  Popularity d : #nodes measuring d Different collaboration approaches  Centralized authority/measurement source  Distributed measurements (ICS)‏

13 How much reduction can we obtain?

14 When can we observe measurement reduction? Clustering reduces measurements if a cluster C covers at least two measured destinations Collaboration reduces measurements if at least two topologically closed sources have to measure the same destination

15 Evaluation setup Campus traffic  UCL, 1 link to 1 month full NetFlow traces  7.45 TB of filtered outgoing traffic 10K sources, 36M destinations

16 Will collaboration help? 74% of the destinations are contacted by only 1 source Some destinations are contacted by 1K+ sources! Few percents are contacted by 10+ sources

17 Will clustering help? At least 45% of the clusters cover more than 10 nodes # of destinations

18 Conclusion Clustering/Collaboration to reduce measurement overhead Reduction/accuracy tradeoff Simple, though efficient techniques, tend to preserve accuracy

19 Questions?

20 Backup

21 Combine Clustering and Collaboration

22 Hop error (bcn-es)‏ 0% more than 50% error 10% more than 50% error bigger the n, smaller the error Geographic, AS n-hybrid, n-agnostic, BGP

23 Error variation inside clusters 75 th percentile 50 ty percentile 25 th percentile

24 The reduction Collaboration only: 40% gain 20-hyb only: 62% gain 20-hyb + Collaboration: 99% gain Collaboration + Clustering always better than clustering or collaboration only

25 Are clustering and collaboration so different? Let C, a cluster of nodes to measure Let S C, the set of nodes measuring C  S C is cluster  nodes in S C can collaborate => S C is the set of collaborating nodes

n-hybrid Clustering / / / / /24... A B C A B C BGP clusters / /20 20-hybrid clusters BGP prefixes can be huge: => Group nodes by longest match BGP prefix down to a given length

27 traceroute to ( ), 30 hops max, 40 byte packets ( ) ms ms ms 2 c hsd1.ga.comcast.net ( ) ms ms ms 3 ge-2-1-ur01.a2atlanta.ga.atlanta.comcast.net ( ) ms ms ms 4 te-9-1-ur02.a2atlanta.ga.atlanta.comcast.net ( ) ms ms ms 5 te-9-3-ur01.b0atlanta.ga.atlanta.comcast.net ( ) ms ms ms 6 po-4-ar01.b0atlanta.ga.atlanta.comcast.net ( ) ms ms ms 7 pos cr01.atlanta.ga.ibone.comcast.net ( ) ms ms ms 8 te-9-1.car1.Atlanta2.Level3.net ( ) ms ms ms 9 ae ebr2.Atlanta2.Level3.net ( ) ms ms ms 10 ae-3.ebr2.Chicago1.Level3.net ( ) ms ms ms 11 ae car1.Chicago1.Level3.net ( ) ms ae car1.Chicago1.Level3.net ( ) ms ae car1.Chicago1.Level3.net ( ) ms... traceroute to ( ), 30 hops max, 40 byte packets ( ) ms ms ms 2 c hsd1.ga.comcast.net ( ) ms ms ms 3 ge-2-1-ur01.a2atlanta.ga.atlanta.comcast.net ( ) ms ms ms 4 te-9-1-ur02.a2atlanta.ga.atlanta.comcast.net ( ) ms ms ms 5 te-9-3-ur01.b0atlanta.ga.atlanta.comcast.net ( ) ms ms ms 6 po-4-ar01.b0atlanta.ga.atlanta.comcast.net ( ) ms ms ms 7 pos cr01.atlanta.ga.ibone.comcast.net ( ) ms ms ms 8 * * * 9 ae ebr2.Atlanta2.Level3.net ( ) ms ms ms 10 ae ebr3.Atlanta2.Level3.net ( ) ms ae ebr3.Atlanta2.Level3.net ( ) ms ae ebr3.Atlanta2.Level3.net ( ) ms 11 ae-7.ebr3.Dallas1.Level3.net ( ) ms ms * 12 ae-3.ebr2.LosAngeles1.Level3.net ( ) ms ms ms 13 ae csw2.LosAngeles1.Level3.net ( ) ms ae csw1.LosAngeles1.Level3.net ( ) ms ms 14 ge-9-2.core1.LosAngeles1.Level3.net ( ) ms ge-5-2.core1.LosAngeles1.Level3.net ( ) ms ge-5-1.core1.LosAngeles1.Level3.net ( ) ms... Traceroute verdict*

28 N-hybrid example / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / /24 Level 3: /8  ? BGP: /24 20-hybrid: /24  ? BGP: /9 20-hybrid: /20  ? BGP: /9 20-hybrid: /20 BGP (Routeviews)‏ Natural follow up, came for free → dessin

29 References [1] Xie et al., P4P: Provider Portal for Applications, in Proc. ACM SIGCOMM, 2008 [2] Aggarwal et al., Can ISPs and P2P systems co-operate for improved performance?, ACM SIGCOMM Computer Communications Review (CCR), 37(3):29–40, July 2007 [3] Saucez et al., Interdomain Traffic Engineering in a Locator/Identifier Separation Context, Internet Network Management Workshop 2008 [4] Dabek et al., Vivaldi, a decentralized network coordinated system. ACM SIGCOMM, 2004 [5] Krishnamurthy, B., Wang, J., Topology modeling via cluster graphs. ACM SIGCOMM Workshop on Internet Measurement (IMW), 2001 [6] Szymaniak, M. et al., Practical large-scale latency estimation. Computer Networks, 2008 [7 ]Krishnamurthy, B., Wang, J., On network-aware clustering of web clients. ACM SIGCOMM, 2000