IP Routing Table (Linux) eth0 eth0 UG UG 0.0.0.0 0.0.0.0144.16.64.1 lo lo U 255.0.0.0 255.0.0.0 0.0.0.0 0.0.0.0 127.0.0.0 127.0.0.0 eth0 eth0 U255.255.224.0.

Slides:



Advertisements
Similar presentations
1 Address Resolution Protocol (ARP) Relates to Lab 2. This module is about the address resolution protocol.
Advertisements

ECE 4110 – Internetwork Programming TCP/IP Protocol (cont’d)
PART III DATA LINK LAYER. Position of the Data-Link Layer.
Oct 21, 2004CS573: Network Protocols and Standards1 IP: Addressing, ARP, Routing Network Protocols and Standards Autumn
The Data Link Layer Chapter 3. Position of the data-link layer.
Overview of TCP/IP Protocols
Network Concepts. Networks LAN WAN Main Concepts n Protocol n Media n Topology.
1 K. Salah Module 4.0: Data Link Layer The Logical Link Control (LLC) sublayer –Framing –Flow Control –Error Control The Media Access Control (MAC) sublayer.
Chapter 3 Review of Protocols And Packet Formats
Address Resolution Protocol (ARP). Mapping IP Address to Data-Link Address  How does a machine map an IP address to its Data- Link layer (hardware or.
IP Address 0 network host 10 network host 110 networkhost 1110 multicast address A B C D class to to
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Ethernet, ARP.
CMPT 471 Networking II Address Resolution IPv6 Neighbor Discovery 1© Janice Regan, 2012.
TELE202 Lecture 10 Internet Protocols (2) 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Internet Protocols (1) »Source: chapter 15 ¥This Lecture »Internet.
G64INC Introduction to Network Communications Ho Sooi Hock Internet Protocol.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 03_a
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
IP Forwarding.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Ethernet Introduction to Networks.
CMPT 471 Networking II Address Resolution IPv4 ARP RARP 1© Janice Regan, 2012.
1 Layer 2: Concepts Honolulu Community College Cisco Academy Training Center Semester 1 Version
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.
Suez Canal University – Faculty of Computers & Informatics - Cisco Local Academy Network Fundamentals.
Lecture 3 Overview. Protocol An agreed upon convention for communication both endpoints need to understand the protocol. Protocols must be formally defined.
ECE 526 – Network Processing Systems Design Networking: protocols and packet format Chapter 3: D. E. Comer Fall 2008.
1 Data Link Layer Lecture 20 Imran Ahmed University of Management & Technology.
Hyung-Min Lee ©Networking Lab., 2001 Chapter 8 ARP and RARP.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 14.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Data Link Layer Moving Frames. Link Layer Protocols: ethernet, wireless, Token Ring and PPP Has node-to-node job of moving network layer.
4: DataLink Layer1 Chapter 4: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing.
BAI513 - PROTOCOLS ARP BAIST – Network Management.
Lecture 4 Overview. Ethernet Data Link Layer protocol Ethernet (IEEE 802.3) is widely used Supported by a variety of physical layer implementations Multi-access.
1 Kyung Hee University Chapter 8 ARP(Address Resolution Protocol)
OV Copyright © 2013 Logical Operations, Inc. All rights reserved. TCP/IP Addressing and Data Delivery  The TCP/IP Protocol Suite  IP Addressing.
Ethernet switch Hosts Can talk using Ethernet addresses only.
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.
© Jörg Liebeherr (modified by M. Veeraraghavan) 1 Point-to-Point Protocol Data Link Layer Loopback ARP and RARP.
Network Layer4-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing.
Data Link Layer. Link Layer The data unit to be transmited at the link layer is called a frame. Why link layer? How can it know where a frame begins and.
ADDRESS MAPPING ADDRESS MAPPING The delivery of a packet to a host or a router requires two levels of addressing: logical and physical. We need to be able.
Packet Switch Network Server client IP Ether IPTCPData.
1 K. Salah Module 5.1: Internet Protocol TCP/IP Suite IP Addressing ARP RARP DHCP.
RARP : Reverse Address Resolution Protocol
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Introduction to Networks v6.0
IP: Addressing, ARP, Routing
Instructor Materials Chapter 5: Ethernet
Data Link Layer.
Part III. Data Link Layer
Scaling the Network: The Internet Protocol
Chapter 8 ARP(Address Resolution Protocol)
Data link layer (LLC).
MAC Addresses and ARP 32-bit IP address:
ARP and RARP Objectives Chapter 7 Upon completion you will be able to:
CS 5565 Network Architecture and Protocols
Chap. 4 Data link layer 2.
Data Link Layer What does it do?
Net 323: NETWORK Protocols
IP Forwarding Relates to Lab 3.
Guide to TCP/IP, Third Edition
CPEG512 Advanced Computer Networks
IP Forwarding Relates to Lab 3.
Scaling the Network: The Internet Protocol
Introduction to Networks
Ch 17 - Binding Protocol Addresses
Data Link Layer: Overview; Error Detection
Data Link Layer. Position of the data-link layer.
Presentation transcript:

IP Routing Table (Linux) eth0 eth0 UG UG lo lo U eth0 eth0 U Intfc Intfc Flags Flags Genmask Genmask Gateway Gateway Dest Dest The routing table mask

IP Routing Tables In Linux, a Gateway entry of indicates that the destination is directly connected In Linux, a Gateway entry of indicates that the destination is directly connected Also, a Genmask of and a destination of indicate a default entry Also, a Genmask of and a destination of indicate a default entry –Any “dest addr” & = –So any dest addr matches this entry –Hence “default entry”

IP Routing Tables The “Destination” column in the routing table is better called network prefix The “Destination” column in the routing table is better called network prefix Stores the pattern against which a match of Stores the pattern against which a match of packet D.A & genmask is attempted is attempted Possible for Possible for packet D.A & genmask to match multiple entries in col network prefix? to match multiple entries in col network prefix?

IP Routing Tables Longest prefix match Longest prefix match Most specific match determines how the packet will be handled Most specific match determines how the packet will be handled Presence of the H flag … Presence of the H flag … network prefix is 32 bits long network prefix is 32 bits long Most specific match possible Genmask =

Routing Table Masks The routing table was that of a machine whose interface address is and subnet mask is The routing table was that of a machine whose interface address is and subnet mask is st row: R.T.mask = subnet mask 1st row: R.T.mask = subnet mask 2nd and 3rd rows: R.T.mask not equal to subnet mask 2nd and 3rd rows: R.T.mask not equal to subnet mask

Broadcast addresses What is the limited broadcast address that machine X will use? What is the limited broadcast address that machine X will use? – What is the subnet-directed broadcast address that machine X will use? What is the subnet-directed broadcast address that machine X will use? –

Link layer Number of hosts accessible via the link OneMore than one (Serial links) (Ethernet, FDDI, …)

Ethernet Data (IP, ARP, RARP …) CRC Dest addr (6 bytes) Source addr (6 bytes)Type 10 Mb/s, 100 Mb/s, 1 Gb/s

Ethernet D.A.S.A. Type CRC ARPRARPIP

IEEE ARP RARP IP D.A.S.A. Length CRC 8 bytesThe type field is part of the additional 8-byte field

Ethernet/802.3 addresses 48-bit addresses 48-bit addresses 24 out of the 48 bits are obtained from IEEE 24 out of the 48 bits are obtained from IEEE –IEEE: Official global authority for LAN addresses These 24 bits: Organizationally Unique Identifier (OUI) These 24 bits: Organizationally Unique Identifier (OUI) Radia Perlman, “Interconnections” Radia Perlman, “Interconnections”

Ethernet/802.3 addresses 1 bit out of the 24 OUI bits: Group/Individual bit 1 bit out of the 24 OUI bits: Group/Individual bit –1: Address refers to a logical group of stations (ex: multicast Ethernet addresses) –0: Address refers to a particular station Another bit out of the 24 bits: Local/global bit Another bit out of the 24 bits: Local/global bit –0: The address is globally unique –1: The address is locally assigned, no guarantee of global uniqueness

Framing How to distinguish between successive frames? How to distinguish between successive frames? Where does a frame start and where does it end? Where does a frame start and where does it end? –Special characters as delimiters? –Anything else?

Ethernet frame Data Header Trailer Medium In Ethernet, gaps between frames act as delimiters…inter-frame gap How would a station detect the beginning of the “gap”? Drop in power level in the medium

Frame Length Fixed or variable length? Fixed or variable length? –Ethernet frames are of variable length –Minimum: 64 bytes (including 14 bytes of header and 4 bytes of CRC) –Maximum: 1518 bytes –Maximum Transmission Unit (MTU): 1500 bytes How can we know the length of a frame? How can we know the length of a frame?

If the beginning and end of the frame can be identified (delimiters), then the frame can be parsed properly If the beginning and end of the frame can be identified (delimiters), then the frame can be parsed properly Length Data From the beginning of the frame: first 6 bytes -- D.A., next 6 bytes -- S.A. etc; From the end of the frame: last 4 bytes -- CRC

Error Detection How to handle errors on the link? How to handle errors on the link? –Error detection –CRC: Cyclic Redundancy Check “Reliable” link or “unreliable” link “Reliable” link or “unreliable” link –Error detection is the first step –If reliable link: sender retransmits

Reliability & Flow Control –ARQ (Automatic Repeat Request) –Acks / Nacks must be sent back to the sender –Ethernet: no reliability Flow Control Flow Control –Receiver stops a fast sender –IEEE defines a PAUSE frame for this

Cyclic Redundancy Check Code Cyclic Redundancy Check Code Simple parity check codes Simple parity check codes –Odd and even parity; modulo-2 sum Horizontal and vertical parity check code Horizontal and vertical parity check code CRC Row parity bit Column parity bit

CRC Can generalize the horizontal and vertical check code to a general parity check code Can generalize the horizontal and vertical check code to a general parity check code –Parity bits are calculated on subsets of the data bits In a CRC, the string of data bits and the code bits are viewed as polynomials In a CRC, the string of data bits and the code bits are viewed as polynomials –Data string = 1101, poly = (D^3 + D^2 + 1)

CRC New entity: generator polynomial New entity: generator polynomial L-bit CRC L-bit CRC Generator polynomial g(D) : of degree L in the variable D Generator polynomial g(D) : of degree L in the variable D s(D): data polynomial s(D): data polynomial

CRC To get the CRC polynomial c(D) To get the CRC polynomial c(D) –Obtain s(D)*(D^L) –Divide s(D)*(D^L) by g(D) –c(D) = Remainder when s(D)*(D^L) is divided by g(D) “Data Networks” – Bertsekas and Gallager “Data Networks” – Bertsekas and Gallager –Chap 2

ARP “Protocol address” Ex: IP address “Hardware address” Ex: Ethernet address RFC 826

ARP S.A.D.A. Type CRC ARP Sender h/w Sender proto Target h/w Target proto

ARP header Hardware type (2 octets) Hardware type (2 octets) –Value =1 for Ethernet Protocol type (2 octets) Protocol type (2 octets) –Value = 0x0800 for IP Hardware address size in bytes (1 octet) Hardware address size in bytes (1 octet) –Value = 6 for Ethernet Protocol address size in bytes (1 octet) Protocol address size in bytes (1 octet) –Value = 4 for IP

ARP header Opcode Opcode –ARP request –ARP reply –RARP request –RARP reply

ARP cache Before issuing an ARP request, a machine always checks its ARP cache to see if the desired hardware address is present Before issuing an ARP request, a machine always checks its ARP cache to see if the desired hardware address is present If no such address mapping is found, then the ARP request is issued If no such address mapping is found, then the ARP request is issued Timeout for cache entries Timeout for cache entries arp –a shows all the ARP cache entries arp –a shows all the ARP cache entries