Topology Modeling via Cluster Graphs Balachander Krishnamurthy and Jia Wang AT&T Labs Research.

Slides:

Advertisements

Similar presentations

Introduction to IP Routing Geoff Huston. Routing How do packets get from A to B in the Internet? A B Internet.

Advertisements

BGP01 An Examination of the Internets BGP Table Behaviour in 2001 Geoff Huston Telstra.

Introduction to IP Routing Geoff Huston

BGP Status Update Geoff Huston September What Happening (AS4637) Date.

Analyzing the Impact of Granularity on IP-to-AS Mapping Presented by Baobao Zhang Authours: Baobao Zhang, Jun Bi, Yangyang Wang, Jianping Wu.

1 Taiwan Routing table statistics – a new service in TWNIC Ching-Heng Ku IP Department TWNIC.

Nick Feamster Georgia Tech

Path Splicing with Network Slicing

Data-Plane Accountability with In-Band Path Diagnosis Murtaza Motiwala, Nick Feamster Georgia Tech Andy Bavier Princeton University.

Path Splicing Nick Feamster, Murtaza Motiwala, Megan Elmore, Santosh Vempala.

Multihoming and Multi-path Routing

Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.

Multihoming and Multi-path Routing

Measurement and Analysis of Online Social Networks 1 A. Mislove, M. Marcon, K Gummadi, P. Druschel, B. Bhattacharjee Presentation by Shahan Khatchadourian.

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

Internet Number Resources 1. Internet IPv4 addresses IPv6 addresses Autonomous System number Fully Qualified Domain Name Key Internet resources.

Jennifer Rexford Princeton University MW 11:00am-12:20pm Logically-Centralized Control COS 597E: Software Defined Networking.

1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.

McGraw-Hill © The McGraw-Hill Companies, Inc., 2004 Chapter 22 Network Layer: Delivery, Forwarding, and Routing Copyright © The McGraw-Hill Companies,

Release 5.1, Revision 0 Copyright © 2001, Juniper Networks, Inc. Advanced Juniper Networks Routing Module 9: Static Routes & Routing Table Groups.

© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing the MPLS VPN Routing Model.

1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.

Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.

S Licentiate course on Telecommunications Technology (4+1+3 cr.) Course Topic Spring 2000: Routing Algorithms in the DiffServ MPLS Networks Introduction.

IP SLA with Object Tracking

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 EN0129 PC AND NETWORK TECHNOLOGY I IP ADDRESSING AND SUBNETS Derived From CCNA Network Fundamentals.

1 Internet Protocol: Routing IP Datagrams D. E. Comer, “Internetworking with TCP/IP: Principles, Protocols and Architectures”, Ch. 8, Prentice Hall, 2000.

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

© 2004 Goodrich, Tamassia Directed Graphs1 JFK BOS MIA ORD LAX DFW SFO.

Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.

Route Optimisation RD-CSY3021.

Multihoming and Multi-path Routing CS 7260 Nick Feamster January

Measurement: Techniques, Strategies, and Pitfalls Nick Feamster CS 7260 February 7, 2007.

© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—5-1 MPLS VPN Implementation Configuring BGP as the Routing Protocol Between PE and CE Routers.

Planar graphs Algorithms and Networks. Planar graphs2 Can be drawn on the plane without crossings Plane graph: planar graph, given together with an embedding.

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.

Geographic Locality of IP Prefixes Mythili Vutukuru Joint work with Michael J. Freedman, Nick Feamster and Hari Balakrishnan Internet Measurement Conference.

A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.

Directed Graphs Directed Graphs Shortest Path 4/10/ :45 AM BOS

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.

1 A survey of Internet Topology Discovery. 2 Outline Motivations Internet topology IP Interface Level Router Level AS Level PoP Level.

On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.

Measurement in the Internet. Outline Internet topology Bandwidth estimation Tomography Workload characterization Routing dynamics.

Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.

Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932

Evaluation of the Proximity between Web Clients and their Local DNS Servers Z. Morley Mao UC Berkeley C. Cranor, M. Rabinovich,

Yao Zhao 1, Yan Chen 1, David Bindel 2 Towards Unbiased End-to-End Diagnosis 1.Lab for Internet & Security Tech, Northwestern Univ 2.EECS department, UC.

Observations from Router-level Traces Lisa Amini IBM T. J. Watson Research Center Joint with Henning Schulzrinne, Aurel Lazar Columbia University.

Network-Aware Clustering of Web Clients Advanced IP Topics Seminar, Fall 2000 Supervisor: Anat Bremler Speaker: Zotenko Elena.

Introduction to Routing and Routing Protocols By Ashar Anwar.

Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.

