pThe Distance vector algorithm is iterative, asynchronous and distributed. Distributedspan style=color: #2f4f4f;strong./strong/span It is distributed in that each node receives information from one or more of its directly attached neighbors, performs calculation and then distributes the result back to its neighbors. /p
pstrong style=color: #2f4f4f;Iterative:/strong It is iterative in that its process continues until no more information is available to be exchanged between neighbors./p
pstrong style=color: #2f4f4f;Asynchronous:/strong It does not require that all of its nodes operate in the lockstep with each other./p
pstrong style=color: #2f4f4f;Iterative:/strong It is iterative in that its process continues until no more information is available to be exchanged between neighbors./p
pstrong style=color: #2f4f4f;Asynchronous:/strong It does not require that all of its nodes operate in the lockstep with each other./p
