Telecom Systems Chae Y. Lee. Contents. Overview. Issues. Addressing ARP. Adapting Datagram Size Notes

Similar documents
IP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia

Lecture 9: Internetworking

CSE/EE 461 The Network Layer. Application Presentation Session Transport Network Data Link Physical

Communication Systems DHCP

Administrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging)

Ref: A. Leon Garcia and I. Widjaja, Communication Networks, 2 nd Ed. McGraw Hill, 2006 Latest update of this lecture was on

IP : Internet Protocol

CompSci 356: Computer Network Architectures. Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch & 3.2. Xiaowei Yang

CS 356: Computer Network Architectures. Lecture 10: IP Fragmentation, ARP, and ICMP. Xiaowei Yang

Position of IP and other network-layer protocols in TCP/IP protocol suite

Lecture 2: Basic routing, ARP, and basic IP

Vorlesung Kommunikationsnetze

Network layer: Overview. Network layer functions IP Routing and forwarding NAT ARP IPv6 Routing

Network layer: Overview. Network Layer Functions

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

TSIN02 - Internetworking

Internet Control Message Protocol (ICMP)

Lecture 17 Overview. Last Lecture. Wide Area Networking (2) This Lecture. Internet Protocol (1) Source: chapters 2.2, 2.3,18.4, 19.1, 9.

Internet Networking recitation #2 IP Checksum, Fragmentation

ICS 351: Networking Protocols

ICS 451: Today's plan

ECE 4450:427/527 - Computer Networks Spring 2017

EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer

ECE 461 Internetworking Fall Quiz 1

Veryx ATTEST TM. Sample Test cases Overview. Conformance Test Suite. Internet Protocol version 4 (IPv4) Part Number: T / TCLS IPv /1.

ARP, IP. Chong-Kwon Kim. Each station (or network interface) should be uniquely identified Use 6 byte long address

CSE/EE 461 Lecture 13 Connections and Fragmentation. TCP Connection Management

The Internet Protocol. IP Addresses Address Resolution Protocol: IP datagram format and forwarding: IP fragmentation and reassembly

EITF25 Internet Techniques and Applications L7: Internet. Stefan Höst

Network Layer: Internet Protocol

Your Name: Your student ID number:

Quiz. Segment structure and fields Flow control (rwnd) Timeout interval. Phases transition ssthresh setting Cwnd setting

Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access

Lecture 11: Fragmentation & Addressing. CSE 123: Computer Networks Stefan Savage

Internet Protocols (chapter 18)

Prof. Shervin Shirmohammadi SITE, University of Ottawa. Internet Protocol (IP) Lecture 2: Prof. Shervin Shirmohammadi CEG

RMIT University. Data Communication and Net-Centric Computing COSC 1111/2061. Lecture 2. Internetworking IPv4, IPv6

The Internetworking Problem. Internetworking. A Translation-based Solution

OSI Network Layer. Network Fundamentals Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1

Recap. Recap. Internetworking. First mile problem. Internet. End Users. Last mile problem. Direct link networks Packet switching.

Network Layer PREPARED BY AHMED ABDEL-RAOUF

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

Network Layer. The Network Layer. Contents Connection-Oriented and Connectionless Service. Recall:

Network Layer. Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control

Chapter 09 Network Protocols

Packet Header Formats

CS 457 Lecture 11 More IP Networking. Fall 2011

Chapter 5 OSI Network Layer

CS 3516: Advanced Computer Networks

The Internet Protocol (IP)

CSCI-1680 Network Layer: IP & Forwarding Rodrigo Fonseca

IP - The Internet Protocol

ECE4110 Internetwork Programming. Introduction and Overview

CS475 Networks Lecture 8 Chapter 3 Internetworking. Ethernet or Wi-Fi).

Internet Protocol (IP)

Aside: Interaction with Link Layer Computer Networking. Caching ARP Entries. ARP Cache Example

