Sebastian Castro CAIDA NIC Chile DNS Operations Workshop – July, 2007 DNS load visualization.

Slides:



Advertisements
Similar presentations
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Computer Networks21-1 Chapter 21. Network Layer: Address Mapping, Error Reporting, and Multicasting 21.1 Address Mapping 21.2 ICMP 21.3 IGMP 21.4 ICMPv6.
1 Internet Protocol Version 6 (IPv6) What the caterpillar calls the end of the world, nature calls a butterfly. - Anonymous.
21.1 Chapter 21 Network Layer: Address Mapping, Error Reporting, and Multicasting Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Geometry of large networks (computer science perspective) Dmitri Krioukov (CAIDA/UCSD) AIM, November 2011.
Copyright 2009 Kenneth M. Chipps Ph.D. Host Addressing Last Update
June 2007APTLD Meeting/Dubai ANYCAST Alireza Saleh.ir ccTLD
GIS: The Grand Unifying Technology. Introduction to GIS  What is GIS?  Why GIS?  Contributing Disciplines  Applications of GIS  GIS functions  Information.
An Engineering Approach to Computer Networking
Dot – id root server Specification and Criteria For members of root server © NICE (National Internet Cadet Empowering)
CSE331: Introduction to Networks and Security Lecture 9 Fall 2002.
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 4: More Routing, DNS True or False? T F  Path-vector based distance vector.
Wireless Sensor Network for Tracking the Traffic in INTERNET Network Routers Part 2 Supervisor:Mark Shifrin Students:Yuri Kipnis Nir Bar-Or Date:30 September.
Routing.
Best Practices in IPv4 Anycast Routing Version 0.9 August, 2002 Bill Woodcock Packet Clearing House.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Graph Visualization Tools NAM, Javis, Otter, H3Viewer Burton Filstrup.
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.
1 Distributed DNS best practices to build redundant, reliable architecture By Ladislav Vobr SE/SOP/I&eS, Etisalat.
{ Content Distribution Networks ECE544 Dhananjay Makwana Principal Software Engineer, Semandex Networks 5/2/14ECE544.
Towards Highly Reliable Enterprise Network Services via Inference of Multi-level Dependencies Paramvir Bahl, Ranveer Chandra, Albert Greenberg, Srikanth.
Introduction to Routing and Routing Protocols By Ashar Anwar.
Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
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.
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
Issues with Inferring Internet Topological Attributes Lisa Amini ab, Anees Shaikh a, Henning Schulzrinne b a IBM T.J. Watson Research Center b Columbia.
FlowScan at the University of Wisconsin Perry Brunelli, Network Services.
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.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Vytautas Valancius, Nick Feamster, Akihiro Nakao, and Jennifer Rexford.
Network Measurement Tools ESnet Site Coordinators Meeting 26 April 2000 Tracie Monk, UCSD/SDSC/CAIDA -
Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency The.
Bradley Cowie Supervised by Barry Irwin Security and Networks Research Group Department of Computer Science Rhodes University DATA CLASSIFICATION FOR CLASSIFIER.
Core VoIP and 911 issues and alternatives Henning Schulzrinne Columbia University August 2003.
Introduction An introduction to the equipment and organization of the Internet Lab.
The Geography of the Third Great Compromise. The year is The Constitution has been adopted. The country survived as a union because of two great.
Lecture 17 Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
1 ipv6-node-02.PPT/ 18 November 2002 / John Loughney IETF 55 IPv6 Working Group IPv6 Node Requirements draft-ietf-ipv6-node-requirements-02.txt John Loughney.
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
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.
Chapter 11 – Cloud Application Development. Contents Motivation. Connecting clients to instances through firewalls. Cloud Computing: Theory and Practice.
Chapter 4: server services. The Complete Guide to Linux System Administration2 Objectives Configure network interfaces using command- line and graphical.
Presented by: Shahab Spring Introduction Data Analytics Plugins Learning Resources.
IPv6: Deployment Plan SPRING Rogers User Cases Prepared by: Ida Leung Network Strategy and Technology Development Version: v1.
www.visualland.net1 RIP Split Horizon RIP tutorial with pictures Watch animation to learn networking.
Interaction and Animation on Geolocalization Based Network Topology by Engin Arslan.
1 Distributed DNS best practices to build redundant, reliable & scalable DNS architecture By Ladislav Vobr SE/SOP/I&eS Etisalat, UAE.
Introduction An introduction to the software and organization of the Internet Lab.
TCP/IP Utilities Richard Goldman May 29, 2003.
Mapa de Topología usando sondas RIPE Atlas
Routing Jennifer Rexford.
Network Tools and Utilities
Access Maintaining and Querying a Database
RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing.
Introduction An introduction to the software and organization of the Internet Lab.
(How the routers’ tables are filled in)
Internet Control Message Protocol Version 4 (ICMPv4)
Development & Evaluation of Network Test-beds
DriveScale Log Collection Method of Procedure
BGP Issues BGP is a reachability protocol ISP issues
Visualization of Temporal Difference of BGP Routing Information
Layering Features on a Map
An Engineering Approach to Computer Networking
Routing.
Presentation transcript:

Sebastian Castro CAIDA NIC Chile DNS Operations Workshop – July, 2007 DNS load visualization

2 Introduction Any DNS operator, specially those running an anycast infrastructure, need to know if the load is well balanced between the nodes and which would be a right place to put a new node. The first question could be answered comparing simple query load graphs, but the second requires some work. The following visualizations are intended to help to answer that question. –Topological map –Geographic map –Geographic animated map

3 Query load per topological origin Anycast is based on routing protocols (mainly BGP). The selection of the placement for a new node should be ruled by the origin of the queries received, either by country or by AS. There is no strict correlation between geography and AS topology –One AS could span over several countries.

4 Query load per topological origin Methodology –Using a 6-hour packet trace from every node in the.CL anycast cloud and the BGP tables available on those nodes, we counted the number of queries from each origin AS. –The map shows AS relations, number of queries originated from those AS and their relation with the AS holding the anycast node. –In some cases, there are too many origin AS to fit into the plot. In those cases, only the set of AS representing at least 70% of the total query load are plotted.

5 Query load per topological origin

6

7 Future Work –Node rearrangement based on geography The chilean AS in one side, the rest of the world on the other –Include the flow of queries (origin AS to specific node) –Use the anycast nodes as the center of the graph. –Classify each AS using the categories. –Provide better metric on the map (RTT)

8 Geographic map There are several tools to represent the query load aggregated by “geography” –Like “root servers influence map” by Bradley Huffaker from CAIDA This visualization provides a different angle. –Each country is colored by the number of queries originated from there. –It is a vector-based format (not raster). Does not loose resolution when zoomed-in.

9 Geographic map Methodoly –The same 6-hour packet trace used on “topology map” –Aggregate the query count by IP address –Map IP to country using NetAcuity –Aggregate by country –Give it to the code and plot it! –Uses linear scale

10 Geographic map

11 Geographic animated map The next step was prepare an animation showing the evolution of the traffic along the day. –Idea inspired by cuttlefish tool from CAIDA Methodology –One hour traces using dnscap (v1.0 RC4) –Generate aggregated traffic by source address using CoralReef (CAIDA tool, version 3.7.5) –Map address to geography using NetAcuity –Aggregate the query load by country –Plot the aggregated data using the home-grown tool. One image per trace –Convert the image from vector to raster –Merge each image into an animation

12 Geographic animated map Snapshot of the animated map

13 Geographic animated map Future work –Receive comments and suggestion –Pack the tool –Improve documentation –Release it to the public