CS 6401 Internet Protocol Outline Introduction to Internet Protocol Header and address formats ICMP Tools.

Slides:



Advertisements
Similar presentations
IPv4 - The Internet Protocol Version 4
Advertisements

Network Layer – IPv4 Dr. Sanjay P. Ahuja, Ph.D.
CSE 461: IP/ICMP and the Network Layer. Next Topic  Focus:  How do we build large networks?  Introduction to the Network layer  Internetworks  Service.
CSCI 4550/8556 Computer Networks Comer, Chapter 23: An Error Reporting Mechanism (ICMP)
Internet Control Message Protocol (ICMP)
CPSC 441 Tutorial - Network Tools 1 Network Tools CPSC 441 – Computer Communications Tutorial.
The Network Layer Chapter 5. The IP Protocol The IPv4 (Internet Protocol) header.
Chapter 5 The Network Layer.
1 Internetworking Outline Best Effort Service Model Global Addressing Scheme.
Spring 2003CS 4611 Internetworking COS 461 Spring 2003.
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
1 ELEN Lecture 13 LAN Bridges Routers, Switches, Gateways Network layer -IP Reading: 6.7,
Spring 2002CS 4611 Internetworking Outline Best Effort Service Model Global Addressing Scheme.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Internet Control Message Protocol (ICMP) Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.
Internet Command Message Protocol (ICMP) CS-431 Dick Steflik.
1 ICMP : Internet Control Message Protocol Computer Network System Sirak Kaewjamnong.
Connecting Networks © 2004 Cisco Systems, Inc. All rights reserved. Defining the IP Packet Delivery Process INTRO v2.0—4-1.
26-Aug-154/598N: Computer Networks Recap SBC UUNET Comcast Sprint End Users Internet First mile problem Last mile problem.
CCNA Introduction to Networking 5.0 Rick Graziani Cabrillo College
1 CMPT 471 Networking II ICMP © Janice Regan, 2012.
4: Network Layer4a-1 IP datagram format ver length 32 bits data (variable length, typically a TCP or UDP segment) 16-bit identifier Internet checksum time.
Petrozavodsk State University, Alex Moschevikin, 2003NET TECHNOLOGIES Internet Control Message Protocol ICMP author -- J. Postel, September The purpose.
Guide to TCP/IP, Third Edition
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Network Layer ICMP and fragmentation.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Internet Control Message Protocol (ICMP) Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.
ICMP : Internet Control Message Protocol. Introduction ICMP is often considered part of the IP layer. It communicates error messages and other conditions.
Page 19/13/2015 Chapter 8 Some conditions that must be met for host to host communication over an internetwork: a default gateway must be properly configured.
1 IP: putting it all together Part 2 G53ACC Chris Greenhalgh.
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.
1 Introduction to Computer Networks University of Ilam By: Dr. Mozafar Bag-Mohammadi Internetworking.
Fall 2010CMSC 1501 Internetworking. Fall 2010CMSC 1502 Assumptions Data pipe from every machine to every other machine. –Need not be single link (and.
A Review of Evolving Network Technology Ethernet & IP J.J. Ekstrom March 2008.
IP Forwarding.
CS 6401 Internetworking Outline Internet Architecture Best Effort Service Model.
Fall 2005Computer Networks20-1 Chapter 20. Network Layer Protocols: ARP, IPv4, ICMPv4, IPv6, and ICMPv ARP 20.2 IP 20.3 ICMP 20.4 IPv6.
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.
CSS432: Internetworking 1 CSS432 Internetworking Textbook Ch4.1 Professor: Munehiro Fukuda Augmented by Rob Nash.
Internet Protocols. Address Resolution IP Addresses are not recognized by hardware. If we know the IP address of a host, how do we find out the hardware.
Fall, 2001CS 6401 Switching, Internet Protocol Outline Quiz 2 Solution Crossbar switch design Knockout switch design Introduction to Internet Protocol.
Spring 2010CS 3321 Chapter 4: Internetworking. Spring 2010CS 3322 Assumptions Data pipe from every machine to every other machine. –Need not be single.
1 An Error Reporting Mechanism (ICMP). 2 IP Semantics IP is best-effort Datagrams can be –Lost –Delayed –Duplicated –Delivered out of order –Corrupted.
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
CSC 600 Internetworking with TCP/IP Unit 5: IP, IP Routing, and ICMP (ch. 7, ch. 8, ch. 9, ch. 10) Dr. Cheer-Sun Yang Spring 2001.
ICMPv6 Error Message Types Informational Message Types.
1 Computer Communication & Networks Lecture 19 Network Layer: IP and Address Mapping Waleed Ejaz.
1 Chapter 4: Internetworking (Internet Protocol) Dr. Rocky K. C. Chang 16 March 2004.
1 Internetworking: IP Packet Switching Reading: (except Implementation; pp )
CSS432 Basic Internetworking Textbook Ch3.2
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
1 Internetworking Outline Best Effort Service Model Global Addressing Scheme.
COMPUTER NETWORKS CS610 Lecture-32 Hammad Khalid Khan.
Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Packet Switch Network Server client IP Ether IPTCPData.
2002 년 2 학기인터넷통신망 년 2 학기. 인터넷통신망 2 Acknowledgement Some figures and texts are from: –Govindan –Kurose –Peterson & Davie –Huitema –Halabi –Retana,
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
Lecture#6:Connectivity Verification
Connectivity Verification
COMPUTER NETWORKS CS610 Lecture-33 Hammad Khalid Khan.
8 Network Layer Part V Computer Networks Tutun Juhana
Lecture#7:Connectivity Verification
Advanced Computer Networks
Internetworking Outline Best Effort Service Model
Lecture#6:Connectivity Verification
Advanced Computer Networks
ITIS 6167/8167: Network and Information Security
Internet Control Message Protocol
Fred Kuhns Applied Research Laboratory
32 bit destination IP address
Presentation transcript:

CS 6401 Internet Protocol Outline Introduction to Internet Protocol Header and address formats ICMP Tools

CS 6402 Internet Protocol Runs on all hosts in the Internet and enables packets to be routed between systems –Key protocol for building networks –Kahn-Cerf Datagram delivery of packets –Connectionless and based on routing protocols Well defined packet format Global addressing –Means for identifying Internet hosts Fragmentation and reassembly –Since packets can be of varying size Error reporting

CS 6403 An IP Internet – Network of Networks R2 R1 H4 H5 H3H2H1 Network 1 (Ethernet) H6 Network 3 (FDDI) Network 4 (point-to-point) H7R3H8 Network 2 (Ethernet)

CS 6404 Protocol Stack – IP is Common to All R1 ETH FDDI IP ETH TCP R2 FDDI PPP IP R3 PPP ETH IP H1 IP ETH TCP H8

CS 6405 Service Model Connectionless (datagram-based) Best-effort delivery (unreliable service) –packets are lost –packets are delivered out of order –duplicate copies of a packet are delivered –packets can be delayed for a long time Datagram format VersionHLen TOSLength IdentFlagsOffset TTLProtocolChecksum SourceAddr DestinationAddr Options (variable) Pad (variable) Data

CS 6406 IPv4 Header Format VersionHLen TOSLength IdentFlagsOffset TTLProtocolChecksum SourceAddr DestinationAddr Options (variable) Pad (variable) Data

CS 6407 Fragmentation and Reassembly Each network has some Maximum Transmission Unit (MTU) –Largest datagram that a network can carry in a frame Strategy –fragment when necessary (MTU < Datagram) –try to avoid fragmentation at source host Due to overhead of reassembly –re-fragmentation is possible –fragments are self-contained datagrams –delay reassembly until destination host Keep this functionality out of the network –do not recover from lost fragments End hosts try to reassemble fragmented packets –if a fragment is lost… End hosts are encouraged to do MTU discovery

CS 6408 Example

CS 6409 Ident = xOffset = 0 Start of header 0 Rest of header 1400 data bytes Ident = xOffset = 0 Start of header 1 Rest of header 512 data bytes Ident = xOffset = 512 Start of header 1 Rest of header 512 data bytes Ident = xOffset = 1024 Start of header 0 Rest of header 376 data bytes

CS IPv4 Global Addresses Properties –globally unique –hierarchical: network + host Dot Notation – – – AS’s refer to a network type (assigned address range) NetworkHost A: NetworkHost B: NetworkHost C:

CS Datagram Forwarding Every datagram contains destination’s address The “network part” of an IP address uniquely identifies a single physical network (AS) If directly connected to destination network, then forward to host If not directly connected to destination network, then forward to some router Forwarding table maps network number into next hop –Mapping is based on routing algorithm Each host has a default router Each router maintains a forwarding table

CS Internet Control Message Protocol (ICMP) Echo (ping) Redirect (from router to source host) Destination unreachable (protocol, port, or host) TTL exceeded (so datagrams don’t cycle forever) Checksum failed Reassembly failed Cannot fragment

CS ICMP Uses IP but is a separate protocol in the network layer ICMP HEADER IP HEADER PROTOCOL = 1 TYPE CODE CHECKSUM REMAINDER OF ICMP MESSAGE (FORMAT IS TYPE SPECIFIC) IP HEADER IP DATA

CS Echo and Echo Reply TYPE CODE CHECKSUM IDENTIFIER SEQUENCE # DATA …. TYPE: 8 = ECHO, 0 = ECHO REPLY CODE; CODE = 0 IDENTIFIER An identifier to aid in matching echoes and replies SEQUENCE # Same use as for IDENTIFIER UNIX “ping” uses echo/echo reply

CS Ping Example C:\WINDOWS\Desktop>ping Pinging asari.soi.wide.ad.jp [ ] with 32 bytes of data: Reply from : bytes=32 time=253ms TTL=240 Reply from : bytes=32 time=231ms TTL=240 Reply from : bytes=32 time=225ms TTL=240 Reply from : bytes=32 time=214ms TTL=240 Ping statistics for : Packets: Sent = 4, Received = 4, Lost = 0 (0% loss), Approximate round trip times in milli-seconds: Minimum = 214ms, Maximum = 253ms, Average = 230ms

CS Redirect when no route to Destination TYPE CODE CHECKSUM NEW ROUTER ADDRESS IP HEADER + 64 bits data from original DG TYPE = 5 CODE = 0 = Network redirect 1 = Host redirect 2 = Network redirect for specific TOS 3 = Host redirect for specific TOS

CS Destination Unreachable TYPE CODE CHECKSUM UNUSED IP HEADER + 64 bits data from original DG TYPE = 3 CODE 0 = Net unreachable 1 = Host unreachable 2= Protocol unreachable 3 = Port unreachable 4 = Fragmentation needed but DF set 5 = Source route failed

CS Time Exceeded TYPE CODE CHECKSUM UNUSED IP HEADER + 64 bits data from original DG TYPE = 11 CODE 0 = Time to live exceeded in transit 1 = Fragment reassembly time exceeded

CS Source Quench TYPE CODE CHECKSUM UNUSED IP HEADER + 64 bits data from original DG TYPE = 4; CODE = 0 Indicates that a router has dropped the original DG or may indicate that a router is approaching its capacity limit. Correct behavior for source host is not defined.

CS Traceroute UNIX utility - displays router used to get to a specified Internet Host Operation –router sends ICMP Time Exceeded message to source if TTL is decremented to 0 –if TTL starts at 5, source host will receive Time Exceeded message from router that is 5 hopes away Traceroute sends a series of probes with different TTL values… and records the source address of the ICMP Time Exceeded message for each Probes are formatted to that the destination host will send an ICMP Port Unreachable message

CS TraceRoute Example C:\windows\desktop> tracert Tracing route to asari.soi.wide.ad.jp [ ] over a maximum of 30 hops: 1 19 ms 27 ms 23 ms ms 13 ms 14 ms ms 29 ms 29 ms aar1-serial Minneapolismpn.cw.net [ ] 4 24 ms 27 ms 24 ms acr1.Minneapolismpn.cw.net [ ] 5 26 ms 22 ms 23 ms acr2-loopback.Chicagochd.cw.net [ ] 6 29 ms 29 ms 27 ms cand-w-private-peering.Chicagochd.cw.net [ ] 7 28 ms 24 ms 28 ms 0.so XL2.CHI2.ALTER.NET [ ] 8 26 ms 27 ms 28 ms 0.so XR2.CHI2.ALTER.NET [ ] 9 25 ms 24 ms 26 ms 292.at TR2.CHI4.ALTER.NET [ ] ms 74 ms 73 ms 106.ATM7-0.TR2.LAX2.ALTER.NET [ ] ms 76 ms 76 ms 198.ATM7-0.XR2.LAX4.ALTER.NET [ ] ms 75 ms 77 ms 192.ATM5-0.GW9.LAX4.ALTER.NET [ ] ms 73 ms 76 ms kdd-gw.customer.ALTER.NET [ ] ms 84 ms 91 ms ms 81 ms 86 ms cisco1-eth-2-0.LosAngeles.wide.ad.jp [ ] ms 174 ms 178 ms cisco5.otemachi.wide.ad.jp [ ] ms 196 ms 194 ms cisco2.otemachi.wide.ad.jp [ ] ms 182 ms 196 ms foundry2.otemachi.wide.ad.jp [ ] ms 185 ms 178 ms gsr1.fujisawa.wide.ad.jp [ ] ms 205 ms 201 ms asari.soi.wide.ad.jp [ ] Trace complete.