Das Video kommt von YouTube: erst beim Abspielen verbindet sich die Seite mit YouTube (Google).
Distance Vector Routing | Bellman-Ford Algorithm in Computer Networks - Simplified
Das Wichtigste aus dem Video
Tipp auf eine Zeit – das Video springt genau dorthin.
Transkriptautomatisch erstellt · 19 Zeilen
- I'm going to show you how to solve a network using the distance Vector algorithm in a super easy manner so let's get started to begin with we'll
- create our first table we will call this round one all we have to do is write down the values we see in our Network for example if we take node a it has a
- cost of six to reach node b a cost of 8 to node c and a cost of three to node D now if you look at node C you'll notice that it's not directly connected to node
- d so we just put Infinity for now until we find a shorter root next we create a new table for round two and put zeros diagonally because the cost to reach the
- same node is always zero and it won't change now let's start finding the shortest paths will sum each column from left to right starting with column A our
- goal is to find the smallest sum for each connection let's start with column A and B now we've got 0 + 6 which is equal to 6 and since we don't have any
- other the previous value for now six is the smallest sum next row we've got 6 Plus 0 which is six same again and then we have 8 + 1 which is 9 because 6 is
- less than 9 we will ignore 9 next we have 3 + 2 which is 5 now because 5 is less than 6 our new minimum sum becomes five and we put that onto our new table
- we can follow the same procedure when looking at column A and C so for the first row we've got eight then 7even so 7 becomes the smallest minimum sum then
- we've got eight again and then Infinity so seven Remains the smallest sum between column A and C so we put that onto our new table we can do the same
- for column A and D this table shows the smallest cost between node a and the rest of the nodes
- for round one now we will look at column B and C and follow the same procedure to find the minimum sum now we'll do the same for column B and
- D now B becomes fixed and we will look at column c and d and simple as that we found the solution for round one but this isn't
- the end if youve noticed at the new table you can see that five 7 and three are in red it's because those values have changed from our initial table so
- from A to B the cost has changed from 6 to 5 and from a to c the cost has changed from 8 to 7 and from C to D it has changed from Infinity to three now
- our goal is to find a table which has no changes from the previous round until then we follow the same method we've done until now to find the smallest sum
- I'm going to let this algorithm continue until it finds the smallest cost between the
- nodes e this will be our final table because there are no changes from the previous
- table thank you for watching and if youve got any comments or feedback please let me know in the comments or write me an email thank you