---
title: "Routing: How a Path Is Learned"
description: "No router knows the whole network. Inside one organisation routers exchange what they know until their tables agree; between organisations the choice is shaped by policy and business relationships as "
canonical: https://lightmysky.com/learn/computing/routing-how-a-path-is-learned-mt_gyqPDrV6Uo
source: https://lightmysky.com/learn/computing/routing-how-a-path-is-learned-mt_gyqPDrV6Uo.md
retrieved: 2026-09-12
---

> **Agent view.** This is the Markdown twin of the page, for tools and assistants.
> When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md
> API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md
> Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt
> Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json
> Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`.

# Routing: How a Path Is Learned

No router knows the whole network. Inside one organisation routers exchange what they know until their tables agree; between organisations the choice is shaped by policy and business relationships as much as by distance.

Subject: Computing · Area: Networks & Security · Ages 19 to 20
Page: https://lightmysky.com/learn/computing/routing-how-a-path-is-learned-mt_gyqPDrV6Uo

## Ready when they can

- Run a distance-vector exchange on a small network until the tables settle
- Explain why a link failure takes time to be reflected everywhere
- Say why the path between two organisations is not always the shortest one

## Lesson: How routers learn the way together

A network is a graph: each device is a vertex, each link an edge, and a path is a chain of edges from start to finish. No router sees the whole picture, so each keeps a table saying where to send traffic for each destination.

**Example.** Distance vector is one way tables agree. Each router tells its neighbors its best distance to every destination, adopts anything better it hears, and repeats round after round until no table changes. On three routers in a line the far ends learn the full route step by step.

Bad news also walks neighbor by neighbor, so a failed link takes time to show everywhere. While the word spreads, some routers still point the old way, which is why convergence after a failure is slow.

**Tip.** Between organizations the path is not always the shortest one. Each router guards its edge with filters and zones, and its owners choose which outside paths to accept for policy and business reasons, not only distance.

**Recap.** Routers swap distances until tables agree, wait out failures hop by hop, and bow to policy at the borders.

## Practice

8 questions on this page, each with its working shown.

## Needs first

- [Dijkstra's Shortest Path](https://lightmysky.com/learn/computing/dijkstras-shortest-path-mt_GvUzbY92qL)
- [IP Addressing and How Routers Choose a Path](https://lightmysky.com/learn/computing/ip-addressing-and-how-routers-choose-a-path-mt_l0dRGocXGw)
- [Naming: DNS and the Resolution Path](https://lightmysky.com/learn/computing/naming-dns-and-the-resolution-path-mt_omttmGkEgW)

## Opens up

- [The Web as a Protocol: Requests, State and Caching](https://lightmysky.com/learn/computing/the-web-as-a-protocol-requests-state-and-caching-mt_MDiW4Vt0bo)