Distance Vector

Distance Vector is a method used in computer networks for routing data. Each router maintains a table listing the best known distance (like hops or cost) to reach every other network and the next router to send data to along the way. Routers share their tables periodically with neighbors, updating their own information based on received data. This process helps the network dynamically find the most efficient paths, adapting to changes such as failures or new routes, ensuring data reaches its destination accurately and efficiently.