Knowledge checks


Channel partitioning protocols.



Which of the following statements is true about channel partitioning protocols?





 

That's Correct!

That's Incorrect. Try Again

1/7

Pure Aloha and CSMA.



Which of the following statements is true about both Pure Aloha, and CSMA (both with and without collision detection?





 

That's Correct!

That's Incorrect. Try Again

2/7

Polling and token-passing protocols.



Which of the following statements is true about polling and token-passing protocols?




 

That's Correct!

That's Incorrect. Try Again

3/7

Characteristics of Multiple Access Protocols (a).



Consider the following multiple access protocols that we've studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling.  Which of these protocols are collision-free (e.g., collisions will never happen)?




 

That's Correct!

That's Incorrect. Try Again

4/7

Characteristics of Multiple Access Protocols (b).



Consider the following multiple access protocols that we've studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling.  Which of these protocols requires some form of centralized control to mediate channel access?




 

That's Correct!

That's Incorrect. Try Again

5/7

Characteristics of Multiple Access Protocols (c).



Consider the following multiple access protocols that we've studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling.  For which of these protocols is the maximum channel utilization 1 (or very close to 1)?




 

That's Correct!

That's Incorrect. Try Again

6/7

Characteristics of Multiple Access Protocols (d).



Consider the following multiple access protocols that we've studied: (1) TDMA, and FDMA (2) CSMA (3) Aloha, and (4) polling.  For which of these protocols is there a maximum amount of time that a node knows that it will have to wait until it can successfully gain access to the channel?




 

That's Correct!

That's Incorrect. Try Again

7/7

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.

Copyright © 2010-2021 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu