Routing Loop

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.