Download Scaling the Network: The Internet Protocol Networking CS 3470, Section 1

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

IEEE 1355 wikipedia , lookup

Asynchronous Transfer Mode wikipedia , lookup

Net bias wikipedia , lookup

Deep packet inspection wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

AppleTalk wikipedia , lookup

Distributed firewall wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

Internet protocol suite wikipedia , lookup

Computer network wikipedia , lookup

Network tap wikipedia , lookup

Airborne Networking wikipedia , lookup

List of wireless community networks by region wikipedia , lookup

Wake-on-LAN wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Transcript
Scaling the Network:
The Internet Protocol
Networking
CS 3470, Section 1
Network Layer: Introduction


How does it all fit?
Data link layer


Network layer



Delivers frames between two
physically connected hosts
Delivery of packets from
machine to machine
Hop by hop between hosts and routers
Transport layer

Between two end hosts
2
Today




Networking forwarding
Internet Protocol (IP)
IP Classful Address Scheme
ARP!
3
Network Layer Functions

Addressing

Globally unique address for each routable device


Assigned by network operator


Need to map to MAC address
Forwarding


Logical address, unlike MAC address
From input port to appropriate output port in a router
Routing

Which path to use to forward packets from src to dest
4
Network Layer Forwarding


Forwarding input port to appropriate output
port in a router
We already talked about forwarding over the
network layer



Datagram / Connectionless
Virtual Circuit Switching
Which one is used with IP?
5
Datagram vs Virtual Circuit

Datagram (example: IP)

Data exchange among computers


“Smart” end systems (computers)



“Elastic” service, no strict timing req.
Can adapt, perform control, error recovery
Simple inside network, complexity at “edge”
Many link types


Different characteristics
Uniform service difficult
6
Datagram vs Virtual Circuit

Virtual Circuit (Example: ATM)


Evolved from telephony
Human conversation:





Strict timing, reliability requirements
Need for guaranteed service
Quality of service
“Dumb” end systems
Complexity inside network
7
Internetworking

What is an internetwork?

An arbitrary collection of networks interconnected to provide
some sort of host-host packet delivery service
IP


IP stands for Internet Protocol
Key tool used today to build scalable,
heterogeneous internetworks
IP


A IP router is a gateway from one network to
another
Can interface with many network types





Ethernet
PPP
Token Ring
802.11
... more
[TCP/UDP]/IP


Two well-known transport level protocols that
run on top of IP at the hosts are UDP and TCP
TCP




Connection-based protocol
Error recovery
Packets arrive in order
UDP



Connectionless protocol
No error recovery
Packets can arrive in any order, or not at all
Internetworking


A simple internetwork showing the protocol
layers
IP connects them all!
12
IP Service Model

Packet Delivery Model


Connectionless model for data delivery
Best-effort delivery (unreliable service)


What bad stuff can happen?
Global Addressing Scheme

Provides a way to identify all hosts in the network
Packet Format
IP Fragmentation and Reassembly

Each network has some MTU (Maximum
Transmission Unit)


Ethernet (1500 bytes), FDDI (4500 bytes)
Strategy





Fragmentation occurs in a router when it receives a
datagram that it wants to forward over a network
which has (MTU < datagram)
Reassembly is done at the receiving host
All the fragments carry the same identifier in the
Ident field
Fragments are self-contained datagrams
IP does not recover from missing fragments
IP Fragmentation and Reassembly
IP datagrams traversing the sequence of physical networks
IP Fragmentation and Reassembly
Header fields used in IP fragmentation. (a) Unfragmented packet; (b) fragmented packets.
IP Addressing


Globally unique logical address for a host
Address resolution



Logical to physical address mapping
What was the physical address?
Is possible to address any host in the
network

Even if on different physical network
18
IP Addressing


A 32-bit number that uniquely identifies a
location
Written using dotted decimal notation



Common form: 134.161.240.211
Binary representation:
10000110 10100001 11110000 11010011
Two-level hierarchy: network id and host id


Network IDs administered by Internet Assigned
Number Authority (IANA)
Host IDs administered locally
19
IP Addressing


IP address is assigned to each network
interface (NIC)
Routers connect two or more physical
networks


Each interface has its own address
Multi-homed host



A host having multiple connections to Internet
Multiple addresses identify the same host
Does not forward packets between its interfaces
20
IP Addressing

Classful addressing scheme separates groups of
addresses into classes

Class A




Class B




8 bits used for network (256)
24 bits used for hosts and network devices (16,777,216)
Binary address starts with 0
16 bits for networks (65,536)
16 bits for hosts and network devices (65,536)
binary address starts with 10
Class C



24 bits for the network (16,777,216)
8 bits for the host (256)
Binary address starts with 110
IP “Classful” Addressing Scheme

Three unicast address classes: A, B, and C
One multicast: class D
class

A
0 network
B
10
C
110
D
1110
1.0.0.0 to
127.255.255.255
host
network
128.0.0.0 to
191.255.255.255
host
network
multicast address
host
192.0.0.0 to
223.255.255.255
224.0.0.0 to
239.255.255.255
32 bits
22
Address Resolution

IP address is virtual



Not understood by underlying physical networks
IP packets need to be transmitted by the
underlying physical network
Address resolution


Translating IP address to physical address
Address Resolution Protocol (ARP)
23
ARP


A router has to know where to deliver
packets on the local network
ARP is used to discover MAC addresses
based on IP addresses
ARP Cache

Each computer maintains a cache table



IP address  hardware address mapping
Only about computers on the same network
Exchanges ARP messages


To resolve IP addresses with unknown hardware
addresses
Encapsulated in Ethernet data frame
25
ARP Protocol

When a node sends an IP packet



Look up destination address in the ARP table
If not found



To another node on the same physical network
Broadcast a request to the local network
Whose IP address is this?
What info should the request message
contain?
26
ARP Example
arp who-has 192.168.10.1 tell node31.ceee.lab
arp reply 192.168.10.1 is-at 00:60:08:ce:9d:3b
arp who-has node31.ceee.lab tell 192.168.10.254
arp reply node31.ceee.lab is-at 00:02:3f:b4:cd:87
27
ARP Response

The target node responds to sender (unicast?)



On receiving the response


Requester updates its table
Other nodes upon receiving the request



With its physical address
Adds the requester into its ARP table (why?)
Refresh the requester entry if already there
No action otherwise (why?)
Table entries deleted if not refreshed for a while
28
ARP Example

ARP broadcast by W requesting hardware
address of Y
29