Network Routing Algorithms and Protocols Overview
Understanding network routing algorithms and protocols is crucial in the field of networking. This content provides insights into the initialization process, loop prevention mechanisms, and the use of algorithms like OSPF and IS-IS. It also touches on routing protocols such as RIP and EIGRP, explaining key concepts and their applications. The content covers topics like shortest path calculation, link analysis, and node updates essential for efficient data transmission in networks.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
Initialization Loop S = {u} for all nodes v if (v is adjacent to u) D(v) = c(u,v) else D(v) = add w with smallest D(w) to S update D(v) for all adjacent v: D(v) = min{D(v), D(w) + c(w,v)} until all nodes are in S Used in OSPF and IS-IS 4
2 2 1 1 3 3 1 1 4 4 2 2 1 1 5 5 4 4 3 3 2 2 1 1 3 3 1 1 4 4 2 2 1 1 5 5 4 4 3 3 5
2 2 1 1 3 3 1 1 4 4 2 2 1 1 5 5 4 4 3 3 2 2 1 1 3 3 1 1 4 4 2 2 1 1 5 5 4 4 3 3 6
2 link v y 1 3 1 v w x y z s t (u,v) (u,w) (u,w) (u,v) (u,v) (u,w) (u,w) 4 x z u 2 1 5 t w 4 3 s 7
2 v y 1 du(z) = min{c(u,v) + dv(z), c(u,w) + dw(z)} 3 1 4 x z u 2 1 5 Used in RIP and EIGRP t w 4 3 s 8
2 2 v v y y 1 1 3 3 1 1 4 4 x x 2 2 1 1 u z u z 5 5 t t w w 4 4 3 3 s s dy(z)=1 dv(z)= min{2+dy(z), 1+dx(z)} = 3 dx(z)=4 9
2 2 v v y y 1 1 3 3 1 1 4 4 x x 2 2 1 1 u z u z 5 5 t t w w 4 4 3 3 s s dw(z)= min{1+dx(z), 4+ds(z), 2+du(z)} = 5 du(z)= min{3+dv(z), 2+dw(z)} = 6 10
