Chapter 5
The Network Layer
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
Store-and-Forward Packet Switching
fig 5-1
The environment of the network layer protocols.
Implementation of Connectionless Service
Routing within a diagram subnet.
Implementation of Connection-Oriented Service
Routing within a virtual-circuit subnet.
Comparison of Virtual-Circuit and
Datagram Subnets
5-4
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
Routing Algorithms (2)
Conflict between fairness and optimality.
The Optimality Principle
(a) A subnet. (b) A sink tree for router B.
Shortest Path Routing
The first 5 steps used in computing the shortest path from A to D.
The arrows indicate the working node.
Flooding
5-8 top
Dijkstra's algorithm to compute the shortest path through a graph.
Flooding (2)
5-8
bottom
Dijkstra's algorithm to compute the shortest path through a graph.
Distance Vector Routing
(a) A subnet. (b) Input from A, I, H, K, and the new
routing table for J.
Distance Vector Routing (2)
The count-to-infinity problem.
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.
Learning about the Neighbors
(a) Nine routers and a LAN. (b) A graph model of (a).
Measuring Line Cost
A subnet in which the East and West parts are connected by two lines.
Building Link State Packets
(a) A subnet. (b) The link state packets for this subnet.
Distributing the Link State Packets
The packet buffer for router B in the previous slide (Fig. 5-13).
Hierarchical Routing
Hierarchical routing.
Broadcast Routing
Reverse path forwarding. (a) A subnet. (b) a Sink tree. (c) The
tree built by reverse path forwarding.
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.
Quality of Service
• Requirements
• Techniques for Achieving Good Quality of Service
• Integrated Services
• Differentiated Services
• Label Switching and MPLS
Requirements
5-30
How stringent the quality-of-service requirements are.
Internetworking
• How Networks Differ
• How Networks Can Be Connected
• Concatenated Virtual Circuits
• Connectionless Internetworking
• Tunneling
• Internetwork Routing
• Fragmentation
Connecting Networks
A collection of interconnected networks.
How Networks Differ
5-43
Some of the many ways networks can differ.
How Networks Can Be Connected
(a) Two Ethernets connected by a switch.
(b) Two Ethernets connected by routers.
Concatenated Virtual Circuits
Internetworking using concatenated virtual circuits.
Connectionless Internetworking
A connectionless internet.
Internetwork Routing
(a) An internetwork. (b) A graph of the internetwork.
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
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
The Internet is an interconnected collection of many networks.
The IP Protocol
The IPv4 (Internet Protocol) header.
The IP Protocol (2)
5-54
Some of the IP options.
IP Addresses
IP address formats.
IP Addresses (2)
Special IP addresses.
Subnets
A campus network consisting of LANs for various departments.
Subnets (2)
A class B network subnetted into 64 subnets.
Internet Control Message Protocol
5-61
The principal ICMP message types.
ARP– The Address Resolution Protocol
Three interconnected /24 networks: two Ethernets and an FDDI ring.
Dynamic Host Configuration Protocol
Operation of DHCP.
OSPF – The Interior Gateway Routing
Protocol
(a) An autonomous system. (b) A graph representation of (a).
OSPF (2)
The relation between ASes, backbones, and areas in OSPF.
OSPF (3)
5-66
The five types of OSPF messeges.
BGP – The Exterior Gateway Routing
Protocol
(a) A set of BGP routers. (b) Information sent to F.
The Main IPv6 Header
The IPv6 fixed header (required).
Extension Headers
5-69
IPv6 extension headers.
Extension Headers (2)
The hop-by-hop extension header for large datagrams (jumbograms).
Extension Headers (3)
The extension header for routing.