PALMTREE M. Engin TozalKamil Sarac The University of Texas at Dallas.

Slides:



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

1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
IP Forwarding Relates to Lab 3.
Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
1 Internet Protocol Version 6 (IPv6) What the caterpillar calls the end of the world, nature calls a butterfly. - Anonymous.
CSCI 4550/8556 Computer Networks Comer, Chapter 23: An Error Reporting Mechanism (ICMP)
Week 5: Internet Protocol Continue to discuss Ethernet and ARP –MTU –Ethernet and ARP packet format IP: Internet Protocol –Datagram format –IPv4 addressing.
Detecting Traffic Differentiation in Backbone ISPs with NetPolice Ying Zhang Zhuoqing Morley Mao Ming Zhang.
Internet Topology Mapping
MCDST : Supporting Users and Troubleshooting a Microsoft Windows XP Operating System Chapter 13: Troubleshoot TCP/IP.
A supernetwork.
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.
1 Internet Networking Spring 2004 Tutorial 7 Multicast Routing Protocols.
Chapter 5 The Network Layer.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
CSCI 4550/8556 Computer Networks Comer, Chapter 20: IP Datagrams and Datagram Forwarding.
Internet Networking Spring 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.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
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.
Route Selection in Cisco Routers. Route Selection One of the intriguing aspects of Cisco routers, especially for those new to routing, is how the router.
© 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.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
TRACENET M.Engin TozalKamil Sarac The University of Texas at Dallas.
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.
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Routing and Routing Protocols Routing Protocols Overview.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 6 Routing and Routing Protocols.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
10/8/2015CST Computer Networks1 IP Routing CST 415.
10/13/2015© 2008 Raymond P. Jefferis IIILect 07 1 Internet Protocol.
© 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.
TCOM 515 IP Routing. Syllabus Objectives IP header IP addresses, classes and subnetting Routing tables Routing decisions Directly connected routes Static.
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
Chelebi: Subnet-level Internet Mapper Mehmet H. Gunes University of Nevada, Reno.
Network Layer4-1 Datagram networks r no call setup at network layer r routers: no state about end-to-end connections m no network-level concept of “connection”
Routing and Routing Protocols
MIF Current Practices draft-mrw-mif-current-practices-01.txt Margaret Wasserman
Ethernet switch Hosts Can talk using Ethernet addresses only.
 RIP — A distance vector interior routing protocol  IGRP — The Cisco distance vector interior routing protocol (not used nowadays)  OSPF — A link-state.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
ROUTING.
Network Tools and Utilities
Routing and Routing Protocols: Routing Static
Forwarding and Routing IP Packets
COMP 3270 Computer Networks
IP Forwarding Covers the principles of end-to-end datagram delivery in IP networks.
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
RESOLVING IP ALIASES USING DISTRIBUTED SYSTEMS
IP Forwarding Relates to Lab 3.
Unit 7 Advanced IP Routing Chapter 19 to 21
Chapter 3: Dynamic Routing
Routing and Routing Protocols: Routing Static
Measured Impact of Crooked Traceroute
Internetworking Outline Best Effort Service Model
IP Forwarding Relates to Lab 3.
Delivery, Forwarding, and Routing of IP Packets
IP Forwarding Relates to Lab 3.
Lecture 26: Internet Topology CS 765: Complex Networks.
Networking and Network Protocols (Part2)
COMPUTER NETWORKS CS610 Lecture-29 Hammad Khalid Khan.
IP Forwarding Relates to Lab 3.
Figure 6.11 Configuration for Example 4
Figure 6.6 Default routing
Presentation transcript:

PALMTREE M. Engin TozalKamil Sarac The University of Texas at Dallas

PalmTree  IP Alias Resolution problem could be defined in two different forms:  Given two IP addresses identifying whether they are hosted by the same router or not  Given a set of IP addresses grouping all IP addresses belonging to the same router  A solution to one of the definitions could be employed in the other  Palm Tree, given a set of IP addresses, attempts to group IP addresses accommodated by the same router

PalmTree  Related Work  Mercator (probe based source IP address IP alias resolver)  Ally (probe based IP Identifier IP alias resolver)  Radargun (velocity modeling based ally improvement) V

PalmTree  Related Work  APAR/KAPAR (inference based IP alias resolver)  Discarte (hybrid record-route option leveraging IP alias resolver) V1V1 V2V2 R1R1 R2R2 R3R3 R4R4

PalmTree V V R1R1 R2R2 R3R3 R1R1 hop h S AQ TTL=hDQ TTL=255RPY TTL=… Assume a set of IP addresses are fed to palm tree and at the moment is the one being processed Assume R1 reports the probed interface if it hosts probe destination Assume R1 returns the incoming interface if it does not host the probe destination

PalmTree  Definitions  Routers and subnets are represented as sets of interfaces e.g.  An interface has an associated IP address denoted by this value is set to in case is anonymous  An interface is obtained by direct or indirect probing from a particular vantage point  denotes the hop distance to from  and denote mate 31 and mate 30 of respectively  Let be alias relationship, implies and are hosted by the same router  is a symmetric and transitive relation

PalmTree  Definitions  Direct Probing  Indirect Probing  Router Response Configuration (RRC) Nil Interface Router Probed Interface Router Incoming Interface Router Shortest Path Interface Router Default Interface Router Usually responsive routers are configured as “probed interface routers” for direct probes Routers cannot be configured as “probed interface router” for indirect probes RRC may vary with respect to the probing protocol

PalmTree  Observations  Hierarchical Addressing (RFC 4632) states that any two IP addresses on the same subnet shares a common bits prefix  Fixed Ingress Router states that as long as there is no path fluctuations, packets destined to different interfaces of a subnet are delivered through the same ingress router  Unit Subnet Diameter implies  Mate-31 Adjacency implies given that and are in use and mate-31 of each other than

PalmTree V1V1 R1R1 R4R4 R2R2 R3R3 R5R5 R6R6

 We have two issues to address  A concept called frontier interface resolution  Path fluctuations

PalmTree  Path Fluctuations  Routing updates, load balancing enabled routers  Distance and Alias probes use different ingress router  Asymmetric diamonds  Increasing confidence level by repeating alias query

PalmTree  Variations in Implementation  ICMP based distance querying  Source based alias resolution  Embedding into traceroute/traceNET  Probing Complexity  Distance Query, on the average q  Alias Query, single probe  Confidence level k  Frontier Interface Resolution 1/m of whole at each vantage point

PalmTree  PalmTree over Internet2 from three vantage points

PalmTree  Palm Tree Validation with Mercator from Single Vantage Point  Mercator is a 100% correct IP alias resolver  We built a target IP address set T consisting of distinct IP addresses distributed over four commercial ISPs  We collected a set M IP alias pairs over four different commercial ISPs with mercator  We ran Palmtree with disabling source based alias resolution feature on the same target set T and built set P of alias pairs.  Distance Query method of PalmTree was UDP for this experiment |M|=13188 |P|=16958 |P Ո M|=12110 which is 92% |P\M|=4848 |M\P|=1078 (frontier interfaces for PalmTree)

PalmTree  PalmTree Validation with Ally  Ally response categorization Unknown; Source Verified; IP-ID Verified; Unverified

PalmTree PalmTree with UDP Distance ProbingPalmTree with ICMP Distance Probing

PalmTree  Conclusions  PalmTree is a novel probe based IP alias resolver  PalmTree complements existing approaches  PlamTree has linear probing complexity  PlamTree does not require pre-collected traceroute paths

PalmTree  Questions

PalmTree