Distance vector

Also written: distance vector routing

A routing protocol design in which each router tells its neighbors its whole table with distances, and each neighbor adds one hop and keeps the shortest route. It is simple but slow to notice failures; RIP is the old example.