


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The solutions to problem set 3 of the communication networks course (cs/ece 438) offered at the university of x in the fall of 2007. The problem set covers topics such as learning switches, virtual circuits, and dijkstra's algorithm. Students are expected to understand the concepts of switching tables, forwarding tables, least-cost paths, and distance vector algorithms.
Typology: Assignments
1 / 4
This page cannot be seen from the preview
Don't miss anything!



NOTE: There will be no automatic extension for this assignment. If you do not hand in the assignment by the start of class on Oct 17, you will get no credit for the assignment.
(a) Suppose switching tables for all switches are initially empty, and then the following two transmis- sion occur: A โ G, D โ A. The following transmission is I โ D. Which hosts hear the third transmission? The first transmission from A is broadcast, so each switch knows which way A is. The transmission from D to A gets heard by switches 5, 7, 2, 6, 1 on its path to A. Iโs transmission to D gets rebroadcast by switches 3 and 4 to hosts F and E, and then it also gets overheard by hosts B, C, and of course D. (b) Show the switching table at switch 1 after the three transmissions. The switching table is: Host Port A 1 D 1 I 3
Figure 1: Diagram for Problem 1.
Figure 2 shows hosts (AโN) connected by virtual circuit routers (1โ6). Assume that each VC may have a different VCID on each link, and VCIDs are assigned starting at 0 and using the next available ID. Suppose that there are virtual circuits established between: F โ I, M โ A, C โ N , F โ B, E โ B, in that order.
(a) Show the forwarding table at router number 3. Port In Vc In Port Out Vc Out * 2 0 4 0 (F โ I) 3 0 2 0 (M โ A) 2 1 3 0 (C โ N ) (b) Suppose there is an additional virtual circuit formed from D to J. Show the virtual circuit IDs that a packet will use traveling along that virtual circuit.
0 โ 5 2 โ 1 1 โ 2 2 โ 3 1 โ 4 0 โ J
Figure 2: Diagram for Problem 2.
Figure 3: Diagram for Problem 3.