Binary Exponential Backoff Algorithm was chosen to dynamically adapt to the number of stations trying to send. If the randomization interval for all collision was 1023 slots, the chance of two stations colliding for a second time  would be negligible, but the average wait after a collision would be hundreds of slot times, introducing significant delay. On the other hand, if each station always delayed for either 0 or 1 slot, then if 100 stations ever tried to send at once, they would collide over and over until 99 of them picked 1 and the remaining station picked 0. This may take years. But having the randomization interval grow exponentially as more and more consecutive collisions occur, the algorithm ensures a low delay when only a few stations collide but also ensures that the collision is resolved in a reasonable interval when many stations collide. Truncating the backoff at 1023 keeps the bound from growing too large.

Process of storing numeric data with the least-significant bytem first. Used for integers and addresses on devices with Intel microprocessors.

Method of storing or transmitting data in which the most significant bit or byte is presented first. Compare with littleendian.

Public interface ServletContext: The ServletContext interface gives servlets access to information about their environment, and allows them to log significant events. Servlet writers decide what data to log. The interface is implemented by services, and used by servlets. Different virtual hosts should have different servlet contexts.

.

In the most significant bit. Bit is on if -ve, off if +ve.