Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Distance vector routing by Siddique Ibrahim 12004 views
- Link state routing protocol by Aung Thu Rha Hein 10209 views
- Routing algorithm by farimoin 9402 views
- Distance Vector Routing - RIP by networkingcentral 3753 views
- Ppt of routing protocols by Bhagyashri Dhoke 38157 views
- Routing by Amit Pandey 3568 views

16,103 views

Published on

further more about the distance vector routing howz it is work

No Downloads

Total views

16,103

On SlideShare

0

From Embeds

0

Number of Embeds

4

Shares

0

Downloads

0

Comments

0

Likes

13

No embeds

No notes for slide

- 1. B Y G A U R A V S I N G H R A W A T1 2 3 1 6 E N 0 0 9S Y S T E M E N G I N E E R I N GDistance Vector RoutingAlgorithm
- 2. Solution of Distance vector Routing Algorithm Distance Vector Routing algorithm is a distributedalgorithm. This routing algorithm is a iteration algorithm.When ever a packet comes to router the neighboringrouter will give the vector table and a new vectortable is created at that router. Now we understand this with a simple example:
- 3. Distance Vector Routing AlgorithmACBDFEVectortableNewroutingtablePackettransfer torouter A
- 4. A B C D E F Vector table of B (1, 0, 3, 2, 4, 3). Vector table of D (2, 1, 2, 0, 1, 1). Vector table of C (3, 2, 0, 4, 5, 6).measured delay of B,D,C from A are 3,1,2.Now calculate the final routing table of A=?A, B, C, D, E, F Routing Table of A via B=(0, 3, 6, 5, 7, 6). AB=AB+BB=3+0=3; AC=AB+BC=3+3=6; AD=AB+BD=3+2=5; AE=AB+BE=3+4=7; AF=AB+BF=3+3=6; AA=0;
- 5. A B C D E F Routing Table of A via D: (0, 2, 3 , 1, 2, 2) AB=AD+DB=1+1=2 AC=AD+DC=1+2=3 AD=AD+DD=1+0=1 AE=AD+DE=1+1=2 AF=AD+DF=1+1=2A B C D E F Routing Table of A via C: (0, 4, 2, 6, 7, 8) AB=AC+CB=2+2=4 AC=AC+CC=2+0=2 AD=AC+CD=2+4=6 AE=AC+CE=2+5=7 AF=AC+CF=2+6=8
- 6. Now the final routing table of A:Taking minimum value of A via (B,C,D):= (0, 2, 2, 1, 2, 2)router used for the routing table of A is;= (0, 2, 2, 1, 2, 2)(_, D, C, D, D, D).As similarly we find the routing table of all otherrouter.

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment