MASSEY UNIVERSITY
Tutorial: Routing algorithm simulation
Copyright By PowCoder代写 加微信 powcoder
DISTANCE VECTOR ALGORITHM:
Given a network comprising of 4 routers connected via certain links, with the numbers indicating the time cost for each link between the routers, simulate the DV algorithm and show the sequence of steps in accomplishing the first distance table update of Router A.
The table below shows the initial values of Router A’s distance table:
Destination
a) Compute for the distance vector advertisements from Routers B, C, and D. Show the minimum cost information as an array of 4 integers in the order A, B, C, D:
B advertises its minimum costs as: 2, 0, 15, 3
C advertises its minimum costs as: 4, 15, 0, 10
D advertises its minimum costs as: 12, 3, 10, 0
Compute for the first update on router A’s table if router A receives packets with the minimum cost information from the other routers: B, C and D. Show your complete solution by accomplishing the tables given below.
b) Show the updated distance table of router A after receiving a packet from router B.
Destination
c) Show the updated distance table of router A after receiving a packet from router C.
Destination
d) Show the updated distance table of router A after receiving a packet from router D
Destination
e) Show the updated distance table of router A after applying Poisoned Reverse.
Destination
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com