Distance vector–based routing algorithms (also known as Bellman-Ford-Moore algorithms) pass periodic copies of a routing table from router to router and accumulate distance vectors.

A branch and price algorithm is developed to solve instances of the model. The algorithm provides optimal solutions in reasonable computation time for problems involving as many as 10 candidate ...

In this paper, the authors survey the public presentation between two adaptive routing algorithms: Link State Algorithm (LSA), which is centralized algorithm and Distance Vector Algorithm (DVA ...

These protocols are like DSR (Dynamic Source Routing), AODV (Ad-hoc On-demand Distance Vector routing algorithm) and TORA (Temporally Ordered Routing Algorithm) like more.

We study an extension of the capacitated arc routing problem (CARP) called the capacitated arc routing problem with deadheading demand (CARPDD). This problem extends the classical capacitated arc ...