Introduction to Internetworking

Lecture 8. Basic Internetworking (IP) Outline. Basic Internetworking (IP) Basic Internetworking (IP) Service Model

IPv4. Christian Grothoff.

IP Protocols. ALTTC/Oct

Fixed Internetworking Protocols and Networks. IP mobility. Rune Hylsberg Jacobsen Aarhus School of Engineering

ET4254 Communications and Networking 1

Lecture 8. Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1

INTERNET SYSTEM. Internet Protocol. Kent State University Dept. of Computer Science. CS 4/55231 Internet Engineering. Large Scale Networking

ECE 158A: Lecture 7. Fall 2015

Concept Questions Demonstrate your knowledge of these concepts by answering the following questions in the space that is provided.

L10: Simple Internetworking. Hui Chen, Ph.D. Department of Engineering & Computer Science Virginia State University Petersburg, VA 23806

TSIN02 - Internetworking

Introduction to routing in the Internet

IP: Addressing, ARP, Routing

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer

Packetization Layer Path Maximum Transmission Unit Discovery (PLPMTU) For IPsec Tunnels

CSCI-1680 Network Layer: IP & Forwarding Rodrigo Fonseca

CS 457 Networking and the Internet. Problems. Mechanisms 9/21/16. Fall 2016 Indrajit Ray

Introduction to TCP/IP networking

Introduction to IPv6. IPv6 addresses

Internetwork Protocols

Internet Layers. Physical Layer. Application. Application. Transport. Transport. Network. Network. Network. Network. Link. Link. Link.

CS519: Computer Networks. Lecture 2: Feb 2, 2004 IP (Internet Protocol)

End-to-End Communication

EC441 Fall 2018 Introduction to Computer Networking Chapter4: Network Layer Data Plane

ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP

The Internet. 9.1 Introduction. The Internet is a global network that supports a variety of interpersonal and interactive multimedia applications.

IPv6 Protocols and Networks Hadassah College Spring 2018 Wireless Dr. Martin Land

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 12

Introduction to routing in the Internet

CIS 551 / TCOM 401 Computer and Network Security. Spring 2006 Lecture 16

2/22/2008. Outline Computer Networking Lecture 9 IP Protocol. Hop-by-Hop Packet Forwarding in the Internet. Internetworking.

Internetworking Terms. Internet Structure. Internet Structure. Chapter 15&16 Internetworking. Internetwork Structure & Terms

CSCI Networking Name:

Computer Network Fundamentals Spring Week 4 Network Layer Andreas Terzis

CSEP 561 Internetworking. David Wetherall

UNIT III. 3.1 Circuit switching vs. packet switching / Packet switched networks. Figure 3.1.1: Switching Techniques


Chapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview

To make a difference between logical address (IP address), which is used at the network layer, and physical address (MAC address),which is used at

COMP/ELEC 429/556 Introduction to Computer Networks

ICMP (Internet Control Message Protocol)

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

Communications Software. CSE 123b. CSE 123b. Spring Lecture 2: Internet architecture and. Internetworking. Stefan Savage

Transcription:

Internetworking

Contents Overview Functions Issues Basic Delivery Unit Addressing Datagram Delivery ARP IPv4 Header Adapting Datagram Size Notes 2

Overview - Example 3

Direct Delivery 4

Indirect Delivery 5

Internetworking: Functions Datagram delivery between networks Routers touch two or more networks, forward network-layer datagrams between them (routers use layer 3) Routers execute routing gprotocols to learn how to reach destinations 6

Internetworking: Issues Network layer provides end-to-end delivery (routing) Provides consistent datagram abstraction: Best-effort delivery No error detection on data Consistent max. datagram size Consistent global addressing scheme 7

Internetworking: Issues Link layer networks provide delivery within the same network Typically includes its own addressing format (e.g. Ethernet), and maximum frame size (MTU) Internetworking requires a consistent view of the basic delivery unit (datagram) 8

