Distanzvektoren

Distanzvektoren, also known as distance vectors, are a fundamental concept in graph theory and network routing protocols. They represent the shortest path distance from a specific source node to all other reachable nodes in a graph. Each node in a network maintains a distance vector, which is essentially a table or list associating each destination node with the estimated minimum cost or number of hops required to reach it.

These vectors are dynamic and are updated periodically or when changes occur in the network topology. In the context of routing protocols like RIP (Routing Information Protocol), distance vectors are exchanged between neighboring routers. A router receives the distance vectors from its neighbors and uses this information to update its own distance vector. If a neighbor offers a shorter path to a particular destination, the router will update its entry accordingly.

The core principle behind distance vector routing is the Bellman-Ford algorithm or its variations. While simple and efficient for smaller networks, distance vector routing can suffer from issues like slow convergence and the count-to-infinity problem, especially in large or frequently changing networks. Despite these limitations, distance vectors remain a crucial building block for understanding how networks learn about the best paths to reach different destinations.