Distance-Vector is a type of routing protocol used in computer networks to determine the best path for data to travel. It works by having each router share its knowledge of the network with its immediate neighbors. Each router maintains a table that lists the distance to various destinations, which is updated based on the information received from neighboring routers. In a Distance-Vector protocol, the distance is typically measured in hops, or the number of routers a packet must pass through to reach its destination. This method can lead to slower convergence times and potential routing loops, but it is simpler to implement compared to other protocols like Link-State.