Computer Networks · M2 · formulas
Routing updates and path costs
All formulas and rules in one place
M2 · symbols explained; worked examples linked below
![d[v]\leftarrow\min(d[v],d[u]+w(u,v))](https://deep-learning-study-room.vercel.app/cn/math/651d18e4e3d7619d.svg)
LaTeX: d[v]\leftarrow\min(d[v],d[u]+w(u,v))Old destination distance versus cost to u plus edge u→v.
LaTeX: D_x(y)=\min_{v\in N(x)}\{c(x,v)+D_v(y)\}Distance vector: local link cost plus neighbour advertisement.
LaTeX: \mathrm{RIP\ metric}=\min(16,\mathrm{link\ cost}+\mathrm{advertisement})16 represents unreachable. Ordinary hop increments commonly equal 1.