Distance-Vector Update (z,y) c(x, z) d(x,y) Update(x, y, z) d <c(x, Z)+d(z, y cost of path from x to y with first hop z if d< d(x,y) Found better path return d Updated cost/next hop else return d(x, y), nexthop(x,y)#Existing cost/next hop 9/28/2006 Lecture 10: Intra-Domain routing 89/28/2006 Lecture 10: Intra-Domain Routing 8 Distance-Vector Update • Update(x,y,z) d  c(x,z) + d(z,y) # Cost of path from x to y with first hop z if d < d(x,y) # Found better path return d,z # Updated cost / next hop else return d(x,y), nexthop(x,y) # Existing cost / next hop x z y c(x,z) d(z,y) d(x,y)