Issues with Inferring Internet Topological Attributes Lisa Amini ab, Anees Shaikh a, Henning Schulzrinne b a IBM T.J. Watson Research Center b Columbia.

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.

IPv6 Routing Milo Liu SW2 R&D ZyXEL Communications, Inc.

On Network-Aware Clustering of Web Clients Balachander Krishnamurthy AT&T Labs-Research, Florham Park, NJ, USA Jia Wang

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‡

TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.

1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.

© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—6-1 Scaling Service Provider Networks Scaling IGP and BGP in Service Provider Networks.

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.

Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.

Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.

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.

What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.

COMP 3270 Computer Networks

RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS

Early Measurements of a Cluster-based Architecture for P2P Systems

Lecture 26: Internet Topology CS 765: Complex Networks.

Presentation transcript:

Topology Modeling via Cluster Graphs Balachander Krishnamurthy and Jia Wang AT&T Labs Research

11/1/2001Topology Modeling via Cluster Graphs2 Internet Topology graphs Understand Internet topology Traffic patterns Protocol design Performance evaluation Two levels of granularity Inter-domain level – AS graphs Router level – router graphs

11/1/2001Topology Modeling via Cluster Graphs3 AS graphs Construction: AS-Path-based: BGP routing tables or update messages Traceroute-based Synthetic: power laws Pros and cons Coarse-grained Easy to generate Incomplete Connectivity reachability AS graphs are too coarse-grained!

11/1/2001Topology Modeling via Cluster Graphs4 Router graphs Construction Traceroute-like probing Interface collapsing algorithms Proc and cons Very fine-grained Expensive Router graphs are too fine-grained!

11/1/2001Topology Modeling via Cluster Graphs5 Network-aware clusters Obtain BGP tables from many places via a script and unify them into on big prefix table Extract IP addresses from logs Perform longest prefix matching on each IP address Classify all the IP addresses that have the same longest matched prefix into a cluster (identified by the shared prefix)

11/1/2001Topology Modeling via Cluster Graphs6 Cluster graphs Intermediate-level of granularity Undirected graph Node: cluster of routers and hosts Edge: inter-cluster connection

11/1/2001Topology Modeling via Cluster Graphs7 Cluster graphs Construction Hierarchical graphs Traceroute-based graphs Synthetic graphs Extend AS graph by modeling the size/weight of AS Use cluster-AS mapping extracted from BGP tables Traceroute to sampled IPs in interesting clusters Construct a cluster path for each sampled IP Merge cluster paths into a cluster graph Based on some observed characteristics, e.g., power laws

11/1/2001Topology Modeling via Cluster Graphs8 Super-clustering Group clusters into super-clusters based on their originating AS BGP tables: May 2001 Web log: a large portal site in March 2001 # of requests: 104M # of unique IPs: 7.6M # of clusters: 15,789 # of busy clusters (70% of the total): 3,000 # of super-clusters: 1,250 # of super-clusters with size >1: 436 Avg size of super-clusters: 2.4

11/1/2001Topology Modeling via Cluster Graphs9 Busy clusters in super-cluster Cluster prefixCommon name suffix /16wnise.com /16tmns.net.au /24telstra.com.au /14ocs.com.au /16tricksoft.com.au /16panorama.net.au /10geelong.netlink.com.au /12iaccess.com.au ASes are too coarse-grained! AS 1221

11/1/2001Topology Modeling via Cluster Graphs10 Cluster graph Top 99 busy clusters # unique IPs: 1.2M Sample 99 IPs (1 from each cluster) Traceroute to 99 sampled IPs Ignore probes returning *: 17% Ignore unreachable probes(!N, !H, !P, !X): 0.3%

11/1/2001Topology Modeling via Cluster Graphs11 Cluster path

11/1/2001Topology Modeling via Cluster Graphs12 Cluster graph vs AS graph Observations Cluster graph has 34% more nodes and 15% more edges than AS graph. The average node degree in cluster graph is 15% less than that in AS graph. Correlation between cluster hop counts and end-to-end hop counts is stronger than that of AS hop counts.

11/1/2001Topology Modeling via Cluster Graphs13 Cluster graph vs router graph Observations Constructing cluster graph needs much less traceroutes than router graph (99 vs thousands). More traceroutes show that cluster graph is more stable than router graph.

11/1/2001Topology Modeling via Cluster Graphs14 Comparison of three models ModelAS graphCluster graphRouter graph GranularityCoarseIntermediateFine Construction Stableness Accuracy

11/1/2001Topology Modeling via Cluster Graphs15 Conclusion Examine Internet topology models Cluster graph Compare three models Cluster graphs are less complicated and more stable than router graphs. Cluster graph can be obtained as easy as AS graphs while providing more fine-grained information that capture the Internet topology.