1 / 7

Part 2: Simulation Question

7. C. B. 6. 5. 1. 8. D. A. 2. 2. 6. 3. F. E. 7. Part 2: Simulation Question

rtuttle
Download Presentation

Part 2: Simulation Question

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 7 C B 6 5 1 8 D A 2 2 6 3 F E 7 Part 2: Simulation Question Given the graph below, where weights are assigned on the edges, simulate the first three updates which will be carried out on the routing table information for node 6 according to each of the distributed route computation algorithms discussed in class and shown in the textbook and notes. (a) Distance Vector Routing 1) Give the initial Routing Table for node A in the graph. 2) Show what happens when A receives the first Distance Vector from B. 3)Show what happens when A receives the second Distance Vector from F. Explain your answers. (b) Link-State Routing (SPF) from Dijkstra’s algorithm 1) Give the initial Routing Table for node A in the graph. 2) Show one complete iteration of algorithm 13.1 and the resulting routing table for A. 3)Show a second complete iteration of algorithm 13.1 and the resulting routing table for A. Explain your answers.

  2. 7 C B 6 5 1 8 D A 2 2 6 3 F E 7 Distance Vector • Initial routing table for A Algorithm 13.2

  3. Distance Vector 2. A receives 1st vector from B B [(A,6), (F,2),(C,7)] 7 C B 6 5 1 8 D A 2 2 6 3 F E 7 Routes introduced by B in RED

  4. Distance Vector 3. A receives 2nd vector from F F[(A,3), (B,2), (C,8), (D,2), (E,7)] 7 C B 6 5 1 8 D A 2 2 6 3 F E 7 Routes introduced by F in GREEN

  5. Link-State (Algorithm 13.1) 1. Initial 7 C B Set S 6 5 1 8 D A 2 2 6 3 F E 7

  6. Link-State 2. 1st iteration • Choose F since D[F] is shortest. • Remove F from S. • S: • c = D(F) + weight(F, v) for every node v still in S. Then compare c with D[v]: • c[B] = 3 + 2 = 5 < D[B] = 6 • c[C] = 3 + 8 = 11 < D[C] = inf • c[D] = 3 + 2 = 5 < D[D] = inf • c[E] = 3 + 7 = 10 < D[E] = inf • Thus, update tables with shorter values. 7 C B 6 5 1 8 D A 2 2 6 3 E F 7

  7. Link-State • Choose B (D is fine too, because both D[B] and D[D] are shortest) • Remove B from S. • S: • c = D(B) + weight(B, v) for every node v still in S. Then compare c with D[v]: • c[C] = 5 + 7 = 12 > D[C] = 11  no update for C • c[D] = 5 + 4 = 9 > D[D] = 5  no update for D • c[E] = 5 + 9 = 14 > D[E] = 10  no update for E • Thus, the tables remains same as step 2. 3. 2nd iteration 7 C B 6 5 1 8 D A 2 2 6 3 F E 7 Alternatively, If D is chosen instead of B at this step, the table is:

More Related