Chapter 3 Internetworking

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

C14b: Classless Intradomain Routing

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

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

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

COMP 631: NETWORKED & DISTRIBUTED SYSTEMS 9/6/16 COMP 631: NETWORKED & DISTRIBUTED SYSTEMS. IP Addressing. Jasleen Kaur. Fall 2016

Computer Network Fundamentals Spring Week 4 Network Layer Andreas Terzis

CSCI-1680 Network Layer: IP & Forwarding Rodrigo Fonseca

Internetworking Part 2

Internetworking Part 2

Copyright 2010, Elsevier Inc. All rights Reserved

Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...

Network Layer Protocols

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

CSCI-1680 Network Layer: IP & Forwarding John Jannotti

Last time. Network layer. Introduction. Virtual circuit vs. datagram details. IP: the Internet Protocol. forwarding vs. routing

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

IP - The Internet Protocol

Network layer: Overview. Network Layer Functions

CS 348 Computer Networks. IP and Routing. Indian Institute of Technology, Bombay

IP Addressing. Introductory material. An entire module devoted to IP addresses. Pedro Brandão (PhD) University of Évora

CH. 3 IP FORWARDING AND ROUTING

Communication Networks ( ) / Fall 2013 The Blavatnik School of Computer Science, Tel-Aviv University. Allon Wagner

ECE 461 Internetworking Fall Quiz 1

Lecture 10: Addressing

Introduction to Internetworking

Network Layer: Internet Protocol

Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

CIS 551 / TCOM 401 Computer and Network Security

Overview 4.2: Routing

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

CSCI-1680 Network Layer: IP & Forwarding Rodrigo Fonseca Instructor: Nicholas DeMarinis

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

CS 458 Internet Engineering Spring First Exam

Basic Internetworking (IP)

Vorlesung Kommunikationsnetze

The Routing Table: A Closer Look

Chapter 18. Introduction to Network Layer

IP Addresses. IP Addresses

Chapter 4 Network Layer

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

Department of Computer and IT Engineering University of Kurdistan. Network Layer. By: Dr. Alireza Abdollahpouri

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

Computer Networks Principles Network Layer - IP

Master Course Computer Networks IN2097

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

IPv4. Christian Grothoff.

EEC-684/584 Computer Networks

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

Internet Control Message Protocol (ICMP)

Data Communication & Computer Networks Week # 13

ECE 158A: Lecture 7. Fall 2015

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat no true in practice. administrative autonomy

Routing. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing

C14a: Internetworks and The Internet

University of Toronto Faculty of Applied Science and Engineering. Final Exam, December ECE 461: Internetworking Examiner: J.

Guide to Networking Essentials, 6 th Edition. Chapter 5: Network Protocols

CCNA Exploration Network Fundamentals. Chapter 06 Addressing the Network IPv4

CS 43: Computer Networks. 21: The Network Layer & IP November 7, 2018

CS 457 Networking and the Internet. Addressing. Topics 9/15/16. Fall 2016 Indrajit Ray

CSEP 561 Internetworking. David Wetherall

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

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

Using IP Addressing in the Network Design

IPv4 addressing, NAT. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley.

Lecture 3: Packet Forwarding

HY 335 Φροντιστήριο 8 ο

Internet Addresses Reading: Chapter 4. 2/11/14 CS125-myaddressing

Computer Networks Prof. Ashok K. Agrawala

CS 457 Lecture 11 More IP Networking. Fall 2011

1 Connectionless Routing

Network Layer: Control/data plane, addressing, routers

Chapter 19 Network Layer: Logical Addressing

ITEC310 Computer Networks II

Each ICMP message contains three fields that define its purpose and provide a checksum. They are TYPE, CODE, and CHECKSUM fields.

Internet Protocols (chapter 18)

RIP Version 2. The Classless Brother

Data Communication & Networks G Session 7 - Main Theme Networks: Part I Circuit Switching, Packet Switching, The Network Layer

Network Layer (Routing)

EEC-484/584 Computer Networks

TSIN02 - Internetworking

COMP/ELEC 429/556 Introduction to Computer Networks

IP: Routing and Subnetting

Subnets. IP datagram format. The Internet Network layer. IP Fragmentation and Reassembly. IP Fragmentation & Reassembly. IP Addressing: introduction

CSCI Computer Networks Fall 2016

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

Integrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding.

The Interconnection Structure of. The Internet. EECC694 - Shaaban

Lecture 12: Aggregation. CSE 123: Computer Networks Alex C. Snoeren

CS4450. Computer Networks: Architecture and Protocols. Lecture 13 THE Internet Protocol. Spring 2018 Rachit Agarwal

Most important (cont d) What s most important in Project 1. Important for individuals. From from Most Important

McGraw-Hill The McGraw-Hill Companies, Inc., 2000

Topology of the Internet. Autonomous Systems (AS) Two-Level Routing. Why are there different Protocols?

internet technologies and standards

Routing in Internet. Problem. Given set of nodes, how do routers acquire info about neighbors to construct the routing tables?

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

Internet Protocol (IP)

CSCD58 WINTER 2018 WEEK 6 - NETWORK LAYER PART 1. Brian Harrington. February 13, University of Toronto Scarborough

