Ls Algorithm

1406
The Link-State (LS) Routing Algorithms
The Link-State (LS) Routing Algorithms

Remember that in a link-state algorithm, the network topology and all link costs are known, that is, available as input to the LS algorithm. In fact this is accomplished by having each node broadcast link-state packets to all other nodes in the network, with each link-state packet

Tags nodes, broadcast algorithms, loop, ls algorithm, routers
1057
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
1017
Distance-Vector Algorithm
Distance-Vector Algorithm

When a node running the DV algorithm detects a change in the link cost from itself to a neighbor (Lines 10-11), it updates its distance vector (Lines 13-14) and, if there's a change in the cost of the least-cost path, informs its neighbors (Lines 16-17) of its new distance vector, Figure

Tags distance vector, routing loop, poisoned reverse, ls algorithm, forwarding 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.