Let us now see how randomization is done when a collision occurs. After a （ ）, time is divided into discrete slots whose length is equal to the worst-case round-trip propagation time on the ether(2τ). To accommodate the longest path allowed by Ethernet, the slot time has been set t0 512 bit times, or 51.2μsec.
After the first collision, each station waits either 0 or 1 （ ） times before trying again. If two stations collide and each one picks the same random number, they will collide again. After the second collision, each one picks either 0,1,2,or 3 at random and waits that number of slot times. If a third collision occurs(the probability of this happening is 0.25), then the next time the number of slots to wait is chosen at （ ）from the interval 0 to 23-1.
In general, after i collisions，a random number between 0 and 2i-1 is chosen, and that number of slots is skippeD. However, after ten collisions have been reached, the randomization（ ） is frozen at a maximum of 1023 slots. After 16 collisions, the controller throws in the towel and reports failure back to the computer. Further recoveryis up to （ ） layers.
问题1选项
A.datagram
B.collision
C.connection
D.service
问题2选项
A.slot
B.switch
C.process
D.fire
问题3选项
A.rest
B.random
C.once
D.odds
问题4选项
A.unicast
B.multicast
C.broadcast
D.interval
问题5选项
A.local
B.next
C.higher
D.lower
