Suppose all nodes with 4-bit address are contending the channel with the binary countdown protocol.

1. Suppose all nodes with 4-bit address are contending the channel with the binary countdown protocol. 

a) Explain which node is the most likely to be starved from sending a packet and how. 

b) How is this case like an adaptive tree walk case? 



2. Consider four wireless stations, A, B, C, and D. Station A can communicate with all other stations. C can communicate with all other stations. B and D can communicate with A and C only. 

(a) Draw a diagram to show a possible topology the communication 

(b) Can more than one transmission happen simultaneously and why? 



3. In a classic Ethernet as in Figure 4-15, suppose the network interfaces run at 100 Mbps, the expected network length is 5000 meters with the cable that has propagation speed of 2/3 of speed of light. Calculate the minimum frame size for collision detection to be effective. 



4. Refer to Figure 4-44. Suppose B1, B2, B3, B4 and B5 respectively have IDs of 5, 4, 3, 2, and 1. 

a) draw the spanning tree with each link equal in distance 

b) draw the spanning tree with the transmission time as the distance. Assume 

links: B1-B2 at 10 Mbps, B2-B4 at 20 Mbps, B3-B4 at 10 Mbps, B1-B3 at 20 Mbps, B3-B5 at 5 Mbps, B4-B5 at 10 Mbps.

Attachments: 

Click Here To Get More on This Topic......