Page "Routing" Paragraph 13

The algorithm operates in a very simple manner.

When a node first starts, it only knows of its immediate neighbours, and the direct cost involved in reaching them.

( This information, the list of destinations, the total cost to each, and the next hop to send data to get there, makes up the routing table, or distance table.

) Each node, on a regular basis, sends to each neighbour its own current idea of the total cost to get to all the destinations it knows of.

The neighbouring node ( s ) examine this information, and compare it to what they already ' know '; anything which represents an improvement on what they already have, they insert in their own routing table ( s ).

Over time, all the nodes in the network will discover the best next hop for all destinations, and the best total cost.