Simulate on a vertical time axis (with events labeled with the senders names A-D) the contention period of FOUR equally distanced Ethernet stations that all attempt to transmit at T=0 a minimally sized frame, in the style of the binary Exponential Backoff Algorithm. Assume that time is measured in slot times, and that exactly one slot time is needed to detect a collision (so that if two stations transmit at T=1 and collide, and one of them chooses a backoff time k=0, then that station will transmit again at T=2). Use as coin flip (source of randomness) an ID written in binary. use the bits in order from the least significant to the most significant. If for a given coin throw you need k bits, use the least significant ID bit extracted in the corresponding group of bits, as the least significant bit of the coin thrown. Start be writing the ID, which is 904012207 As example of the expected answer format, with the random sequence R: 100101010101001011001010 01 01011 10010 1010 1010 010 110 010 10 01 0 1 0 1 1 if the counter used by backoff would be the one of personal collisions (rather the one for all heard collisions), the trace would be: T0: 1x 1x 0x 1x 0x T1: 1. 1. 01x. 1. 10x T2: 10x. 00x. 01 11x. 10 T3: 10. 100x. 010x 11. 10 T4: 10. 100. 010. 11. T T5: T. 100. 010. 11. _ T6: _. 100. x. 101x. _ T7: _ 100. 1010 010 _ T8. _. T. 1010. 010 _ T9. _. _ 1010. T _ T10. _. _ 1010. _ _ ... T17 _ _ T _ _
Simulate on a vertical time axis (with events labeled with the senders names A-D) the contention period of FOUR equally distanced Ethernet stations that all attempt to transmit at T=0 a minimally sized frame, in the style of the binary Exponential Backoff Algorithm. Assume that time is measured in slot times, and that exactly one slot time is needed to detect a collision (so that if two stations transmit at T=1 and collide, and one of them chooses a backoff time k=0, then that station will transmit again at T=2).
Use as coin flip (source of randomness) an ID written in binary.
use the bits in order from the least significant to the most significant. If for a given coin throw you need k bits, use the least significant ID bit extracted in the corresponding group of bits, as the least significant bit of the coin thrown.
Start be writing the ID, which is 904012207
As example of the expected answer format,
with the random sequence R: 100101010101001011001010 01 01011 10010 1010 1010 010 110 010 10 01 0 1 0 1 1
if the counter used by backoff would be the one of personal collisions (rather the one for all heard collisions), the trace would be:
T0: 1x 1x 0x 1x 0x
T1: 1. 1. 01x. 1. 10x
T2: 10x. 00x. 01 11x. 10
T3: 10. 100x. 010x 11. 10
T4: 10. 100. 010. 11. T
T5: T. 100. 010. 11. _
T6: _. 100. x. 101x. _
T7: _ 100. 1010 010 _
T8. _. T. 1010. 010 _
T9. _. _ 1010. T _
T10. _. _ 1010. _ _
...
T17 _ _ T _ _
Step by step
Solved in 2 steps
