RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS

Slides:



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

RIP V1 W.lilakiatsakun.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
CSCI 4550/8556 Computer Networks Comer, Chapter 23: An Error Reporting Mechanism (ICMP)
Internet Topology Mapping
Internet Control Message Protocol (ICMP)
The Network Layer Chapter 5. The IP Protocol The IPv4 (Internet Protocol) header.
1 A survey of Internet Topology Discovery. 2 Outline Motivations Internet topology IP Interface Level Router Level AS Level PoP Level.
EEC-484/584 Computer Networks Lecture 10 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CSE331: Introduction to Networks and Security Lecture 9 Fall 2002.
Heuristics for Internet Map Discovery R. Govindan, H. Tangmunarunkit Presented by Zach Schneirov.
Measuring ISP topologies with Rocketfuel Ratul Mahajan Neil Spring David Wetherall University of Washington ACM SIGCOMM 2002.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 ICMP – Using Ping and Trace CCNA Semester
PALMTREE M. Engin TozalKamil Sarac The University of Texas at Dallas.
Computer Networks Layering and Routing Dina Katabi
INTERNET TOPOLOGY MAPPING INTERNET MAPPING PROBING OVERHEAD MINIMIZATION  Intra- and inter-monitor redundancy reduction IBRAHIM ETHEM COSKUN University.
Internet Control Message Protocol ICMP. ICMP has two major purposes: –To report erroneous conditions –To diagnose network problems ICMP has two major.
IP (Internet Protocol) –the network level protocol in the Internet. –Philosophy – minimum functionality in IP, smartness at the end system. –What does.
Internet Control Message Protocol (ICMP). Objective l IP and ICMP l Why need ICMP? l ICMP Message Format l ICMP fields l Examples: »Ping »Traceroute.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
TCOM 515 IP Routing. Syllabus Objectives IP header IP addresses, classes and subnetting Routing tables Routing decisions Directly connected routes Static.
1 Internet Control Message Protocol (ICMP) Used to send error and control messages. It is a necessary part of the TCP/IP suite. It is above the IP module.
CS4550 Computer Networks II IP : internet protocol, part 2 : packet formats, routing, routing tables, ICMP read feit chapter 6.
IPv6 Routing Milo Liu SW2 R&D ZyXEL Communications, Inc.
Chelebi: Subnet-level Internet Mapper Mehmet H. Gunes University of Nevada, Reno.
Lecture 14 Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency.
1 An Error Reporting Mechanism (ICMP). 2 IP Semantics IP is best-effort Datagrams can be –Lost –Delayed –Duplicated –Delivered out of order –Corrupted.
Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency The.
Lecture 14: Internet Measurement CS 765: Complex Networks.
Lecture 17 Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
1 Connectivity with ARP and RARP. 2 There needs to be a mapping between the layer 2 and layer 3 addresses (i.e. IP to Ethernet). Mapping should be dynamic.
Internet Measurements. 2 Web of interconnected networks Grows with no central authority Autonomous Systems optimize local communication efficiency The.
COMPUTER NETWORKS CS610 Lecture-32 Hammad Khalid Khan.
Introduction to OSPF Campus Networking Workshop These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license.
4: Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Homework 4 Out: Fri 2/24/2017 In: Fri 3/10/2017.
ROUTING.
Chapter 4: Network Layer
Introduction to Dynamic Routing Protocol
Dynamic Routing Protocols II OSPF
Whirlwind Tour Of Lectures So Far
Avoiding traceroute anomalies with Paris Traceroute
Network Tools and Utilities
Routing BY, P.B.SHANMATHI.
Comparative Analysis of Internet Topology Data Sets
Homework 4 Out: Fri 2/26/2016 In: Fri 3/11/2016.
Routing Information Protocol (RIP)
COMPUTER NETWORKS CS610 Lecture-33 Hammad Khalid Khan.
Chapter 4: Network Layer
COMP 3270 Computer Networks
CS4470 Computer Networking Protocols
ICMP – Using Ping and Trace
Byungchul Park ICMP & ICMPv DPNM Lab. Byungchul Park
Net 323: NETWORK Protocols
Routing.
ICMP – Using Ping and Trace
Measured Impact of Crooked Traceroute
Dynamic Routing Protocols II OSPF
EEC-484/584 Computer Networks
Resolving IP Aliases using Distributed Systems
Chapter 4: Network Layer
COMP/ELEC 429/556 Introduction to Computer Networks
Lecture 26: Internet Topology CS 765: Complex Networks.
COMPUTER NETWORKS CS610 Lecture-29 Hammad Khalid Khan.
Chapter 4: Network Layer
Routing.
Review of Internet Protocols Network Layer
Presentation transcript:

RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS

