Transcription of Lecture 13: Distance-vector Routing
{{id}} {{{paragraph}}}
Example: confidence
Lecture 13: Distance-vector Routing
Lecture 13: Distance-vector Routing ". CSE 123: Computer Networks Alex C. Snoeren HW 3 due now! Lecture 13 Overview". distance vector Assume each router knows its own address and cost to reach each of its directly connected neighbors Bellman-Ford algorithm Distributed route computation using only neighbor's info Mitigating loops Split horizon and posion reverse CSE 123 Lecture 13: Distance-vector Routing 2. Bellman-Ford Algorithm". Define distances at each node X. dx(y) = cost of least-cost path from X to Y. Update distances based on neighbors dx(y) = min {c(x,v) + dv(y)} over all neighbors V. v! 2 y! 3 1. 1. u! x! 4 z! 2 1. 5 t! du(z) = min{c(u,v) + dv(z), w! 4 3 c(u,w) + dw(z)}.
Lecture 13 Overview" Distance vector Assume each router knows its own address and cost to reach each of its directly connected neighbors Bellman-Ford algorithm Distributed route computation using only neighbor’s info Mitigating loops Split horizon and posion reverse CSE 123 – Lecture 13: Distance-vector Routing 2
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: