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.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
pseudo code is the code written when converting the algorithm/ flow chart to actual code.
So it is in between the compiled code and flow chart. It is something that is not compiled but can be on
a notepad.
Create Date
:
Saturday, March 15, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
An authentication mechanism in which a Web application authenticates itself to a Web server by sending the server a message
digest along with its HTTP request message. The digest is computed by employing a one-way hash algorithm to a concatenation
of the HTTP request message and the client's password. The digest is typically much smaller than the HTTP request and doesn't
contain the password.
Create Date
:
Tuesday, May 13, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
Algorithmic process used for routing traffic that surmises information by assuming symmetrical network conditions. For example, if node A receives a packet from node B through intermediate node C, the backward-learning routing algorithm will assume that A can optimally reach B through C.
Create Date
:
Saturday, May 10, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
The running of a data set through an algorithm that reduces the space required to store or the bandwidth required to transmit the data set. Compare with companding and expansion.
Create Date
:
Saturday, May 10, 2008
Click here
to improve the Interview Question, Answer and other fields.
|
|
Inappropriate
|
See Answer
To Email:
Subject:
Note to go along with the question: (Optional, no
more than 1,000 characters)
Next-generation APPN that replaces the label-swapping routing algorithm with source routing. Also called high-performance routing.
Create Date
:
Saturday, May 10, 2008
Click here
to improve the Interview Question, Answer and other fields.