retagged by
4,947 views
2 votes
2 votes

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?

  1. $\Sigma kP_k$
  2. $kP_k$
  3. $\Sigma P_k$
  4. none
retagged by

1 Answer

0 votes
0 votes

After k consecutive collisions (with probability p), a station delays retransmission by a random interval uniformly distributed between 0 and 2k , (so the packet is transmitted k+1 times in total).
Number the attempts starting from 1. Attempt i is distributed among 2i−1 slots . Thus, the probability of a collision on attempt i is 1/(2i−1) or 2−(i−1). The probability that the first k-1 attempts will fail is then:
Pk = (1 − 2 −(k−1)) · $· \prod (i=1  to ( k-1)) $ 2 −(i−1) , which can be simplified to:
Pk = (1 − 2 −(k−1)) · 2 − ((k−1)·(k−2)) /2 ,
so, the expected number of rounds is simply: $\sum_{k}^{}$k.Pk

So, the answer is (A)
 

Ref: http://omikron.eit.lth.se/ETSN01/ETSN01/tutorials/Tutorial8.pdf

Related questions

0 votes
0 votes
0 answers
2
Divyanshum29 asked Oct 30, 2018
271 views
If CSMA transmits 8 stations network data in single channel whats is the chip code for station 5 {Assume that W1=[+1]}how to solve itsolution given is. 1111-1-1-1-1.
2 votes
2 votes
2 answers
4
VS asked Jan 6, 2018
4,770 views
In standard ethernet with transmission rate of 20 Mbps, the length of the cables is 2500 m and the size of frame is 512 bits. The propagation speed of a signal in a cable...