Professional Documents
Culture Documents
NETWORK LAYER
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
OUTLINE
2
1. OVERVIEW OF
NETWORK LAYER
Faculty of Information Technology
MSc. Nguyen Cong Danh
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
NETWORK LAYER
4
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
5
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
3
2 implemented in (remote) servers
6
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Individual routing algorithm components in each and every router interact in the control plane
Routing
Algorithm
control
plane
data
plane
values in arriving
packet header
0111 1
2
3
7
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Remote Controller
control
plane
data
plane
CA
CA CA CA CA
values in arriving
packet header
0111 1
2
3
8
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
link layer
physical layer
9
2. IPV4
(INTERNET PROTOCOL)
Faculty of Information Technology
MSc. Nguyen Cong Danh
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
11
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IP FRAGMENTATION, REASSEMBLY
…
o Different link types, different MTUs in: one large datagram
out: 3 smaller datagrams
• Large IP packet divided
(“fragmented”) within net
o One packet becomes several reassembly
small packets
o “Reassembled” only at final
…
destination
o IP header bits used to identify,
order related fragments
12
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IP FRAGMENTATION, REASSEMBLY
13
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IPv4 ADDRESSING
14
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IPv4 ADDRESSING
o Dotted-decimal notation
• Value in each octet: 0 – 255.
• Type of IPv4 address: Unicast, Multicast, Broadcast
15
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
16
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
17
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IP ADDRESS STRUCTURE
10000011011011000111101011001100
NETWORK HOST
18
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
CLASSFUL ADDRESSING
• Different class addresses reserve different amounts of bits for Network and Host portions of the address
• Provide flexibility required to support different size networks
• In classful addressing, the address space is divided into five classes: A, B, C, D, and E
19
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
CLASS A
CLASS B
CLASS C
CLASS D
SUMMARY
24
3. IPV6
IPv6 MOTIVATION
26
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
27
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
28
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
IPv6 REPRESENTATION
• IPv6 is 128 bits while IPv4 only has 32 bits. The 128
bits of an IPv6 address are represented in 8 groups
of 16 bits each.
• IPv6 is written in HEX (Each group is written as four
hexadecimal digits) while IPv4 is written in decimal
• The groups are separated by colons (:).
29
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• IPv^6: 2001:0db8:85a3:0000:0000:8a2e:0370:7334
• Some IPv6 shortening rules:
o Omit Leading 0s fe80: 0000: 0000: 0000:a299:9bff:fe18:50d1
fe80:0:0:0:a299:9bff:fe18:50d1
ff02::0001
2001:0db8:0000:0000:abcd:0000:0000:1234
2001:0db8::abcd:0000:0000:1234 30
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
2001:0000:0000:0000:0000:abcd:0000:1234
2001:0000:0000:0000:abcd:0000:0000:1234
2001:0000:0000:abcd:0000:0000:0000:1234
2001:0000:abcd:0000:0000:0000:0000:1234
2001:db8:1111:a:b0::9000:200
31
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
32
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
33
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
34
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
35
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
36
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
37
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
38
4. NAT (NETWORK
ADDRESS TRANSLATION)
Faculty of Information Technology
MSc. Nguyen Cong Danh
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Motivation: local network uses just one IP address as far as outside world is concerned:
• Range of addresses not needed from ISP: just one IP address for all devices
• Can change addresses of devices in local network without notifying outside world
• Can change ISP without changing addresses of devices in local network
• Devices inside local network not explicitly addressable, visible by outside world (a security plus)
• Outgoing datagrams: replace (source IP address, port #) of every outgoing datagram to (NAT IP
address, new port #)
. . . remote clients/servers will respond using (NAT IP address, new port #) as destination addr
• Remember (in NAT translation table) every (source IP address, port #) to (NAT IP address, new port
#) translation pair
• Incoming datagrams: replace (NAT IP address, new port #) in dest fields of every incoming datagram
with corresponding (source IP address, port #) stored in NAT table 40
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
10.0.0.4
10.0.0.2
138.76.29.7
10.0.0.3
41
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
42
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
45
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Individual routing algorithm components in each and every router interact with
each other in control plane to compute forwarding tables
Routing
Algorithm
control
plane
data
plane
46
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Remote Controller
control
plane
data
plane
CA
CA CA CA CA
47
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
ROUTING PROTOCOLS
Routing protocols are used between routers to 10.120.2.0 172.16.1.0
determine good paths and maintain routing tables.
E0
S0
• Path: sequence of routers, packets will traverse
in going from given initial source host to given
final destination host
Routed Protocol: IP
Routing protocol: RIP, EIGRP…
48
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
ROUTER OPERATIONS
ROUTER OPERATIONS
50
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
51
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
(Defined by
user)
52
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
STATIC ROUTES
Configure unidirectional static routes to and from a stub network to allow communications to occur.
54
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• This is a unidirectional route. You must have a route configured in the opposite direction.
55
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
DEFAULT ROUTES
56
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
57
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
RIP
Administrative
Distance=120
E
Router C Router D
60
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
A EIGRP
Bandwidth
56
RIP Delay
Load
Hop count
T1 56 Reliability
MTU
T1
OSPF
B
Cost (Bandwidth)
61
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Pass periodic copies of routing table to neighbor routers and accumulate distance vectors 62
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Routers discover the best path to destinations from each neighbor RIP protocol
64
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
65
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Each node maintains the distance from itself to each possible destination network
66
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
67
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
68
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Router A updates its table to reflect the new but erroneous hop count
70
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• It is never useful to send information about a route back in the direction from which the
original packet came
73
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Routers set the distance of routes that have gone down to infinity
74
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Router keeps an entry for the network possibly down state, allowing time for other routers to
recompute for this topology change
76
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
77
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
78
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
79
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
80
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
81
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
82
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• On network failure
o New LSPs are flooded
o All routers recompute routing table
85
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
Actions of routers:
- Select Router-id
- Establish neighbor relations
- Exchange LSDB
- Build routing table
ADOSPF = 110
Metric = cost {Bandwidth}
87
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
AD = 110
Metric = cost {Bandwidth}
89
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
90
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
91
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
• Contents of LSP:
- State of each directly connected
link
- Includes information about
neighbors such as neighbor ID, link type,
& bandwidth.
94
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
96
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
98
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
99
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
100
FACULTY OF INFORMATION TECHNOLOGY
MSc. Nguyen Cong Danh
* Drawback
- Initial discovery may cause flooding.
- Link-state routing is memory- and processor-intensive.
* Requirements for using
Memory requirements
Typically link state routing protocols use more memory
Processing Requirements
More CPU processing is required of link state routing protocols
Bandwidth Requirements
Initial startup of link state routing protocols can consume lots of bandwidth
This should only occur during initial startup of routers, but can also be an issue on unstable
networks.
101