Basic Delivery Unit Address adaptation Mapping from Internet t standard d addresses (IP addresses) to link-specific addresses Datagram size adaptation Internet datagram has universal common size (64K Byte for IP) Mapping from common size to link-specific MTU requires fragmentation 10

Addressing IP addresses are topologically sensitive Interfaces on same network share prefix Prefix is assigned via ISP/net admin 32-bit globally unique IEEE 802.X addresses are vendor-specific Interfaces made by same vendor share prefix 48-bit globally unique 11

Datagram Delivery Two types of delivery: Local delivery (no router involved) Non-local delivery (router needed) Local delivery On multi-access LAN, requires MAC address! 12

Address Mapping For local delivery, need to map network-layer address to link-layer l address: Consider 128.32.15.6/24 and 128.32.15.18/24? [on same network] Encapsulate IP datagram within link-layer frame What destination i MAC address to use? 13

Address Mapping: IP to MAC Could just broadcast everything Burdens uninterested stations with others traffic IP to MAC address mapping Configured by hand [cumbersome] Dynamic [learned by system automatically] 15

Address Mapping IP to MAC: Learning Dynamic approach Each station runs Address Resolution Protocol (ARP) Client/server architecture, each station is both client and server [routers too] Cache lookups with timeouts on each resolution 16

Address Resolution Protocol (ARP) Basic protocol is address independent (at both network and dlink kl layer) Protocol is specialized for each particular network/link address pairing Common example is IPv4/Ethernet 17

ARP Operations Requesting station A has IP address I, wants the associated MAC address M A broadcasts query: who has I? tell A Machine assigned address I responds directly to A with its MAC address M A adds the (I,M) entry to its ARP cache 18

ARP Operations: Observations A cannot communicate with station using IP address I until ilit knows M ARP enables direct local delivery For indirect delivery, will need MAC address of router (also uses ARP) Isolates Internet layer from link layer ARP requires broadcast delivery 19

ARP Operations: Timers ARP Cache timeout Similar issues to bridge station caches Could be stale info if MAC address changes RFC recommends 20 minute timeout 20

ARP Operations: Frame Structure type = 0806 Common Header IPv4/Ethernet Specific

ARP: Other ARP Uses Proxy ARP One machine responds to ARP requests on behalf of others HA impersonates the MN in MIP Gratuitous ARP The proxy ARP message is not a response to a normal ARP request HA broadcasts IP and Ethernet addresses of MN 22

Internet Protocol Details (IP) IP version 4 is current, IPv6 forthcoming Protocol header includes: version, source and destination addresses, lengths (header, options, data), header checksum, fragmentation control, TTL, and TOS info Today, TOS info often ignored 23

IPv4 Header 32 bits wide vers HL TOS Fragment ID Total Length Frag Offset TTL protocol Header checksum Source Address Destination Address (options) 24

IPv4 Header - vers 32 bits wide vers HL TOS Fragment ID Total Length Frag Offset Version: 4 here 6 is for IPv6 TTL protocol Header checksum Source Address Destination Address (options) 25

IPv4 Header - HL 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address HL: # 32 bit words in IP header Min is 5 (20 bytes) Max is 15 (60 bytes) At most 40 bytes of options Destination Address (options) 26

IPv4 Header - TOS 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Destination Address TOS: type of service Abstract notion of type of service, including gpriority Most routers ignore Will be used by diffservice (options) 27

IPv4 Header - Length 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Length: # bytes in the datagram (fragment) Min value is 20 Max value is 65535 Limits max datagram size Destination Address (options) 28

IPv4 Header - Fragment ID 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Fragment ID, set by original sender of datagram Copied into each fragment during fragmentation Destination Address (options) 29

IPv4 Header Offset/Flags 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Destination Address Offset: offset of this fragment into original datagram If no fragment used, offset is zero MF bit: more fragments to come, zero if last DF bit: don t fragment (options) 30

