Algorithmcore
Distance-vector routing
Also called Bellman-Ford routing, RIP, routing information protocol.
Routers exchange distance estimates with neighbours and relax them.
Routers exchange distance estimates with neighbours and relax them.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DWVTYT Edit this page History Report an error