计算机网络第四章作业,计算机网络第四章作业

第四章

P450-22: Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table.

Answer

Problem 22

Step N’D(s),p(

s) D(t),p(

t)

D(u),p(

u)

D(v),p(

v)

D(w),p(

w)

D(y),p(y

)

D(z),p

(z)

0x∞∞∞8,x6,x6,x∞1xw∞∞14,w8,x6,x∞2xwy∞15,y14,w7,y18,y 3xwyv∞11,v10,v18,y 4xwyvu14,u11,v18,y 5xwyvut12,t16,t 6xwyvuts16,t 7xwyvuts

z

y t z

x v s

w u

Routing Table: