Chapter 4 - Internetworking Networks are built with different technology We want to be able to connect these differing networks This chapter is about the problems of interconnecting different networks. Basically layer 3 – the Network layer Routers are the main network device
Chapter 4 - Internetworking. Networks are built with different technology We want to be able to connect these differing networks This chapter is about the problems of interconnecting different networks. Basically layer 3 – the Network layer Routers are the main network device. Main Issues. - PowerPoint PPT Presentation
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Chapter 4 - Internetworking
Networks are built with different technology We want to be able to connect these differing
networks This chapter is about the problems of
interconnecting different networks. Basically layer 3 – the Network layer Routers are the main network device
Main Issues
IP or Internet protocol Finding efficient, loop-free paths through the
constituent networks Internet problems: address space, large
routing tables, scaleable networks Multicast
What is an Internetwork?
Look over figures 4.1and 4.2 They are graphically describing the issue of
interconnecting differing networks and a simple way of looking at the overall changing of protocols
Registered to billionaire Ted Turner, one big site!! www.nvc.cs.vt.edu 208.22.18.79
CS department site, a small to medium site www.somuchdata.com hosted at 216.40.247.57
Registered to me, William May (used to advertise a book I wrote three years ago), a very small site!
IP Addresses and Classes
Class A, B and C addresses Shown in figure 4.6 For most medium to large organizations like
companies, universities, government offices etc. Class A is way too big and Class C is too small
Class B is where the crunch came
Network Host
7 24
0(a)
Network Host
14 16
1 0(b)
Network Host
21 8
1 1 0(c)
Datagram forwarding in IP
Every IP datagram contains the destination IP address
The “network” part of the address uniquely identifies a single physical network
All hosts that share the same network part of the address, are connected to the same physical network and can communicate with each other by sending frames over that network
So just how does the datagram get forwarded?
Two parts Routers forward the datagram based on the
network part of the address At the end there has to be a (local) table of
address pairs – that is a table that maps IP addresses into physical addresses ARP (Address Resolution Protocol)
And how does a sender determine where to send the datagram?
A host needs the address of the first router to send a datagram on its way
Called the default router DHCP is one common way of learning which
is your default router
DHCPrelay
DHCPserver
Other networks
Unicast to server
Broadcast
Host
Virtual Networks and Tunnels
Figure 4.12 explains it best, another level of encapsulation
IP header ,Destination = 2.x
IP payload
IP header ,Destination = 10.0.0.1
IP header ,Destination = 2.x
IP payload
IP header ,Destination = 2.x
IP payload
Network 1 R1 Internetwork Network 2R2
10.0.0.1
Routing
Routing table – generally contains mappings from network numbers to next hops (which are labeled as output ports on the router)
“Routing is the process by which forwarding tables are built.” (page 281)
Routing Protocols
Routers talking to other routers (very roughly-experts would shoot me for this
analogy!) the router analog of the spanning tree procedure for switches
Routing Protocols
We will look at several: Static routes (work fine for small internetworks) RIP (most widely used, simple but can be used on
reasonably large internetworks) OSPF (scaleable, good for campus-sized
internetworks) BGP (used by ISPs, very complicated, we will
only discuss in passing)
RIP
The ICND book has a great presentation of this protocol
I recommend going over that presentation, it is mainly pictures of how the routing table changes
Distance vector – RIP counts “hops”
4
3
6
21
9
1
1D
A
FE
B
C
D
G
A
F
E
B
C
A
C
1
2
3
B
D
4
5
6
Address of net 2
Distance to net 2
Command Must be zero
Family of net 2 Address of net 2
Family of net 1 Address of net 1
Address of net 1
Distance to net 1
Version
0 8 16 31
OSPF
Link State Figure 4.17 (next slide) show the basics of
how the routers talk to each other
X A
C B D
(a)
X A
C B D
(b)
X A
C B D
(c)
X A
C B D
(d)
D
A
B
C
5 3
211
10
OSPF Hierarchy
Hierarchy is one of the main tools to make systems more scaleable
OSPF allows more hierarchy to be imposed by partitioning a domain into areas
This means: a router within a domain does not necessarily need to know how to reach every network within that domain – cuts down on the information that has to be stored and processed
R9 R7R8
R5R6
R4
Area 1Area 0
Area 3
Area 2
R1 R3
R2
Authentication
Version Type Message length
Checksum Authentication type
SourceAddr
AreaId
0 8 16 31
LS Age Options Type=1
0 Flags 0 Number of links
Link type Num_TOS Metric
Link state ID
Advertising router
LS sequence number
Link ID
Link data
Optional TOS information
More links
LS checksum Length
The Internet
1990 form in figure 4.23 Today’s is shown next
Backbone service provider
Peeringpoint
Peeringpoint
Large corporation
Large corporation
Smallcorporation
“Consumer ” ISP
“Consumer ” ISP
“ Consumer ” ISP
Exhaustion of IP Addresses
~4,000,000,000 (232 addresses) are not enough!
Class B particularly bad off Subnetting and CIDR (Classless InterDomain