Scribd
Upload
26 views

Network Layer V1

The document discusses the network layer and various routing algorithms. It covers key topics like store-and-forward packet switching, connectionless and connection-oriented services, and comparison of virtual circuits and datagrams. Specific routing algorithms covered include flooding, distance vector routing, link state routing, shortest path routing, hierarchical routing, and routing for mobile and ad hoc networks. Details are provided on concepts like Dijkstra's algorithm, count-to-infinity problems, learning about neighbors, and building/distributing link state packets.

Uploaded by

Truptiiii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views

Network Layer V1

The document discusses the network layer and various routing algorithms. It covers key topics like store-and-forward packet switching, connectionless and connection-oriented services, and comparison of virtual circuits and datagrams. Specific routing algorithms covered include flooding, distance vector routing, link state routing, shortest path routing, hierarchical routing, and routing for mobile and ad hoc networks. Details are provided on concepts like Dijkstra's algorithm, count-to-infinity problems, learning about neighbors, and building/distributing link state packets.

Uploaded by

Truptiiii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

The Network Layer

Source: PowerPoint presentation for educators provided by Tanenbaum , computer networks 4th edition .

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).

You might also like