Assignment 4

Question 1: (30 marks) Consider the 8 8 Batcher-Banyan switch. Assume the incoming traffic is i.i.d. (independent and identically distributed). Throughput is referring to the per output port throughput. i) ii) What is the maximum throughput of this switch? [10 marks] Label the input and output ports from 0 to 7 (uppermost as port 0). Five packets arrived to the input side: packet 1 at input port 1, destined to output port 7; packet 2 at input port 2, destined to output port 2; packet 3 arrives at input port 3, destined to output port 6; packet 4 at input port 4, destined to output port 3; packet 5 arrives at input port 6, destined to output port 6. Which packets will be delivered to their destined output ports at current round? Justify your answer. [20 marks]

Question 2: (20 marks) Six stations (S1-S6) are connected to an extended LAN through transparent bridges (B1 and B2), as shown in the figure below. Initially, the forwarding tables are empty. Suppose the following stations transmit frames: S1 transmits to S2, S3 transmits to S1, S2 transmits to S4, S5 transmits to S2, and S6 transmits to S5. Fill in the forwarding tables with appropriate entries after the frames have been completely transmitted.

Bridge 1 Station S1 S3 S2 S5 S6 Port # 1 2 1 2 2

Bridge 2 Station S1 S3 S2 S5 S6 1 1 1 2 2 Port #

Question 3: Consider the Ethernet. After the fifth collision, what is the probability that the random backoff value that a node chooses is 8? How many seconds of delay does the result K=8 correspond to on a 10Mbps Ethernet? After 5th collision, the adapter chooses form {0,1,2,3,..31}2^5=32 the probability that it chooses 8 is 1 in 32 (1/32). Seconds of delay = 8 x 512 = 4096 = 409.6 microseconds

Question 4: (30 marks) Figure 1 shows a LAN topology with bridges to interconnect different LAN segments. Spanning tree algorithm is used for deciding the forwarding path. Please specify the path followed by a frame from LAN segment 2 to LAN segment 5.
LAN7
3 2 2 2

B4
1

B5
1

B6
1

LAN5 LAN4
2

LAN6 LAN3
3

B1
1

B3
1

B2
1

LAN2

LAN1

Figure 1