CSMA/CD File Transmission and Contention using Binary Exponential Backoff

$1.50$0.752106 reads

Question

Two CSMA/CD stations are each trying to transmit long (multiframe) files. After each frame is sent, they contend for the channel, using the binary exponential backoff algorithm. What is the probability that the contention ends on round k, and what is the mean number of rounds per contention period?

Summary

The question belongs to Computer Science and particularly to Networking. The question here is about two CSMA/CD transmitting files and use backoff algorithm for contention. The number of rounds per contention have been calculated.

Total Word Count 128  

 

Add to Cart