Communication Networks Problem Sets: Solutions for CS/ECE 438 Fall 2007, Problem Set 3, Assignments of Organizational Communication

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

Pre 2010

Uploaded on 03/16/2009

koofers-user-y2p-1
koofers-user-y2p-1 ๐Ÿ‡บ๐Ÿ‡ธ

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS/ECE 438: Communication Networks Fall 2007
Problem Set 3 Solutions
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.
1. Learning Switches
Refer to Figure 1 for this question. The octagons with numbers denote learning switches, with ports
labeled by small numbers, and letters denote hosts (attached to LAN segments).
(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 Ais broadcast, so each switch knows which way Ais. The transmission
from Dto Agets heard by switches 5, 7, 2, 6, 1 on its path to A.Iโ€™s transmission to Dgets
rebroadcast by switches 3 and 4 to hosts Fand 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
1
2
4
5
6
7
A
B
C
D
E
F
G
H
I
1
2
33
Figure 1: Diagram for Problem 1.
1
pf3
pf4

Partial preview of the text

Download Communication Networks Problem Sets: Solutions for CS/ECE 438 Fall 2007, Problem Set 3 and more Assignments Organizational Communication in PDF only on Docsity!

CS/ECE 438: Communication Networks Fall 2007

Problem Set 3 Solutions

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.

  1. Learning Switches Refer to Figure 1 for this question. The octagons with numbers denote learning switches, with ports labeled by small numbers, and letters denote hosts (attached to LAN segments).

(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

A

B

C

D

F E

G

H

I

Figure 1: Diagram for Problem 1.

  1. Virtual Circuits

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.

D

0 โ†’ 5 2 โ†’ 1 1 โ†’ 2 2 โ†’ 3 1 โ†’ 4 0 โ†’ J

A

B

C

D

E

F

G

H I

J

K

L

M N

Figure 2: Diagram for Problem 2.

A

B

C

D E

F G

H

I

Figure 3: Diagram for Problem 3.