Dijskstra Algorithm

The Distance-Vector (DV) Routing Algorithm
The Distance-Vector (DV) Routing Algorithm

The LS algorithm is an algorithm using global information, the distance-vector (DV) algorithm is iterative, asynchronous, and distributed. It is distributed in that each node receives some information from one or more of its directly attached neighbors, performs a calculation, and then

Tags ls algorithm, nodes, dijskstra algorithm, asynchronous algorithm, routing tables
Page 0 of 1 Previous 1 Next

Copy Right

The contents available on this website are copyrighted by TechPlus unless otherwise indicated. All rights are reserved by TechPlus, and content may not be reproduced, published, or transferred in any form or by any means, except with the prior written permission of TechPlus.