distance vector routing

Concept

Bellman-ford

• router can only know information about the local network
• rely on partial knowledge from neighbouring routers to see the big picture
• distributed computing, each router where is the number of neighbours

Network diameter

• longest distance between two points in the network

Application

Stable network

do the smallest direct connections first

Re-stablization
TODO

• t=1, y and z detect error