Internet Topology Mapping Challenges Related Works Intended Works PRESENTATION CONTENT Introduction Internet Topology Mapping Challenges Related Works Intended Works Conclusion

WHY MAPPING THE INTERNET? INTRODUCTION WHY MAPPING THE INTERNET? Studying the Internet Detecting problems Studying virus spread

HOW IS INTERNET MEASURED Traceroute Time To Live (TTL) IPA IPB IPC IPD Vantage Point Destination TTL=4 TTL=3 TTL=1 TTL=2 A B C D S

TRACEROUTES Archipelago (Ark) RIPE MLAB IPlane

CHALLENGES

CHALLENGES Load Balancing Unresponsive Routers IP Aliases NAT Boxes

Per destination Per packet Random Paris traceroute Y D A B C LOAD BALANCING Per destination Per packet Random Paris traceroute Y: “time exceeded” Dest = D TTL = 2 Y D A B: “time exceeded” Dest = D TTL = 1 B C

UNRESPONSIVE ROUTERS

Routers have multiple interfaces Each interface has its own IP address IP ALIASES Routers have multiple interfaces Each interface has its own IP address

Multiple routers can use one IP address IPv4 running out NAT BOXES Multiple routers can use one IP address IPv4 running out Internal Policies

RELATED WORKS

RELATED WORKS Iffinder & Mercator Ally RadarGun Midar APAR Kapar

IFFINDER AND MERCATOR Fingerprint method Sending UDP packets to unused port number of routers Receive ICMP PORT UNREACHABLE message from routers Messages contain IP address of the source (router) Does the probing address match the address in the message?

ALLY Another fingerprint method Uses IP IDs (16-bit number stored in the IP ID field in IP header) of routers Sends messages to two or more alias candidates Inspects the response messages Problems (false negatives) Sometimes routers don’t send messages back Some routers increment IP ID’s very fast Some routers don't increment IP ID’s Some routers use different IP IDs for different interfaces O(n^2)

RADARGUN 30 probes in time limits for each IP, O(n) Saves timestamps and IP ID values of response and inspects them Ignore if receive response from less than 25% of the 30 probes all IP IDs of particular router is either zero or the same value time series is nonlinear (counter advancing too quickly or generates random values) If two addresses share an IP ID counter, then their time series should have nearby IP ID values when overlapping in time

MIDAR Same ignoring conditions with RadarGun MONOTONIC ID-BASED ALIAS RESOLUTION MIDAR Same ignoring conditions with RadarGun Threshold higher than RadarGun Monotonic Bounds Test MBT checks that two time series A and B meet the monotonicity requirement by individually checking that each sample of B meets the monotonicity requirement with respect to the samples of A, and vice versa

APAR Analytical alias resolution ANALYTICAL AND PROBE-BASED ALIAS RESOLVER APAR Analytical alias resolution Analyzing IP addresses in traces to identify candidate subnets Resolving IP aliases depending on the subnets inferred

Nodes in the same subnet should appear one hop away from each other APAR CONTINUED Rules Accuracy Nodes in the same subnet should appear one hop away from each other Completeness Ignore candidate subnets with less than half of IPs found Processing Order Processing priority is given to subnets with more path traces No loops Common Neighbors Distance (candidate aliases should be at same distance from vantage points)

Trace ( h1:h4 ) - a b q m g Trace ( h2:h1 ) - c d o a Trace ( h3:h1 ) - e f k o a

KAPAR Optimized version of APAR Avoided storing the complete set of paths in memory Identifies /24 or bigger subnets in the same traces that cannot exist Gives unique ID to each trace, stores list of all IPs in the traces Works with sets of aliases obtained from other sources (results of fingerprints) Uses stricter subnet formation (does probes for IPs not found in AS) Uses stricter common neighbor condition

INTENTION

PRELIMINARIES AS (Autonomous Systems) Within the Internet, an autonomous system (AS) is a collection of connected Internet Protocol (IP) routing prefixes under the control of one or more network operators on behalf of a single administrative entity or domain that presents a common, clearly defined routing policy to the Internet (Border Gateway Protocol) BGP Announcements

INTENTION Parse IPs in traces files Detect which ASes they belong according to BGP announcement Collect and separate all traces that belong to the same ASes Create files for each ASes that store traces belonging to that particular AS (more than 50,000 files) Distribute all AS files among cluster nodes Process each AS file independently Use best IP Alias Resolution technique that fits our case

TECHNOLOGIES INTENDED TO BE USED HIGHLY AVAILABLE, SCALABLE DISTRIBUTED SYSTEMS TECHNOLOGIES INTENDED TO BE USED

WHAT WE TALKED ABOUT CONCLUSION

MAPPING INTERNET Why mapping is important What challenges are there What has been done What we intend to do