Page 1 of 1
Q1: Routing Algorithms [15 Marks) w 6 2 N 4 4 U X 10 4 V Y الا 3 Figure : Node Network Using the link state (LS) algorit
Posted: Sat May 14, 2022 7:02 pm
by answerhappygod
- 1 (20.59 KiB) Viewed 32 times
Q1: Routing Algorithms [15 Marks) w 6 2 N 4 4 U X 10 4 V Y الا 3 Figure : Node Network Using the link state (LS) algorithm routing, compute the least-cost path from any 3 nodes [U,V, W, X, Y) in the network shown in Figure 1 to all the possible destinations in the network. Show the table summary of the algorithm's computation of the paths.