Upload
cicero-silva
View
25
Download
0
Embed Size (px)
Citation preview
7/13/2019 Tanenbaum Slides 5
1/83
The Network Layer
Chapter 5
7/13/2019 Tanenbaum Slides 5
2/83
Network Layer Design Isues
Store-and-Forward Packet Switching
Services Provided to the Transport Layer
Implementation of Connectionless Service Implementation of Connection-Oriented Service
Comparison of Virtual-Circuit and Datagram Subnets
7/13/2019 Tanenbaum Slides 5
3/83
Store-and-Forward Packet Switching
The environment of the network layer protocols.
fig 5-1
7/13/2019 Tanenbaum Slides 5
4/83
Implementation of Connectionless Service
Routing within a diagram subnet.
7/13/2019 Tanenbaum Slides 5
5/83
Implementation of Connection-Oriented Service
Routing within a virtual-circuit subnet.
7/13/2019 Tanenbaum Slides 5
6/83
Comparison of Virtual-Circuit and
Datagram Subnets
5-4
7/13/2019 Tanenbaum Slides 5
7/83
Routing Algorithms
The Optimality Principle Shortest Path Routing
Flooding
Distance Vector Routing Link State Routing
Hierarchical Routing
Broadcast Routing Multicast Routing
Routing for Mobile Hosts
Routing in Ad Hoc Networks
7/13/2019 Tanenbaum Slides 5
8/83
Routing Algorithms (2)
Conflict between fairness and optimality.
7/13/2019 Tanenbaum Slides 5
9/83
The Optimality Principle
(a)A subnet. (b)A sink tree for router B.
7/13/2019 Tanenbaum Slides 5
10/83
Shortest Path Routing
The first 5 steps used in computing the shortest path from A to D.
The arrows indicate the working node.
7/13/2019 Tanenbaum Slides 5
11/83
Flooding
Dijkstra's algorithm to compute the shortest path through a graph.
5-8 top
7/13/2019 Tanenbaum Slides 5
12/83
Flooding (2)
Dijkstra's algorithm to compute the shortest path through a graph.
5-8
bottom
7/13/2019 Tanenbaum Slides 5
13/83
Distance Vector Routing
(a)A subnet. (b)Input from A, I, H, K, and the new
routing table for J.
7/13/2019 Tanenbaum Slides 5
14/83
Distance Vector Routing (2)
The count-to-infinity problem.
7/13/2019 Tanenbaum Slides 5
15/83
Link State Routing
Each router must do the following:1. Discover its neighbors, learn their network address.
2. Measure the delay or cost to each of its neighbors.
3. Construct a packet telling all it has just learned.4. Send this packet to all other routers.
5. Compute the shortest path to every other router.
7/13/2019 Tanenbaum Slides 5
16/83
Learning about the Neighbors
(a)Nine routers and a LAN. (b)A graph model of (a).
7/13/2019 Tanenbaum Slides 5
17/83
Measuring Line Cost
A subnet in which the East and West parts are connected by two lines.
7/13/2019 Tanenbaum Slides 5
18/83
Building Link State Packets
(a) A subnet. (b) The link state packets for this subnet.
7/13/2019 Tanenbaum Slides 5
19/83
Distributing the Link State Packets
The packet buffer for router B in the previous slide (Fig. 5-13).
7/13/2019 Tanenbaum Slides 5
20/83
Hierarchical Routing
Hierarchical routing.
7/13/2019 Tanenbaum Slides 5
21/83
Broadcast Routing
Reverse path forwarding. (a)A subnet. (b)a Sink tree. (c)The
tree built by reverse path forwarding.
7/13/2019 Tanenbaum Slides 5
22/83
Multicast Routing
(a)A network. (b)A spanning tree for the leftmost router.
(c)A multicast tree for group 1. (d)A multicast tree for group 2.
7/13/2019 Tanenbaum Slides 5
23/83
Routing for Mobile Hosts
A WAN to which LANs, MANs, and wireless cells are attached.
7/13/2019 Tanenbaum Slides 5
24/83
Routing for Mobile Hosts (2)
Packet routing for mobile users.
7/13/2019 Tanenbaum Slides 5
25/83
Routing in Ad Hoc Networks
Possibilities when the routers are mobile:
1. Military vehicles on battlefield.
No infrastructure.
2. A fleet of ships at sea. All moving all the time
3. Emergency works at earthquake . The infrastructure destroyed.
4. A gathering of people with notebook computers.
In an area lacking 802.11.
7/13/2019 Tanenbaum Slides 5
26/83
Route Discovery
a) (a)Range of A's broadcast.
b) (b)After B and D have received A's broadcast.
c) (c)After C, F, and G have received A's broadcast.
d) (d)After E, H, and I have received A's broadcast.
Shaded nodes are new recipients. Arrows show possible reverse routes.
7/13/2019 Tanenbaum Slides 5
27/83
Route Discovery (2)
Format of a ROUTE REQUEST packet.
7/13/2019 Tanenbaum Slides 5
28/83
Route Discovery (3)
Format of a ROUTE REPLY packet.
7/13/2019 Tanenbaum Slides 5
29/83
Route Maintenance
(a)D's routing table before G goes down.
(b)The graph after G has gone down.
7/13/2019 Tanenbaum Slides 5
30/83
Node Lookup in Peer-to-Peer Networks
(a)A set of 32 node identifiers arranged in a circle. The shaded onescorrespond to actual machines. The arcs show the fingers fromnodes 1, 4, and 12. The labels on the arcs are the table indices.
(b)Examples of the finger tables.
7/13/2019 Tanenbaum Slides 5
31/83
Congestion Control Algorithms
General Principles of Congestion Control
Congestion Prevention Policies
Congestion Control in Virtual-Circuit Subnets
Congestion Control in Datagram Subnets
Load Shedding
Jitter Control
7/13/2019 Tanenbaum Slides 5
32/83
Congestion
When too much traffic is offered, congestion sets in and
performance degrades sharply.
7/13/2019 Tanenbaum Slides 5
33/83
General Principles of Congestion Control
1. Monitor the system .
detect when and where congestion occurs.
2. Pass information to where action can be taken.3. Adjust system operation to correct the problem.
7/13/2019 Tanenbaum Slides 5
34/83
Congestion Prevention Policies
Policies that affect congestion.
5-26
7/13/2019 Tanenbaum Slides 5
35/83
Congestion Control in Virtual-Circuit
Subnets
(a)A congested subnet. (b)A redrawn subnet, eliminates
congestion and a virtual circuit from A to B.
7/13/2019 Tanenbaum Slides 5
36/83
Hop-by-Hop
Choke Packets
(a)A choke packet that affects
only the source.
(b)A choke packet that affects
each hop it passes through.
7/13/2019 Tanenbaum Slides 5
37/83
Jitter Control
(a)High jitter. (b)Low jitter.
7/13/2019 Tanenbaum Slides 5
38/83
Quality of Service
Requirements
Techniques for Achieving Good Quality of Service
Integrated Services
Differentiated Services
Label Switching and MPLS
7/13/2019 Tanenbaum Slides 5
39/83
Requirements
How stringent the quality-of-service requirements are.
5-30
7/13/2019 Tanenbaum Slides 5
40/83
Buffering
Smoothing the output stream by buffering packets.
7/13/2019 Tanenbaum Slides 5
41/83
The Leaky Bucket Algorithm
(a)A leaky bucket with water. (b)a leaky bucket with packets.
7/13/2019 Tanenbaum Slides 5
42/83
The Leaky
BucketAlgorithm
(a) Input to a leaky bucket.
(b)Output from a leaky
bucket. Output from a token
bucket with capacities of (c)
250 KB, (d)500 KB, (e)
750 KB, (f)Output from a
500KB token bucket feeding
a 10-MB/sec leaky bucket.
7/13/2019 Tanenbaum Slides 5
43/83
The Token Bucket Algorithm
(a)Before. (b) After.
5-34
7/13/2019 Tanenbaum Slides 5
44/83
Admission Control
An example of flow specification.
5-34
7/13/2019 Tanenbaum Slides 5
45/83
Packet Scheduling
(a)A router with five packets queued for line O.
(b)Finishing times for the five packets.
7/13/2019 Tanenbaum Slides 5
46/83
RSVP-The ReSerVation Protocol
(a)A network, (b)The multicast spanning tree for host 1.
(c) The multicast spanning tree for host 2.
7/13/2019 Tanenbaum Slides 5
47/83
RSVP-The ReSerVation Protocol (2)
(a) Host 3 requests a channel to host 1. (b)Host 3 then requests a
second channel, to host 2. (c)Host 5 requests a channel to host 1.
di d di
7/13/2019 Tanenbaum Slides 5
48/83
Expedited Forwarding
Expedited packets experience a traffic-free network.
A d di
7/13/2019 Tanenbaum Slides 5
49/83
Assured Forwarding
A possible implementation of the data flow for assured forwarding.
L b l S i hi d MPLS
7/13/2019 Tanenbaum Slides 5
50/83
Label Switching and MPLS
Transmitting a TCP segment using IP, MPLS, and PPP.
I ki
7/13/2019 Tanenbaum Slides 5
51/83
Internetworking
How Networks Differ How Networks Can Be Connected
Concatenated Virtual Circuits
Connectionless Internetworking
Tunneling
Internetwork Routing
Fragmentation
C i N k
7/13/2019 Tanenbaum Slides 5
52/83
Connecting Networks
A collection of interconnected networks.
H N k Diff
7/13/2019 Tanenbaum Slides 5
53/83
How Networks Differ
Some of the many ways networks can differ.
5-43
H N t k C B C t d
7/13/2019 Tanenbaum Slides 5
54/83
How Networks Can Be Connected
(a)Two Ethernets connected by a switch.
(b)Two Ethernets connected by routers.
C t t d Vi t l Ci it
7/13/2019 Tanenbaum Slides 5
55/83
Concatenated Virtual Circuits
Internetworking using concatenated virtual circuits.
C ti l I t t ki
7/13/2019 Tanenbaum Slides 5
56/83
Connectionless Internetworking
A connectionless internet.
T li
7/13/2019 Tanenbaum Slides 5
57/83
Tunneling
Tunneling a packet from Paris to London.
T li (2)
7/13/2019 Tanenbaum Slides 5
58/83
Tunneling (2)
Tunneling a car from France to England.
I t t k R ti
7/13/2019 Tanenbaum Slides 5
59/83
Internetwork Routing
(a)An internetwork. (b) A graph of the internetwork.
F t ti
7/13/2019 Tanenbaum Slides 5
60/83
Fragmentation
(a)Transparent fragmentation. (b)Nontransparent fragmentation.
F t ti (2)
7/13/2019 Tanenbaum Slides 5
61/83
Fragmentation (2)
Fragmentation when the elementary data size is 1 byte.(a)Original packet, containing 10 data bytes.
(b)Fragments after passing through a network with maximumpacket size of 8 payload bytes plus header.
(c)Fragments after passing through a size 5 gateway.
Th N t k L i th I t t
7/13/2019 Tanenbaum Slides 5
62/83
The Network Layer in the Internet
The IP Protocol
IP Addresses
Internet Control Protocols
OSPF The Interior Gateway Routing Protocol
BGP The Exterior Gateway Routing Protocol
Internet Multicasting Mobile IP
IPv6
Design Principles for Internet
7/13/2019 Tanenbaum Slides 5
63/83
Design Principles for Internet
1. Make sure it works.2. Keep it simple.
3. Make clear choices.
4. Exploit modularity.
5. Expect heterogeneity.
6. Avoid static options and parameters.
7. Look for a good design; it need not be perfect.
8. Be strict when sending and tolerant when receiving.
9. Think about scalability.
10. Consider performance and cost.
Collection of Subnetworks
7/13/2019 Tanenbaum Slides 5
64/83
Collection of Subnetworks
The Internet is an interconnected collection of many networks.
The IP Protocol
7/13/2019 Tanenbaum Slides 5
65/83
The IP Protocol
The IPv4 (Internet Protocol) header.
The IP Protocol (2)
7/13/2019 Tanenbaum Slides 5
66/83
The IP Protocol (2)
Some of the IP options.
5-54
IP Addresses
7/13/2019 Tanenbaum Slides 5
67/83
IP Addresses
IP address formats.
IP Addresses (2)
7/13/2019 Tanenbaum Slides 5
68/83
IP Addresses (2)
Special IP addresses.
Subnets
7/13/2019 Tanenbaum Slides 5
69/83
Subnets
A campus network consisting of LANs for various departments.
Subnets (2)
7/13/2019 Tanenbaum Slides 5
70/83
Subnets (2)
A class B network subnetted into 64 subnets.
CDR Classless InterDomain Routing
7/13/2019 Tanenbaum Slides 5
71/83
CDR Classless InterDomain Routing
A set of IP address assignments.
5-59
NAT Network Address Translation
7/13/2019 Tanenbaum Slides 5
72/83
NAT Network Address Translation
Placement and operation of a NAT box.
Internet Control Message Protocol
7/13/2019 Tanenbaum Slides 5
73/83
Internet Control Message Protocol
The principal ICMP message types.
5-61
ARP The Address Resolution Protocol
7/13/2019 Tanenbaum Slides 5
74/83
ARPThe Address Resolution Protocol
Three interconnected /24 networks: two Ethernets and an FDDI ring.
Dynamic Host Configuration Protocol
7/13/2019 Tanenbaum Slides 5
75/83
Dynamic Host Configuration Protocol
Operation of DHCP.
OSPF The Interior Gateway Routing
7/13/2019 Tanenbaum Slides 5
76/83
OSPF The Interior Gateway Routing
Protocol
(a)An autonomous system. (b) A graph representation of (a).
OSPF (2)
7/13/2019 Tanenbaum Slides 5
77/83
OSPF (2)
The relation between ASes, backbones, and areas in OSPF.
OSPF (3)
7/13/2019 Tanenbaum Slides 5
78/83
OSPF (3)
The five types of OSPF messeges.
5-66
BGP The Exterior Gateway Routing
7/13/2019 Tanenbaum Slides 5
79/83
Protocol
(a)A set of BGP routers. (b) Information sent to F.
The Main IPv6 Header
7/13/2019 Tanenbaum Slides 5
80/83
The Main IPv6 Header
The IPv6 fixed header (required).
Extension Headers
7/13/2019 Tanenbaum Slides 5
81/83
Extension Headers
IPv6 extension headers.
5-69
Extension Headers (2)
7/13/2019 Tanenbaum Slides 5
82/83
Extension Headers (2)
The hop-by-hop extension header for large datagrams (jumbograms).
Extension Headers (3)
7/13/2019 Tanenbaum Slides 5
83/83
Extension Headers (3)
The extension header for routing.