a bus CSMA/CD network is operating at 100 Mbps.

A collision occurs 10 s after Q3 Assume the first bit of the frame emitted from the source sending station. What should be the minimum length of the frame so that the sender can detect the collision? A station only detects collisions by receiving bits and at the same time transmitting bits T=0 1st bit emitted

T=10us
collision occurs T=15us collision not detect yet! T=20us collision detected! = 2 = 100 2 10 = 2000 bits = 250Bytes Note: If a frame can detect any collisions in the network, then the minimum frame length is 2 _
1

Q1

Explain binary exponential back-off algorithm

After a collision, a station will wait for a certain number of time slots before it senses the medium/or transmit again. The number of time slots after k collisions is chosen as a uniformly distributed random integer in the range of {0,2k-1}, where k=min (k,10). The range then remains the same for 6 additional attempts after 10 retransmission attempts. The station gives up and reports an error after 16 unsuccessful attempts.
A(k=1) B(k=1) C(k=1) Collision ? A's random choose B's random choose C's random choose Y {0,1} {0,1} {0,1} A(k=2) C(k=2) Y {0,1,2,3} {0,1,2,3} A(k=3) B(k=2)

C idle N

Y idle {0,1,2,3,4,5,6,7} {0,1,2,3}

Note: for CSMA/CD this process happens during Contention period

2

Q3

Find the maximum normalised throughput of the CSMA/CD protocol. Here the question assume:

The contention period is slotted. Each time slot = 2 . (Note: this is to ensure any collision can be detected during each time slot) There are total n busy stations. (n>>1) Each station has a probability p to transmission. (note: here we use a simple static back-off strategy. i.e. the # of contention slots for stations to choose is fixed e.g. W. Then p= 1/W) If only one station transmits within one contention slot, and contention period stops and the only station occupies the link and starts to transmit frame After frame is received, new contention period starts the normalised throughput

= + +
tcontention is a random number, the average value is

2 =

Max throughput is achieved at minimum ttotal i.e. minimum tcontention Or in other words max Psuccess
3

Success means in one contention slot only one station intends to transmit. The probability of one station transmit is p The probability of all other stations are not transmit is (1-p)n-1
1 (1 )1 = (1 )1 =

By letting

= 0, we can see that Psuccess is maximised when p=1/n

1 1 1 1 = (1 )1 = (1 )1

( 1)

+ +

2 + +

1 = = 2 + + 1 + 2 + 1
=
4