Computer Network

Assume that three routers, U, V and W, have link costs: c(U,V) = 4, c(U,W) = 50 and c(V,W) = 1. Using the Bellman-Ford algorithm, the common routing table for all routers is:

U V W

U 1 4 5

V 4 1 1

W 5 1 1.

A) True

B) False

Computer Network

Assume that three routers, U, V and W, have link costs: c(U,V) = 4, c(U,W) = 50 and c(V,W) = 1. Using the Bellman-Ford algorithm, the common routing table for all routers is:

U V W

U 1 4 5

V 4 1 1

W 5 1 1.

A) True

B) False