Chapter 18 and 22. IPv4 Address. Data Communications and Networking

Transcription:

Chapter 3 Internetworking Basic Internetworking (IP) (cont d) Datagram forwarding in IP Every datagram contains the IP address of the destination host If directly connected to destination network, then forward to destination host If not directly connected to destination network, then forward to some router Each host has a default router Each router maintains a forwarding table Table contains <NetworkNum, NextHop> pairs. Table may contain a default entry specifying a default router (used if none of the entries in the table matches the destination s network number). o Router datagram forwarding algorithm if (NetworkNum of destination = NetworkNum of one of my interfaces) then Deliver packet to destination over that interface else if (NetworkNum of destination is in my forwarding table) then Deliver packet to NextHop router else Deliver packet to default router o Host datagram forwarding algorithm if (NetworkNum of destination = my NetworkNum) then Deliver packet to destination directly else Deliver packet to default router

Hierarchical addressing improves scalability: forwarding table lists only network numbers rather than all the hosts in the network Address Translation (ARP) o When node A wants to send an IP datagram to node B on the same network, A needs to know B s link-layer address (or physical address). o Each node maintains a table that maps IP addresses into physical addresses Host can dynamically learn the contents of the table using the Address Resolution Protocol (ARP) Each table entry has an expiration timer, entry removed when timer expires. o The Address Resolution Protocol A node broadcasts an ARP query if the target IP address is not in ARP table ARP query contains the sender s IP address and linklayer address, and the target IP address. Target node responds with its link-layer address; it also adds the sending node s information in its ARP table. The originator adds the IP address to link-layer address mapping of the target node to its ARP table. All nodes on the network sniff the ARP query. If a node already has an entry for the sending node in its ARP table, it refreshes the entry. o ARP packet format

Subnetting o Assigning one network number per physical network is inefficient o Add another level to address/routing hierarchy: subnet Allocate a single network number to several physical networks, referred to as subnets. o An IP address now has three parts: network + subnet + host o A host is configured with both an IP address and a subnet mask for the subnet to which it is attached Subnet mask indicates the split between network + subnet part and host part All hosts on a given subnet are configured with the same subnet mask IP address AND subnet mask = subnet number o Host forwarding algorithm if (my subnet mask & destination IP address = my subnet number) Deliver packet to destination directly else deliver packet to default router

o Router forwarding algorithm D = destination IP address for each forwarding table entry <SubnetNumber, SubnetMask, NextHop> if (SubnetMask & D = SubnetNumber) if NextHop is an interface deliver packet directly to destination else deliver packet to NextHop (a router) if no matches are found, then deliver packet to default router. o Subnets are not visible from routers outside the site; outside routers keep only one entry in their forwarding tables. o Benefits of subnetting Improve address assignment efficiency Help aggregate routing information Classless InterDomain Routing (CIDR) CIDR addresses two scaling concerns in the Internet The growth of backbone routing table as more and more network numbers need to be stored in them Potential exhaustion of the 32-bit address space due to address assignment inefficiency Address assignment inefficiency arises because of the IP address structure with class A, B, and C addresses A network with 2 hosts needs a class C address A network with 256 hosts needs a class B address Exhaustion of IP address space centers on exhaustion of the class B network numbers Solution: assign an appropriate number of class C addresses

Problem with this solution: Excessive storage requirement at the routers If an organization has 16 class C network numbers assigned to it, every Internet backbone router needs 16 entries in its routing tables for that organization If we had assigned a class B address to the organization, the same routing information can be stored in one entry. But efficiency = 16 254 / 65, 534 = 6.2% o CIDR tries to balance the desire to minimize the number of routes that a router needs to know against the need to hand out addresses efficiently. o CIDR helps us to aggregate routes Uses a single entry in the forwarding table to tell the router how to reach a lot of different networks This is achieved by breaking the rigid boundaries between address classes Consider an organization with 16 class C network numbers. Instead of handing out 16 addresses at random, hand out a block of contiguous class C addresses Suppose we assign the class C network numbers from 192.4.16 through 192.4.31 Observe that top 20 bits of all the addresses in this range are the same (11000000 00000100 0001) We have created a 20-bit network number (which is in between class B network number and class C number)

CIDR requires to hand out blocks of class C addresses that share a common prefix Each block must contain a number of class C networks that is a power of 2 To represent a network number, or prefix, the convention is to place a /X after the prefix where X is the prefix length in bits Prefixes may be of any length (2 to 32 bits) For example, the 20-bit prefix for all the networks 192.4.16 through 192.4.31 is represented as 192.4.16/20 By contrast, 192.4.16/24 represents a single class C network number IP forwarding revisited Each forwarding table entry is a <NetNumber/MaskLength, NextHop> pair When a packet comes in, router scans the forwarding table entry by entry, looking for a match. A match occurs when destination IP address & Mask = NetNumber. If multiple entries match, the entry with the longest match wins. Internet Control Message Protocol (ICMP) o Defines a collection of error messages that are sent back to the source host whenever a router or host is unable to process an IP datagram successfully Destination host unreachable due to link/node failure Reassembly process failed TTL had reached 0 IP header checksum failed

o ICMP-Redirect Sent from a router to a source host With a better route information o ICMP messages are carried inside IP datagrams