Topology Discovery Using an Address Prefix Stopping Rule Benoit Donnet Joint work with Timur Friedman Eunice 2005 – Madrid (Spain)

Slides:



Advertisements
Similar presentations
University of Nevada, Reno Router-level Internet Topology Mapping CS790 Presentation Modified from Dr. Gunes slides by Talha OZ.
Advertisements

IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Measuring the Deployment of IPv6: Topology, Routing, and Performance Amogh Dhamdhere, Matthew Luckie, Bradley Huffaker, kc claffy (CAIDA / UC San Diego)
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
Efficient Constraint Monitoring Using Adaptive Thresholds Srinivas Kashyap, IBM T. J. Watson Research Center Jeyashankar Ramamirtham, Netcore Solutions.
Computer Networks: Global Internet Global Internet.
Power Efficient IP Lookup with Supernode Caching Lu Peng, Wencheng Lu*, and Lide Duan Dept. of Electrical & Computer Engineering Louisiana State University.
Routing and Routing Protocols
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
Exploring new methods of route aggregation Amirali Abdullah.
Measuring ISP topologies with Rocketfuel Ratul Mahajan Neil Spring David Wetherall University of Washington ACM SIGCOMM 2002.
A Scalable, Commodity Data Center Network Architecture.
1 Network Topology Measurement Yang Chen CS 8803.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 OSI Network Layer Network Fundamentals – Chapter 5.
INTERNET TOPOLOGY MAPPING INTERNET MAPPING PROBING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University.
Network Layer Moving datagrams. How do it know? Tom-Tom.
Review of IP traceback Ming-Hour Yang The Department of Information & Computer Engineering Chung Yuan Christian University
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
TRACENET M.Engin TozalKamil Sarac The University of Texas at Dallas.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.
Measuring ISP Toplogies with Rocketfuel Neil Spring, Ratul Mahajan, and David Wetherall Presented By: David Deschenes March 25, 2003.
Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements DK Lee, Keon Jang, Changhyun Lee, Sue Moon, Gianluca Iannaccone* ASIAFI.
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
Tony McGregor RIPE NCC Visiting Researcher The University of Waikato Optimising Path Discovery Doubletree.
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.
Infiniband subnet management Discuss the Infiniband subnet management system Discuss fat tree and subnet management in an Infiniband with a fat tree topology.
Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.
Efficient Algorithms for Large-Scale Topology Discovery Benoit Donnet joint work with Philippe Raoult, Timur Friedman and Mark Crovella Sigmetrics 2005.
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.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 4: Addressing in an Enterprise Network Introducing Routing and Switching in the.
Tony McGregor RIPE NCC Visiting Researcher The University of Waikato DAR Active measurement in the large.
Doubletree: a Way to Reduce Redundancy in Traceroute Systems Benoit Donnet joint work with P. Raoult, T. Friedman and M. Crovella CAIDA – San Diego (Sept.
A METHOD FOR INCONSPICUOUS TRACEROUTE Jonathan Haber.
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
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‡
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
On the Impact of Clustering on Measurement Reduction May 14 th, D. Saucez, B. Donnet, O. Bonaventure Thanks to P. François.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
Yaping Zhu with: Jennifer Rexford (Princeton University) Aman Shaikh and Subhabrata Sen (ATT Research) Route Oracle: Where Have.
Measurement in the Internet Measurement in the Internet Paul Barford University of Wisconsin - Madison Spring, 2001.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Fault Isolation in Multicast Trees Anoop Reddy, Ramesh Govindan, Deborah Estrin. USC/Information Sciences Institute Presented by: Srikrishna Gurugubelli.
INTERNET MEASUREMENT INTERNET MAPPING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University of Nevada,
10-Year History of Internet Delay 1 April 24, 2010, DK Lee, Kenjiro Cho*, Gianluca Iannaccone**, Sue Moon CAIDA-WIDE-CASFI Joint Workshop.
Doc.: IEEE /0598r0 Submission May 2004 Tyan-Shu Jou, et al., Janusys NetworksSlide 1 Is Spanning Tree Protocol Right for ESS Mesh? Tyan-Shu Jou,
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.
Plethora: A Locality Enhancing Peer-to-Peer Network Ronaldo Alves Ferreira Advisor: Ananth Grama Co-advisor: Suresh Jagannathan Department of Computer.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
1 Internet Topology Discovery Through mrinfo Probing Benoit Donnet Workshop on Active Internet Measurements San Diego - Feb
A CIDR Prefix Stopping Rule for Topology Discovery Benoit Donnet joint work with Timur Friedman Algotel 2005 – Presqu'Ile de Giens.
Configuration for routing example
Mapa de Topología usando sondas RIPE Atlas
Comparative Analysis of Internet Topology Data Sets
Jian Wu (University of Michigan)
Avoiding traceroute anomalies with Paris Traceroute
Evaluation of a Large-Scale Topology Discovery Aglorithm
Improved Algorithms for Network Topology Discovery
COMP 3270 Computer Networks
RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS
Plethora: Infrastructure and System Design
Measured Impact of Crooked Traceroute
Switch controller: Routing
Multipath tracing with Paris Traceroute
ECE 544 Project3 Team member.
Visualization of Temporal Difference of BGP Routing Information
Presentation transcript:

Topology Discovery Using an Address Prefix Stopping Rule Benoit Donnet Joint work with Timur Friedman Eunice 2005 – Madrid (Spain)

Context ● Network measurement ● Internet topology discovery using distributed traceroute monitors – IP interface level ● Existing tools: – Skitter (CAIDA) – TTM (RIPE NCC) – AMP (NLANR) – DIMES (Tel Aviv U.)

Scaling Problem ● More monitors means more load on – network resources – destinations ● Classical approaches either – stay small (skitter, TTM, AMP) – trace slowly (DIMES) ● Can we trace more efficiently?

Contributions ● Efficient cooperative topology discovery algorithm – Doubletree ([Sigmetrics2005]) ● Load on destinations and communication cost reduction – probing stopping rule based on CIDR address prefixes

Doubletree - Basics ● Cooperative algorithm ● Goal: avoiding paths already explored ● Exploit tree-like structure of routes in the internet – from a monitor to a set of destinations ● Backward probing (first suggested by Govindan et al.) – from a set of monitors to a destination ● Forward probing and monitor coordination

Doubletree: Monitor-rooted tree

Doubletree: Destination-rooted tree

Doubletree: Probing scheme ● Two probing schemes: – Backwards – Forwards ● Stop sets = {(interface, root)} – Local Stop Set: B = {interface} – Global Stop Set: F = {(interface, destination)} ● shared by monitors ● Doubletree starts probing at some hop h from the monitor

Limitations ● Load on destination – Potentially, all the destinations may be hit by monitors ● Communication cost – Global stop set exchange needs too high network resources – Up to 20.6MB for only 50,000 destinations

Destination-based stopping rule

Solution ● Destination addresses aggregation through the use of CIDR prefixes ● Global stop set of {(interface, prefix_destination}

Solution (2)

Results (1)

Results (2)

Results (3)

Results (4)

Conclusion ● Improvements to Doubletree – Load on destinations reduced – Communication cost reduced ● Future works – Implementation – BGP-guided topology discovery – Clustering