IPv4 Header TTL 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Destination Address TTL: Time to live each router must decrement by 1 and discard if zero Also decremented if router holds for longer than 1 sec. Prevents immortal datagrams (options) 31

IPv4 Header - protocol 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address proto: protocol number identifies type of protocol contained within this datagram See assigned #s RFC [note: could indicate IP!] Destination Address (options) 32

IPv4 Header - cksum 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Destination Address cksum: Internet checksum computed over full IP header Does not cover data Must change as datagram is routed due to TTL decrement (can be done incrementally) (options) 33

IPv4 Header - Source 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source: sender s IP address Never change during ordinary routing g( (Not authenticated) Source Address Destination Address (options) 34

IPv4 Header - Destination 32 bits wide vers HL TOS Total Length Fragment ID Frag Offset TTL protocol Header checksum Source Address Destination: receiver s IP address Never changes during ordinary routing Changes when source routing is used Destination Address (options) 35

IPv4 Header - Options Special handling for particular datagrams, sometimes don t take router s last path (40bytes of Option) Rarely used, but the more common are: Loose Source Routing Strict Source Routing Record Route Timestamp Most copied on fragmentation 36

Adapting Datagram Size IP datagrams: max 64KB, Ethernet frame: max 1500 payload bytes Fragmentation and Reassembly Divide id network-layer datagram into multiple l link-layer l units, all link MTU size Reconstruct datagram at final station Each fragment otherwise acts as a complete, routable datagram 37

Adapting Datagram Size: Fragmentation Datagrams are identified by the (source, destination, identification) ifi i triple If fragmented, triple is copied into each Also contains (offset, length, more?) triple More: 1 = more fragment, 0 = last fragment Offset: relative to original datagram 38

Adapting Size: Fragmentation Example 39

Adapting Size: Fragmentation Control Relating fragmentations to original datagram provides: Tolerance to re-ordering and duplication Ability to fragment fragments When to fragment? Whenever a big datagram enters smaller MTU network: typically occurs in a router Common values for the MTU: 1460, 536, 512 bytes Can happen from originating host! 41

Adapting Size: Reassembly IP fragments are re-assembled at final destination bf before a datagram is passed up to transport layer Routers do not reassemble fragmented datagrams Allows for independent routing of fragments reduces complexity/memory in router 42

Adapting Size: Consequences Loss of one or more fragments implies loss of datagram at the IP layer IP is best effort, provides no retransmission Will time-out if fragments appear to be lost Would like to avoid fragmentation Really want to know the Path MTU (later) 43

Adapting Size: Path MTU Discovery The Path MTU is the MIN of MTUs along delivery path If datagram size < MTU, no fragmentation! How to do this? Probe network for largest size that will fit If possible, have network tell use this size (revisit this once we see ICMP) 44

Internetworking: Direct Delivery 45

Internetworking: Indirect Delivery 46

Direct Delivery - Summary Sender acquires receiver s IP address (e.g. through DNS or other mechanism) Sender determines receiver is on the same network (by comparing network prefixes) Sender performs ARP query to obtain receiver s MAC address Sender encapsulates IP packet in local frame destined for receiver s MAC address 47

Indirect Delivery - Summary Same as direct, except sender determines receiver is on different net Sender queries routing table to determine correct next hop router Encapsulates IP packet in local frame destined for router s MAC address Routers repeat this procedure 48

Internetworking: Notes Note that fragmentation may occur at any router packet is too large for next hop MTU size (even local delivery!) Standards requirements RFC 1812: Requirements for IPv4 routers RFC 1122/1123: Requirements for Internet hosts 49

Summary For local delivery, need to map network-layer address to link- layer address ARP is specialized for each particular network/link address pairing For indirect delivery, will need MAC address of router (also uses ARP) Fragmentation and Reassembly Divide network-layer datagram into multiple link-layer units, all link MTU size Reconstruct datagram at final station 50