Link state routing (OSPF) in Computer Networks - Full Explanation

Introduction

Imagine you need to find the fastest way to get to a friend's house in a city where roads can change or close. Link state routing helps routers find the best path through a network by sharing detailed road conditions with each other.

Explanation

Link State Advertisements (LSAs)

Each router in the network creates a message called a Link State Advertisement. This message describes the router's connections to its neighbors and the cost to reach them. Routers share these LSAs with all other routers to build a complete map of the network.

LSAs allow every router to know the exact state of all links in the network.

Building the Network Map

After receiving LSAs from all routers, each router builds a map of the entire network. This map shows all routers and how they connect. It is like having a detailed city map with all roads and intersections.

Each router independently creates the same complete network map using LSAs.

Shortest Path Calculation

Using the network map, routers run an algorithm called Dijkstra's algorithm to find the shortest and most efficient path to every other router. This helps in deciding where to send data packets to reach their destination quickly.

Dijkstra's algorithm finds the best path based on link costs in the network map.

Reliable Updates and Synchronization

Routers send LSAs reliably using a special flooding process to ensure all routers have the latest information. When a link changes, routers quickly update and share new LSAs to keep the network map accurate.

Reliable flooding keeps all routers synchronized with current network status.

Real World Analogy

Imagine a group of friends in a city sharing live updates about road closures and traffic jams. Each friend tells everyone about their local streets, so everyone can plan the fastest route to meet up. When a road closes, the friends quickly share the news to avoid delays.

Link State Advertisements (LSAs) → Friends sharing details about their local streets and traffic

Building the Network Map → Everyone creating a complete city map from all shared street information

Shortest Path Calculation → Choosing the fastest route to meet based on the city map

Reliable Updates and Synchronization → Friends quickly informing each other about new road closures or traffic changes

Diagram

Diagram

┌───────────────┐       ┌───────────────┐       ┌───────────────┐
│   Router A    │──────▶│   Router B    │──────▶│   Router C    │
│  (LSA sent)   │       │  (LSA sent)   │       │  (LSA sent)   │
└──────┬────────┘       └──────┬────────┘       └──────┬────────┘
       │                       │                       │
       ▼                       ▼                       ▼
┌─────────────────────────────────────────────────────────┐
│                 Network Map (Graph)                     │
│  Nodes: Routers A, B, C                                 │
│  Edges: Links with costs                                │
└─────────────────────────────────────────────────────────┘
       │
       ▼
┌─────────────────────────┐
│ Shortest Path Calculation│
│  Using Dijkstra's Algo   │
└─────────────────────────┘

This diagram shows routers sending LSAs to build a network map and then calculating the shortest path.

Key Facts

Link State Advertisement (LSA) → A message sent by routers describing their connected links and costs.

Dijkstra's Algorithm → An algorithm used to find the shortest path between nodes in a network.

Flooding → A process where LSAs are reliably sent to all routers to keep network information updated.

OSPF → Open Shortest Path First, a common link state routing protocol.

Common Confusions

Believing link state routing only knows about direct neighbors.

Believing link state routing only knows about direct neighbors. Link state routing shares information about all links in the network, allowing routers to build a complete map, not just their neighbors.

Thinking LSAs are sent only to neighbors.

Thinking LSAs are sent only to neighbors. LSAs are flooded to all routers in the network, ensuring everyone has the same network view.

Summary

Link state routing shares detailed link information so every router builds a full network map.

Routers use this map with Dijkstra's algorithm to find the shortest path to all destinations.

Reliable flooding of LSAs keeps all routers updated about network changes quickly.