- Let ,
Probability of transmitting for a single station is p. And also assume that there is n number of stations.
The probability of one station can transmit in a given slot with probability of transmission p from n stations is
nc1 * p *(1-p)(n-1) ....(i)
now, nc1 = n
so , (i) becomes n*p* (1-p)(n-1)
Now in problem
each host has to be provided a minimum throughput of 0.16 frames per time slot
so for n host , throughput becomes 0.16n.
and each host always has data to send and transmits with probability p = 0.2 in every slot
so, for n host . total data send = n p (1-p)n-1
put p = 0.2 in above equation,
we get , n * 0.2 *(0.8)(n-1)
as both are deals with total amount of data send in a given time period ..
0.16 n = n * 0.2 *(0.8)(n-1)
2. Yes, the method applied by @rahul is correct.