IDS

I am so thankful for your help!

First of all, I am very thankful for your help! I tried to finish the other tables, could you maybe tell me if I am right? |Step | Router A | 0 | [ (0,A) (/,/) (/,/) (/,/) ] 1 | [ (0,A) (2,B) (1,C) (/,/) ] 2 | [ (0,A) (2,B) (1,C) (2,C) ] |Step | Router B | 0 | [ (/,/) (0,B) (/,/) (/,/) ] 1 | [ (2,A) (0,B) (4,C) (/,/) ] 2 | [ (2,A) (0,B) (3,A) (5,C) ] 3 | [ (2,A) (0,B) (3,A) (4,A) ] |Step | Router C | 0 | [ (/,/) (/,/) (0,C) (/,/) ] 1 | [ (1,A) (4,B) (0,C) (1,D) ] 2 | [ (6,B) (3,A) (0,A) (1,D) ] |Step | Router D | 0 | [ (/,/) (/,/) (/,/) (0,D) ] 1 | [ (2,A) (0,B) (1,C) (0,D) ] 2 | [ (2,C) (4,C) (1,C) (0,D) ] 3 | [ (6,C) (3,C) (1,C) (0,D) ] I have no idea why I have so much trouble with such a basic task I guess X-X

So here is the fullt text linked to the picture of the network: The picture shows a Network with 4 Routers (A-D) and the linkcosts. The routing table should be in the following format: Step | Router A | Router B | Router C | Router D | 0 | [ (0,A) (/,/) (/,/) (/,/) ] | [ (/,/) (0,B) (/,/) (/,/) ] | [ (/,/) (/,/) (0,C) (/,/) ] | [ (/,/) (/,/) (/,/) (0,D) ] | The tuple (x,y) shows the costs and the next-hop target. The target is given through the order. (This means every vextor in the table shows the distance and the next hop to the targets A, B, C and D in this order. At the start the routing tables are empty - the routers do not even know their neighbours. The Routers reach themselves with the cost of 0. The routers start now to snyc in periodic time distances. Stop when you have reached a convergent status. Note: The solution depends on the order the packages are send - so lets say all routers send their packages at the exact same time. -translated So it says that all of them send their packages at the same time. my guess was to maybe do it like: Step | Router | 0 | [ (0,A) (/,/) (/,/) (/,/) ] 1 | [ (0,A) (2,B) (1,C) (/,/) ] 2 | [ (0,A) (2,B) (1,C) (1,D) ] But I am still kinda clueless tbh :´D

Thanks for your fast reply! So it would go like that i think: B : (2/A) (0/B) (4/C) (5/D) C : (1/A) (4/B) (0/C) (1/D) D : (2/A) (5/B) (1/C) (0/D) But what about those "steps" on the left side? Cause it says step 0-3. :/

So while learning for an exam I came across the following sample: I have to create a routing table to the given network (attachement). There are 4 Routers (A-D) and the numbers on the connecting lines are the linkcosts. The routing tables are in the given format. Step | Router A | Router B | Router C | Router D | 0 | [ (0,A) (/,/) (/,/) (/,/) ] | [ (/,/) (0,B) (/,/) (/,/) ] | [ (/,/) (/,/) (0,C) (/,/) ] | [ (/,/) (/,/) (/,/) (0,D) ] | The tuples (x,y) show the costs and the Next-Hop target. You have to follow the given sequence and every vector in the table shows the distance and the Next-Hop targets. Right now the routing tables are empty and the routers dont even know their neighbours (given through (/,/). The cost of a Router reaching to itself is 0. I know its kinda off topic but since I couldnt find a solution in the internet i was hoping one of you guys could help me solve and understand it. Best regards, IDS